Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Capkun, S., Hamdi, M., Hubaux, J.P.: GPS-free positioning in mobile ad hoc networks. In: Proceedings of the 34th HICSS (2001)
Bulusu, N., Heidemann, J., Estrin, D.: GPS-less low cost outdoor localization for very small devices. IEEE Personal Communications 7, 28–34 (2000)
Hightower, J., Borriella, G.: Location systems for ubiquitous computing. IEEE Computer Magazine 34, 57–66 (2001)
Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proceedings of 11 th Canadian Conference on Computational Geometry, pp. 51–54 (1999)
Basagni, S., Chlamtac, I., Syrotiuk, V.R., Woodward, B.A.: A distance routing effect algorithm for mobility DREAM. In: Proceedings of ACM MOBICOM 1998, Dallas, TX, pp. 76–84 (1998)
Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: Proceedings of ACM MOBICOM 2000 (2000)
Mauve, M., Widmer, J., Hartenstein, H.: A survey on position-based routing in mobile ad hoc networks. IEEE Network Magazine 15, 30–39 (2001)
Grossglauser, M., Vetterli, M.: Locating nodes with EASE: Last encounter routing in ad hoc networks through mobility diffusion. In: Proceedings of IEEE Infocom (2003)
Johnson, D.B., Maltz, D.A.: DSR: The Dynamic Source Routing Protocol for Multihop Wireless Ad Hoc Networks. In: Ad Hoc Networking, pp. 139–172. Addison-Wesley, Reading (2001)
Perkins, C.E., Royer, E.M.: Ad hoc on demand distance vector (AODV) routing. In: Proceedings of IEEE Wrokshop Mobile Computing systems and Applications, WMCSA 1999 (1999)
Viana, A.C., Amorim, M.D., Fdida, S., Rezende, J.F.: Indirect routing using distributed location information. To appear in ACM Wireless Networks (2004)
Eriksson, J., Faloutsos, M., Krishnamurthy, S.: Scalable ad hoc routing: The case for dynamic addressing. In: Proceedings of IEEE Infocom (2004)
Clausen, T., Jacquet, P.: Optimized Link State Routing Protocol (OLSR). Internet RFC 3626 (2003)
Mandel, L., Pouzet, M.: ReactiveML, http://www-spi.lip6.fr/~mandel/rml
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benbadis, F., de Amorim, M.D., Fdida, S. (2005). ELIP: Embedded Location Information Protocol. In: Boutaba, R., Almeroth, K., Puigjaner, R., Shen, S., Black, J.P. (eds) NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. NETWORKING 2005. Lecture Notes in Computer Science, vol 3462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422778_93
Download citation
DOI: https://doi.org/10.1007/11422778_93
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25809-4
Online ISBN: 978-3-540-32017-3
eBook Packages: Computer ScienceComputer Science (R0)