1688 search results - page 166 / 338 » Ant Routing in Mobile Ad Hoc Networks |
178
click to vote
NAS
2010
IEEE
15 years 4 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...
155
click to vote
GLOBECOM
2008
IEEE
16 years 28 days 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...
178
click to vote
JNW
2007
15 years 6 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...
161
click to vote
WIOPT
2010
IEEE
15 years 4 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...
163
click to vote
CN
2006
15 years 6 months ago
2006
In this paper, we present MuSeQoR: a new multi-path routing protocol that tackles the twin issues of reliability (protection against failures of multiple paths) and security, whil...