Sciweavers

25 search results - page 1 / 5
» Minimizing recovery state In geographic ad-hoc routing
Sort
View
MOBIHOC
2006
ACM
14 years 3 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
IWSOS
2007
Springer
13 years 10 months ago
Mercator: Self-organizing Geographic Connectivity Maps for Scalable Ad-Hoc Routing
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...
Luis A. Hernando, Unai Arronategui
PERCOM
2007
ACM
14 years 3 months ago
A Scalable Geographic Service Provision Framework for Mobile Ad Hoc Networks
Supporting scalable and efficient routing and service provision in Mobile Ad Hoc Networks (MANET) has been a big research challenge. Conventional topology-based unicast and multic...
Xiaojing Xiang, Xin Wang
ICC
2008
IEEE
141views Communications» more  ICC 2008»
13 years 10 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
WIMOB
2007
IEEE
13 years 10 months ago
A Fault Resilient Routing Protocol for Mobile Ad-Hoc Networks
— In a Mobile Ad hoc NETwork (MANET), mobile devices cooperate to forward packets for each other without the assistance of dedicated routing infrastructures. Due to its networkin...
Sirisha Medidi, Jiong Wang