Abstract
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we propose a simple and efficient distributed algorithm for calculating connected dominating set in ad hoc wireless networks, where connections of nodes are determined by their geographical distances. We also propose an update/recalculation algorithm for the connected dominating set when the topology of the ad hoc wireless network changes dynamically. Our simulation results show that the proposed approach outperforms a classical algorithm in terms of finding a small connected dominating set and doing so quickly. Our approach can be potentially used in designing efficient routing algorithms based on a connected dominating set.
Similar content being viewed by others
References
D. Bertsekas and R. Gallager, Data Networks, 2nd ed. (Prentice-Hall, Englewood Clifs, NJ, 1992).
P. Bose, P. Morin, I. Stojmenovic and J. Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, in: Proc. of the 3rd Internat. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 1999, pp. 48-55.
I. Castineyra, N. Chiappa and M. Steenstrup, The nimrod routing architecture, in: RFC 1992, August 1996.
C. Cheng, R. Riley, S.P.R. Kumar and J.J. Garcia-Luna-Aceves, A loop free Bellman-Ford routing protocol without bouncing effect, in: ACM SIGCOMM '89, 1989, pp. 224-237.
M.S. Corson and A. Ephremides, A distributed routing algorithm for mobile wireless networks, ACM Journal on Wireless Networks 1(1) (1995) 61-81.
B. Das and V. Bhargavan, Routing in ad hoc networks using minimum connected dominating sets, in: IEEE Internat. Conf. on Communications (ICC '97), June 1997.
B. Das, E. Sivakumar and V. Bhargavan, Routing in ad hoc networks using a virtual backbone, in: Proc. of the 6th Internat. Conf. on Computer Communications and Networks (IC3N '97), September 1997, pp. 1-20.
B. Das, R. Sivakumar and V. Bhargavan, Routing in ad hoc networks using a spine, in: IEEE Internat. Conf. on Computers and Communications Networks '97, 1997.
E. Gafni and D.P. Bertsekas, Distributed algorithms for generating loop-free routes with frequently changing topology, IEEE Transactions on Communications 29(1) (1981) 11-18.
J.J. Garcia-Luna-Aceves, A unified approach to loop-free routing algorithm using distance vector or link states, in: Proc. of ACM SIGCOMM Symposium on Communication, Architectures and Protocols, September 1989, pp. 212-213.
S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20(4) (April 1998) 374-387.
T.W. Haynes, S.T. Hedetniemi and P.J. Slater, in: Fundamentals of Domination in Graphs, A Series of Monographs and Text Books (Marcel Dekker, New York, 1998).
C. Hedrick, Routing information protocol, Internet Request for Comments RFC 1058 (June 1988).
J.M. Jaffe and F.H. Moss, A responsive distributed routing algorithm for computer networks, IEEE Transactions on Communications 30(7) (1979) 1758-1762.
D.B. Johnson, Routing in ad hoc networks of mobile hosts, in: Proc. of Workshop on Mobile Computing Systems and Applications, December 1994, pp. 158-163.
D.B. Johnson and D.A. Malts, Dynamic source routing in ad hoc wireless networks, in: Mobile Computing, eds. T. Imielinski and H. Korth (Kluwer Academic, Dordrecht, 1996).
J. Jubin and J.D. Tornow, The DARPA packet radio network protocols, Proceedings of the IEEE 75(1) (January 1987) 21-32.
H. Koch, H. Krombholz and O. Theel, A breif introduction to the world of mobile computing, Technical Report THD-BS-1993-03, Computer Science Department, University of Darmstadt, Germany (1993).
P. Krishna, M. Chatterjee, N.H. Vaidya and D.K. Pradhan, A cluster-based approach for routing in ad hoc networks, in: Proc. of the 2nd USENIX Symposium on Mobile and Location-Independent Computing, 1995, pp. 1-10.
J.M. McQuillan, I. Richer and E.C. Rosen, The new routing algorithm for ARPANET, IEEE Transactions on Communications 28(5) (1980) 711-719.
J.M. McQuillan and D.C. Walden, The ARPA network design decisions, Computer Networks 1(5) (August 1977) 243-289.
P.M. Merlin and A. Segal, A fail safe distributed routing protocol, IEEE Transactions on Communications 27(9) (1979) 1280-1287.
J. Moy, OSPF version 2, Internet Request for Comments RFC 1247 (July 1991).
S. Murthy and J.J. Garcia-Luna-Aveces, A routing protocol for packet radio networks, in: Proc. of ACM Internat. Conf. on Mobile Computing and Networking, November 1995, pp. 86-95.
M.R. Pearlman and Z.J. Hass, Determining the optimal configuration for the zone routing protocol, IEEE Journal on Selected Areas in Communications (August 1999) 1395-1399.
C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance vector routing (DSDV) for mobile computers, Computer Communications Review 24(4) (1994) 234-244.
M. Schwartz and T.E. Stern, Routing techniques used in communication networks, in: Proc. of IEEE INFOCOM, May 1987, pp. 218-226.
R. Sivakumar, B. Das and V. Bharghavan, An improved spine-based infrastructure for routing in ad hoc networks, in: Proc. of the Internat. Symp. on Computers and Communications (ISCC'98), 1998.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wu, J., Li, H. A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks. Telecommunication Systems 18, 13–36 (2001). https://doi.org/10.1023/A:1016783217662
Issue Date:
DOI: https://doi.org/10.1023/A:1016783217662