A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE 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
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
ReactiveML: a reactive extension to ML
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
ACM Computing Surveys (CSUR)
A survey of adaptive services to cope with dynamics in wireless self-organizing networks
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
It has been recently shown that mobility in ad hoc networks can be an advantage instead of an inconvenience. Nevertheless, one class of mobile elements has been neglected up-to-date: data packets. In this paper, we propose to take advantage of the inherent mobility of data packets to disseminate location information throughout the network. We focus on the age-and-position based (APB) routing case. Knowing its own geographic or virtual coordinates is not enough since a source needs to discover the position of the destination before establishing a communication. This is the role of a location service, which depends, in turn, on an efficient location distribution/publishing system. Our proposal, Embedded Location Information Protocol (ELIP), allows nodes to piggyback their coordinates in existing data packets in order to efficiently disseminate their positions in the network. Contrary to traditional approaches that depend on encounters between nodes, ELIP converges much faster and does not require permanent node mobility.