Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPS-free Positioning in Mobile Ad Hoc Networks
Cluster Computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
On the pitfalls of geographic face routing
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Path Vector Face Routing: Geographic Routing with Local Face Information
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Lazy cross-link removal for geographic routing
Proceedings of the 4th international conference on Embedded networked sensor systems
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Geographic routing without planarization
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Scalable geographic routing algorithms for wireless ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Personal and Ubiquitous Computing
Hi-index | 0.00 |
In this paper, we consider spontaneous wireless mesh networks that can provide wide coverage connectivity to mobile nodes. Our mobility scheme builds upon separation between a persistent node identifier and its current address. When joining the mesh, a mobile node associates with a mesh router that updates a location service managed in the mesh as a distributed hash table. Mobility implies changing addresses while a node moves in the mesh. To keep the rate of location updates and correspondent node notifications low, the address of the new mesh router with which the mobile node is associated needs to be topologically close to the previous one. Thus, such a mobility scheme requires an addressing space with specific properties. We achieve this by defining an algorithm for constructing a pseudo-geographical addressing space: a few nodes know their exact locations and others estimate their relative positions to form a topologically consistent addressing space. Such an addressing space also enables scalable and low overhead routing in the wireless mesh---we propose a trajectory based long distance ballistic geographical routing.