1686 search results - page 165 / 338 » Content-Based Routing in Mobile Ad Hoc Networks |
NAS
2010
IEEE
14 years 8 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
105
click to vote
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
—Routing in ad-hoc networks can consume considerable amount of battery power. However, as the nodes in these networks have limited power, routing is very much energy-constrained....
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
JNW
2007
14 years 10 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
WIOPT
2010
IEEE
14 years 8 months ago
2010
IEEE
—In this paper we describe a framework for the optimal control of delay tolerant mobile ad hoc networks where multiple classes of nodes co-exist. We specialize the description of...