Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Onus, M., Richa, A., Kothapalli, K., Scheideler, C.: Constant density spanners for wireless ad-hoc networks. In: ACM SPAA (2005)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobil ad-hoc routing. In: ACM DIALM (2002)
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)
Perkins, C.: Adhoc on demand distance vector (aodv) routing, Internet draft, draft–ietf–manet–aodv–04.txt (1999)
Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Mobile Computing, vol. 353, Kluwer Academic Publishers, Dordrecht (1996)
Perkins, C., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In: Proc. of ACM SIGCOMM, pp. 234–244 (1994)
Park, V., Corson, M.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proceedings of IEEE Infocom, pp. 1405–1413 (1997)
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)
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)
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)
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)
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)
Yao, A.C.C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comp. 11, 721–736 (1982)
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)
Parthasarathy, S., Gandhi, R.: Distributed algorithms for coloring and domination in wireless ad hoc networks. In: Proc. of FSTTCS (2004)
Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: ACM SPAA, pp. 39–48 (2005)
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)
Krumke, S., Marathe, M., Ravi, S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks 7(6), 575–584 (2001)
Dijkstra, E.W.: Self stabilization in spite of distributed control. Communications of the ACM 17, 643–644 (1974)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khot, R., Poola, R., Kothapalli, K., Srinathan, K. (2007). Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks. In: Janowski, T., Mohanty, H. (eds) Distributed Computing and Internet Technology. ICDCIT 2007. Lecture Notes in Computer Science, vol 4882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77115-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-77115-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77112-8
Online ISBN: 978-3-540-77115-9
eBook Packages: Computer ScienceComputer Science (R0)