A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks

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.

[1]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[2]  David C. Walden,et al.  The ARPA Network Design Decisions , 1977, Comput. Networks.

[3]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[4]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[5]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[6]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[7]  J. J. Garcia-Luna-Aceves,et al.  A routing protocol for packet radio networks , 1995, MobiCom '95.

[8]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[9]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[10]  Adrian Segall,et al.  A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..

[11]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[12]  Dhiraj K. Pradhan,et al.  A Cluster-based Approach for Routing in Ad-Hoc Networks , 1995, Symposium on Mobile and Location-Independent Computing.

[13]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[14]  J. J. Garcia-Luna-Aceves,et al.  A loop-free extended Bellman-Ford routing protocol without bouncing effect , 1989, SIGCOMM 1989.

[15]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[16]  Wang Heng-jun.  Routing in AD HOC Networks of Mobile Hosts , 2002 .

[17]  J. J. Garcia-Luna-Aceves.  A unified approach to loop-free routing using distance vectors or link states , 1989, SIGCOMM 1989.

[18]  Zygmunt J. Haas,et al.  Determining the optimal configuration for the zone routing protocol , 1999, IEEE J. Sel. Areas Commun..

[19]  J. Noel Chiappa,et al.  The Nimrod Routing Architecture , 1996, RFC.

[20]  J. Jubin,et al.  The DARPA packet radio network protocols , 1987, Proceedings of the IEEE.

[21]  Jeffrey M. Jaffe,et al.  A Responsive Distributed Routing Algorithm for Computer Networks , 1982, ICDCS.

[22]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[23]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[24]  Charles L. Hedrick,et al.  Routing Information Protocol , 1988, RFC.

[25]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[26]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[27]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.