Advertisement

Energy-Efficient Face Routing on the Virtual Spanner

  • Héctor Tejeda
  • Edgar Chávez
  • Juan A. Sanchez
  • Pedro M. Ruiz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4104)

Abstract

Geographic routing protocols are one of the most common routing schemes for sensor networks. These protocols consist of two different modes of operation: greedy routing to forward data to the destination using neighbors which are closer to the destination than current node and face routing to avoid voids in the network. Face routing requires the graph to be planar, which usually means that some crossing links of the original network cannot be considered when routing in face mode. In this paper we introduce a new localized scheme to build a virtual spanner which is planar by construction and is guaranteed to be connected if the underlying network is connected as well. Unlike previous works, by performing face routing over this spanner we can reduce energy consumption in face mode because the elimination of any of the original links in the network is not required. Thus, the most energy-efficient paths can be selected when the protocol enters face mode. The virtual spanner is easy-to-build and uses only local information, making it scalable to large-scale networks. Routing is always performed in real nodes; virtual nodes are used only as routing anchors when the agent is in face mode. In addition, our simulation results show that the proposed scheme outperforms the best energy-efficient geographic routing protocol for different network densities and energy models.

Keywords

Virtual Node Virtual Link Unit Disk Graph Short Path Tree Transmission Radius 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BCG+04]
    Boone, P., Chávez, E., Gleitzky, L., Kranakis, E., Opatrny, J., Salazar, G., Urrutia, J.: Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 23–34. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  2. [BMSU01]
    Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad-hoc wireless networks. ACM/Kluwer Wireless Networks 7(6), 609–616 (2001)MATHCrossRefGoogle Scholar
  3. [GS69]
    Gabriel, K., Sokal, R.: A new statistical approach to geographic variation analysis. Systematic Zoology 18, 259–278 (1969)CrossRefGoogle Scholar
  4. [KNS04]
    Kuruvila, J., Nayak, A., Stojmenovic, I.: Progress Based Localized Power and Cost Aware Routing Algorithms for Ad Hoc and Sensor Wireless Networks. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2004. LNCS, vol. 3158, pp. 294–299. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. [RM98]
    Rodoplu, V., Meng, T.: Minimum energy mobile wireless networks. In: ICC 1998: Proceedings of the 1998 IEEE International Conference on Communications, vol. 3, pp. 1633–1639. ACM Press, New York (June 1998)Google Scholar
  6. [SL01]
    Stojmenovic, I., Lin, X.: Power aware localized routing in ad hoc networks. IEEE Trans. Paralled Distributed Systems 12(10), 1023–1032 (2001)CrossRefGoogle Scholar
  7. [Tou80]
    Toussaint, G.: The relative neighbourhood graph of a finite planar set. Pattern Recognition 12(4), 261–268 (1980)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Héctor Tejeda
    • 1
  • Edgar Chávez
    • 1
  • Juan A. Sanchez
    • 2
  • Pedro M. Ruiz
    • 2
  1. 1.Escuela de Ciencias Físico-MatemáticasUniversidad MichoacanaMéxico
  2. 2.Facultad de InformáticaUniversity of MurciaSpain

Personalised recommendations