Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4882)


This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the message from the source to the destination. In theory, models that have been used oversimplify the problem of route discovery in ad hoc networks. The achievement of this paper is threefold. First we use a more general model in which nodes can have different transmission and interference ranges and we present a new routing algorithm for wireless ad hoc networks that has several nice features. We then combine our algorithm with that of known greedy algorithms to arrive at an average case efficient routing algorithm in the situation that GPS information is available. Finally we show how to schedule unicast traffic between a set of source-destination pairs by providing a proper vertex coloring of the nodes in the wireless ad hoc network. Our coloring algorithm achieves a O(Δ)–coloring that is locally distinct within the 2-hop neighborhood of any node.


Time Slot Transmission Range Active Node Receive Signal Strength Indication Request Message 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Proc. 13th International Symposium on Algorithms and Computation, pp. 535–549 (2002)Google Scholar
  2. 2.
    Onus, M., Richa, A., Kothapalli, K., Scheideler, C.: Constant density spanners for wireless ad-hoc networks. In: ACM SPAA (2005)Google Scholar
  3. 3.
    Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobil ad-hoc routing. In: ACM DIALM (2002)Google Scholar
  4. 4.
    Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: Proc. of the 22nd IEEE Symp. on Principles of Distributed Computing (PODC) (2003)Google Scholar
  5. 5.
    Perkins, C.: Adhoc on demand distance vector (aodv) routing, Internet draft, draft–ietf–manet–aodv–04.txt (1999)Google Scholar
  6. 6.
    Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Mobile Computing, vol. 353, Kluwer Academic Publishers, Dordrecht (1996)Google Scholar
  7. 7.
    Perkins, C., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: Proc. of ACM SIGCOMM, pp. 234–244 (1994)Google Scholar
  8. 8.
    Park, V., Corson, M.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proceedings of IEEE Infocom, pp. 1405–1413 (1997)Google Scholar
  9. 9.
    Broch, J., Maltz, D., Johnson, D., Hu, Y., Jetcheva, J.: A performance comparison of multi-hop wireless ad hoc network routing protocols. In: Proceedings of the 4th annual ACM/IEEE International conference on Mobile computing and networking, pp. 85–97 (1998)Google Scholar
  10. 10.
    Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks. In: MobiHoc 2001. Proc. of the 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing, pp. 45–55 (2001)Google Scholar
  11. 11.
    Bose, P., Morin, P., Brodnik, A., Carlsson, S., Demaine, E., Fleischer, R., Munro, J., Lopez-Ortiz, A.: Online routing in convex subdivisions. In: International Symposium on Algorithms and Computation (ISSAC), pp. 47–59 (2000)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, pp. 267–278 (2003)Google Scholar
  14. 14.
    Yao, A.C.C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comp. 11, 721–736 (1982)Google Scholar
  15. 15.
    Hassin, Y., Peleg, D.: Sparse communication networks and efficient routing in the plane. In: Proceedings of the ACM symposium on Principles of distributed computing, pp. 41–50 (2000)Google Scholar
  16. 16.
    Parthasarathy, S., Gandhi, R.: Distributed algorithms for coloring and domination in wireless ad hoc networks. In: Proc. of FSTTCS (2004)Google Scholar
  17. 17.
    Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: ACM SPAA, pp. 39–48 (2005)Google Scholar
  18. 18.
    Kumar, V.A., Marathe, M., Parthasarathy, S., Srinivasan, A.: End-to-end packet-scheduling in wireless ad-hoc networks. In: ACM SODA, pp. 1021–1030 (2004)Google Scholar
  19. 19.
    Krumke, S., Marathe, M., Ravi, S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks 7(6), 575–584 (2001)Google Scholar
  20. 20.
    Dijkstra, E.W.: Self stabilization in spite of distributed control. Communications of the ACM 17, 643–644 (1974)Google Scholar
  21. 21.
    Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: Proc. of the 17th ACM Symposium on Theory of Computing (STOC), pp. 1–10 (1985)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  1. 1.Center for Security, Theory, and Algorithmic Research, International Institute of Information Technology, Gachibowli Hyderabad 500 032India

Personalised recommendations