A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geographical Region Summary Service for geographical routing
ACM SIGMOBILE Mobile Computing and Communications Review
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
GPS-free Positioning in Mobile Ad Hoc Networks
Cluster Computing
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The capacity of wireless networks
IEEE Transactions on Information Theory
An adaptive distance-based location update algorithm for next-generation PCS networks
IEEE Journal on Selected Areas in Communications
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Weak state routing for large scale dynamic networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Diversity of forwarding paths in pocket switched networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Pervasive and Mobile Computing
Decentralized Movement Pattern Detection amongst Mobile Geosensor Nodes
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Coping with episodic connectivity in heterogeneous networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Delay management in delay-tolerant networks
International Journal of Network Management
Performance evaluation of location-aided routing protocols in ad hoc networks
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the subcritical regime
IEEE/ACM Transactions on Networking (TON)
Hash-Based Virtual Hierarchies for Scalable Location Service in Mobile Ad-hoc Networks
Mobile Networks and Applications
Restricted mobility improves delay-throughput tradeoffs in mobile ad hoc networks
IEEE Transactions on Information Theory
Routing for disruption tolerant networks: taxonomy and design
Wireless Networks
Weak state routing for large-scale dynamic networks
IEEE/ACM Transactions on Networking (TON)
HLLS: A History information based Light Location Service for MANETs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.06 |
Routing in large-scale mobile ad hoc networks is challenging because all the nodes are potentially moving. Geographic routing can partially alleviate this problem, as nodes can make local routing decisions based solely on the destinations' geographic coordinates. However, geographic routing still requires an efficient location service, i.e., a distributed database recording the location of every destination node. Devising efficient, scalable, and robust location services has received considerable attention in recent years.The main purpose of this paper is to show that node mobility can be exploited to disseminate destination location information without incurring any communication overhead. We achieve this by letting each node maintain a local database of the time and location of its last encounter with every other node in the network. This database is consulted by packets to obtain estimates of their destination's current location. As a packet travels towards its destination, it is able to successively refine an estimate of the destination's precise location, because node mobility has "diffused" estimates of that location.We define and analyze a very simple algorithm called EASE (Exponential Age Search) and show that in a model where Θ(n) nodes perform independent random walks on a square lattice of size , n the length of the routes computed by EASE are of the same order as the distance between the source and destination even for very large n. Therefore, without disseminating any explicit location information, the length of EASE routes are within a constant factor of routes obtained with perfect information. We discuss refinements of the EASE algorithm and evaluate it through extensive simulations. We discuss general conditions such that the mobility diffusion effect leads to efficient routes without an explicit location service. In practical settings, where these conditions may not always be met, we believe that the mobility diffusion effect can complement existing location services and enhance their robustness and scalability.