1464 search results - page 1 / 293 » Worst case mobility in ad hoc networks |
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
DIALM
2004
ACM
13 years 11 months ago
2004
ACM
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
ISPA
2004
Springer
13 years 11 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 ...
MOBIHOC
2003
ACM
14 years 5 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...