Advertisement

Position-Based Routing in Wireless Ad Hoc and Sensor Networks

  • Nathalie Mitton
  • Tahiry Razafindralambo
  • David Simplot-Ryl
Chapter
Part of the Monographs in Theoretical Computer Science. An EATCS Series book series (EATCS)

Abstract

Geometric routing protocols are a memoryless and scalable approach which uses position information for routing. Principles of geometric routing approaches are very simple. Every node is assumed to be aware of the location of itself, of its neighbors, and of the destination. Based only on these information, every node is able to perform a routing decision. The location can be determined by either geographic coordinates (we thus talk of geographic routing) or logical coordinates extracted from the environment. In the former case, location coordinates may be derived thanks to GPS or estimated thanks to any other positioning mean such as triangulation. In the latter case, a new coordinate system has to be built. This chapter reviews the main routing algorithms in every coordinate-based system, highlighting the strengths and weaknesses of each of them.

Keywords

Short Path Destination Node Target Node Current Node Anchor Node 
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

  1. 1.
    S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward. A distance routing effect algorithm for mobility (dream). In: Proceedings of the 4th ACM Annual International. Conference on Mobile Computing and Networking (MOBICOM), pages 76–84, Dallas, Texas, 1998.Google Scholar
  2. 2.
    F. Benbadis, J-J. Puig, M.Dias de Amorim, C. Chaudet, T. Friedman, and D. Simplot-Ryl. Jumps: Enhanced hop-count positioning in sensor networks using multiple coordinates. International Journal on Ad Hoc & Sensor Wireless Networks, 2008.Google Scholar
  3. 3.
    P. Boone, E. Chavez, L. Gleitzky, E. Kranakis, J. Opartny, G. Salazar and J. Urrutia Morelia Test. Improving the efficiency of the gabriel test and face routing in Ad-hoc Networks Lecture Notes in Computer Science , 3104:23–24, 2004, 2008.CrossRefGoogle Scholar
  4. 4.
    P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication (DIAL-M), pages 48–55, Seattle, WA, August, 1999.Google Scholar
  5. 5.
    J. Carle and D. Simplot-Ryl. Energy efficient area monitoring by sensor networks. IEEE Computer Magazine, 37:40–46, 2004.Google Scholar
  6. 6.
    S. Capkun, M. Hamdi and J-P Hubaux. GPS-Free positioning in mobile ad-hoc networks In: Proceedings of the Hawaii International Conference on System Sciences HICSS, Hawaii, USA, 2001, 2005.Google Scholar
  7. 7.
    A. Caruso, S. Chessa, S. De, and A. Urpi. Gps free coordinate assignment and routing in wireless sensor networks. In: Proceedings of the 24th Conference of the IEEE Communications Society (INFOCOM), volume 1, pages 150–160, Miami, USA, March, 2005.Google Scholar
  8. 8.
    E. Chávez, N. Mitton, and H. Tejeda. Routing in wireless networks with position trees. In: Proceedings of the 6th International Conference on AD-HOC Networks & Wireless (Ad Hoc Now), Morelia, Mexico, September 2007.Google Scholar
  9. 9.
    E. Chávez, M. Fraser, and H. Tejeda. Proximal labeling for oblivious routing in wireless ad hoc networks. In ADHOC-NOW ’09: Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks, Springer, Berlin, pages 360–365, 2009.Google Scholar
  10. 10.
    T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, A. Qayyum, and L. Viennot. Optimized link state routing protocol (OLSR), 2003. RFC 3626.Google Scholar
  11. 11.
    E. H. Elhafsi, N. Mitton, and D. Simplot-Ryl. Cost over progress based energy efficient routing over virtual coordinates in wireless sensor networks. In: Proceedings of IEEE International Workshop: From Theory to Practice in Wireless Sensor Networks (t2pWSN), Helsinki, Finland, 2007.Google Scholar
  12. 12.
    E.H. Elhafsi, N. Mitton, and D. Simplot-Ryl. End-to-end energy efficient geographic path discovery with guaranteed delivery in ad hoc and sensor networks. In: Proceedings of the 19th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Cannes, France, September 2008.Google Scholar
  13. 13.
    Q. Fang, J. Gao, L.J. Guibas, V. de Silva, and Li Zhang. GLIDER: gradient landmark-based distributed routing for sensor networks. In: Proceedings of the \(24\mathit{th}\) Conference of the IEEE Communications Society (INFOCOM), volume 1, pages 339–350, Miami, USA, March 2005.Google Scholar
  14. 14.
    G.G. Finn. Routing and addressing problems in large metropolitan-scale. Internetworks, ISI Research Report ISU/RR-87-180, March 1987.Google Scholar
  15. 15.
    H. Frey, and I. Stojmenovic. On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks. Proceedings of the \(12\mathit{th}\) ACM Annual International Conference on Mobile Computing and Networking (MOBICOM), Los Angeles, CA, ages 390–401, September 2006.Google Scholar
  16. 16.
    T.-C. Hou and V. Li. Transmission range control in multihop packet radio networks. Communications, IEEE Transactions on [legacy, pre - 1988], 34(1):38–44, 1986.Google Scholar
  17. 17.
    Y-B Ko and N. H. Vaidya. Location-aided routing (lar) in mobile ad hoc networks. In: Proceedings of the \(4\mathit{th}\) ACM Annual Int. Conference on Mobile Computing and Networking (MOBICOM), pages 66–75, Dallas, Texas, 1998.Google Scholar
  18. 18.
    E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In: Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG), Vancouver, Canda, 1999.Google Scholar
  19. 19.
    J. Kuruvila, A. Nayak, and I. Stojmenovic. Progress and location based localized power aware routing for ah hoc sensor wireless networks. IJDSN, 2:147–159, 2006.Google Scholar
  20. 20.
    J. Li, L. Gewali, H. Selvaraj and V. Muthukumar. Hybrid Greedy/Face Routing for Ad-Hoc Sensor Networks. In DSD Journal, Los Alamitos, CA, 0:574–578, 2004.Google Scholar
  21. 21.
    X. Lin and I. Stojmenovic. Geographic distance routing inad hoc wireless networks. Technical Report TR-98-10, SITE, University of Ottawa, December 1998.Google Scholar
  22. 22.
    K. Liu and Nael Abu-Ghazaleh. Stateless and guaranteed geometric routing on virtual coordinate systems. In: Proceedings of the IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS), pages 340–346, October 2006.Google Scholar
  23. 23.
    Ke Liu and Nael Abu-Ghazaleh. Aligned virtual coordinates for greedy routing in wsns. In Proceedings of the IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS), pages 377–386, October 2006.Google Scholar
  24. 24.
    N. Mitton, T. Razafindralambo, D. Simplot-Ryl, and I. Stojmenovic. Hector is an energy efficient tree-based optimized routing protocol for wireless networks. In Proceedings of the \(4\mathit{th}\) International Conference on Mobile Ad-hoc and Sensor Networks (MSN), Wuhan, China, December 2008.Google Scholar
  25. 25.
    N. Mitton, D. Simplot-Ryl, and I. Stojmenovic. Guaranteed delivery for geographical anycasting in wireless multi-sink sensor and sensor-actor networks. In: Proceedings of the \(28\mathit{th}\) Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brasil, April 2009.Google Scholar
  26. 26.
    Nelson, R. and Kleinrock L. The spatial capacity of a slotted ALOHA multihop packet radio network with capture In IEEE Transactions on Communications, 32, 6: 684–689, June 1984.CrossRefGoogle Scholar
  27. 27.
    D. Niculescu and B. Nath. Ad hoc positioning system (APS). In: Proceedings of IEEE Global communications conference GLOBECOM, San Antonio, USA, 2001.Google Scholar
  28. 28.
    N. Patwari, J.N. Ash, S. Kyperountas, A.O. III Hero, R.L. Moses, and N.S. Correal. Locating the nodes: Cooperative localization in wireless sensor networks. Signal Processing Magazine, IEEE, 22(4):54–69, July 2005.CrossRefGoogle Scholar
  29. 29.
    C. Perkins, E. Belding-Royer, and S. Das. Ad hoc on-demand distance vector routing, 2003. RFC 3561.Google Scholar
  30. 30.
    A. Rao, C. H. Papadimitriou, S. Shenker and I. Stoica. Geographic routing without location information, Proceedings of the 9th ACM Annual International Conference on Mobile Computing and Networking (MOBICOM), 96–108, 2003.Google Scholar
  31. 31.
    J.A. Sanchez and P.M. Ruiz. Exploiting local knowledge to enhance energy-efficient geographic routing. In: Proceedings of the 2nd International Conference on Mobile Ad-hoc and Sensor Networks MSN, pages 567–578, December 2006.Google Scholar
  32. 32.
    I. Stojmenovic, S. Datta. Power and cost Aware Localized Routing with guaranteed delivery in wireless networks. Wireless Communication and Mobile Computing, 2(4):175–188, 2004.CrossRefGoogle Scholar
  33. 33.
    I. Stojmenovic and X. Lin. Loop-Free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks IEEE Transactions Parallel Distribution Systems (TPDS), 12(10):1023–1032, 2001.CrossRefGoogle Scholar
  34. 34.
    I. Stojmenovic and X. Lin. Power-aware localized routing in wireless networks. IEEE Transactions Parallel Distribution Systems (TPDS), 12(11):1122–1133, 2001.CrossRefGoogle Scholar
  35. 35.
    H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE transaction on communications, com-22(3):246–257, 1984.CrossRefGoogle Scholar
  36. 36.
    G. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition Journal, 12(4):261–268, 1980.MATHCrossRefMathSciNetGoogle Scholar
  37. 37.
    M-J Tsai, H-Y Yang, and W-Q Huang. Axis-based virtual coordinate assignment protocol and delivery-guaranteed routing protocol in wireless sensor networks. In: Proceedings of the \(26\mathit{rd}\) Conference of the IEEE Communications Society (INFOCOM), volume 1, pages 2234–2242, May 2007.Google Scholar
  38. 38.
    G. Voronoi. New applications, from continuous parameter to quadratic shape theory. Journal für die Reine und Angewandte Mathematik, 133:97–178, 1907.Google Scholar
  39. 39.
    Y. Wang, W.-Z. Song, W. Wang, X.-Y. Li, T.A. Dahlberg. LEARN: Localized energy aware restricted neighborhood routing for Ad Hoc networks. In: Proceedings of the \(3\mathit{rd}\) Annual IEEE Sensor and Ad Hoc Communications and Networks(SECON), 2, 508–517, 2006.Google Scholar
  40. 40.
    T. Watteyne, I. Augé-Blum, M. Dohler, S. Ubeda, and D. Barthel, Centroid virtual coordinates - A novel near-shortest path routing paradigm. To appera in International Journal of Computer and Telecommunications Networking, Elsevier, 53(10):1697–1711, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Nathalie Mitton
    • 1
  • Tahiry Razafindralambo
    • 2
  • David Simplot-Ryl
    • 2
  1. 1.Centre de recherche INRIA Lille - Nord EuropeLilleFrance
  2. 2.INRIA Lille - Nord Europe / University of LilleLilleFrance

Personalised recommendations