Skip to main content
SpringerLink
Log in

Locally-constructed trees for ad-hoc routing

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

We present a family of self-stabilizing distributed algorithms to built a spanning tree on the underlying communications graph of an ad-hoc wireless network. Next, based on this principle, we show how to construct overlaying structures which are suitable for routing tasks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alzoubi, K., et al. (2003). Geometric spanners for wireless ad-hoc networks. IEEE Transactions on Parallel and Distributed Systems, 14(4), 408–421.

    Article  Google Scholar 

  2. Bose, P., et al. (1999). Routing with guaranteed delivery in ad-hoc wireless networks. In Proceedings of discrete algorithms and methods for mobility (DIALM’99) (pp. 48–55).

  3. Chang, T. (1983). Graph traversal techniques and the maximum flow problem in distributed computation. IEEE Transactions in Software Engineering, 9(4), 504–512.

    Article  Google Scholar 

  4. Demirbas, M., et al. (2006). A fault-local self-stabilizing clustering service for wireless ad-hoc networks. IEEE Transactions of Parallel and Distributed Systems, 17(9), 912–922.

    Article  Google Scholar 

  5. Dolev, S. (2000). Self-stabilization. Cambridge: MIT Press.

    Google Scholar 

  6. Holger, K., & Willig, A. (2005). Protocols and architectures for wireless sensor networks (pp. 231–249). New York: Wiley.

    Google Scholar 

  7. Jia, L., Rajaraman, R., & Scheideler, C. (2003). On local algorithms for topology control and routing in ad-hoc networks. In Proceedings of the 15th annual ACM symposium on parallel algorithms and architectures (pp. 220–229).

  8. Kranakis, E., Singh, H., & Urrutia, J. (1999). Compass routing on geometric networks. In Proceedings of 11th Canadian conference on computational geometry, Vancouver, August (pp. 51–54).

  9. Li, X.-Y., Călinescu, G., Wan, P.-J., & Wang, Y. (2003). Localized delaunay triangulation with application in ad-hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems, 14(10), 1035–1047.

    Article  Google Scholar 

  10. Li, X.-Y., Wang, Y., & Frieder, O. (2003). Localized routing for wireless ad-hoc networks. In Proceedings of IEEE ICC’03 (pp. 443–447).

  11. Penrose, M. D. (1999). On k-connectivity for a geometric random graph. Random Structures and Algorithms, 15, 145–164.

    Article  Google Scholar 

  12. Perlman, R. (1985). An algorithm for distributed computing of a spanning tree in an extended LAN. ACM SIGCOMM Computer Communications Review, 15(4), 44–53.

    Article  Google Scholar 

  13. Rajaraman, R. (2002). Topology control and routing in ad-hoc networks: A survey. SIGACT News, 33, 60–73.

    Article  Google Scholar 

  14. Song, W. Z., Wang, Y., & Li, X.-Y. (2004). Localized algorithms for energy efficient topology in wireless ad-hoc networks. In 5th ACM int. symp. on mobile ad-hoc networking and comp., Tokyo, Japan (pp. 98–108).

Download references

Author information

Authors and Affiliations

  1. Electrical Eng. Dept., UAMI, Atlixco 186, 09340, Mexico, Mexico

    Ricardo Marcelín-Jiménez

Authors
  1. Ricardo Marcelín-Jiménez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ricardo Marcelín-Jiménez.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Marcelín-Jiménez, R. Locally-constructed trees for ad-hoc routing. Telecommun Syst 36, 39–48 (2007). https://doi.org/10.1007/s11235-007-9055-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-007-9055-z

Keywords

Search

Navigation