On Shortest Path Routing Schemes for Wireless Ad Hoc Networks
- 312 Downloads
In this paper, we propose two new distributed algorithms for producing sets of nodes that can be used to form backbones of an ad hoc wireless network. Our focus is on producing small sets that are d-hop connected and d-hop dominating and have a desirable ‘shortest path property’. These algorithms produce sets that are considerably smaller than those produced by an algorithm previously introduced by the authors. One of these two new algorithms has constant-time complexity.
KeywordsShort Path Bipartite Graph Greedy Algorithm Message Passing Node Pair
Unable to display preview. Download preview PDF.
- 3.Jia, L., Rajaraman, R., Suel, T.: An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, August 2001, pp. 33–42 (2001)Google Scholar
- 5.Liang, B., Haas, Z.J.: Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management. In: Proc. 19th Ann. Joint Conf. IEEE Computer and Comm. Soc. INFOCOM, vol. 3, pp. 1293–1302 (2000)Google Scholar
- 6.Rieck, M.Q., Pai, S., Dhar, S.: Distributed Routing Algorithms for Wireless Ad Hoc Networks Using d-hop Connected d-hop Dominating Sets. In: Proceedings of the 6th Intl Conference on High Performance Computing in Asia Pacific, vol. 2, pp. 443–450 (2003)Google Scholar
- 7.Wu, J., Li, H.: A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks. Special issue on Wireless Networks in the Telecommunication Systems Journal 3, 63–84 (2001)Google Scholar