306 search results - page 21 / 62 » Routing Algorithms for Anycast Messages |
ISPA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
104
click to vote
ICDCIT
2007
Springer
15 years 5 months ago
2007
Springer
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
110
click to vote
TON
2010
14 years 10 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
104
click to vote
SIGCOMM
2004
ACM
15 years 5 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
120
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...