This Article 
 Bibliographic References 
 Add to: 
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
October 2004 (vol. 15 no. 10)
pp. 908-920
Fei Dai, IEEE
Jie Wu, IEEE

Abstract—Efficient routing among a set of mobile hosts 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 search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in the system are either in the set or neighbors of hosts in the set. The efficiency of dominating-set-based routing mainly depends on the overhead introduced in the formation of the dominating set and the size of the dominating set. In this paper, we first review a localized formation of a connected dominating set called marking process and dominating-set-based routing. Then, we propose a dominant pruning rule to reduce the size of the dominating set. This dominant pruning rule (called Rule k) is a generalization of two existing rules (called Rule 1 and Rule 2, respectively). We prove that the vertex set derived by applying Rule k is still a connected dominating set. Rule k is more effective in reducing the dominating set derived from the marking process than the combination of Rules 1 and 2 and, surprisingly, in a restricted implementation with local neighborhood information, Rule k has the same communication complexity and less computation complexity. Simulation results confirm that Rule k outperforms Rules 1 and 2, especially in networks with relatively high vertex degree and high percentage of unidirectional links. We also prove that an upper bound exists on the average size of the dominating set derived from Rule k in its restricted implementation.

[1] C. Adjih, P. Jacquet, and L. Viennot, Computing Connected Dominated Sets with Multipoint Relays Technical Report 4597, INRIA-Rapport de recherche, Oct. 2002.
[2] K.M. Alzoubi, P.-J. Wan, and O. Frieder, Distributed Heuristics for Connected Dominating Sets in Wireless Ad Hoc Networks J. Comm. and Networks, vol. 4, no. 1, pp. 22-29, Mar. 2002.
[3] A.D. Amis, R. Prakash, T.H.P. Vuong, and D.T. Huynh, “Max-MinD-Cluster Formation in Wireless Ad Hoc Networks,” Proc. INFORCOM, pp. 32-41, 2001.
[4] S. Basagni, Distributed Clustering for Ad Hoc Networks Proc. Int'l Symp. Parallel Algorithms, Architectures and Networks ISPAN, pp. 310-315, June 1999.
[5] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks ACM Wireless Networks J., vol. 8, no. 5, pp. 481-494, Sept. 2002.
[6] B.N. Clark, C.J. Colbourn, and D.S. Johnson, Unit Disk Graphs Discrete Math., vol. 86, pp. 165-177, 1990.
[7] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. McGraw Hill, 2001.
[8] F. Dai Dominating Set Simulation Program,http://www.cse., 2001.
[9] B. Das, R. Sivakumar, and V. Bhargavan, Routing in Ad Hoc Networks Using a Spine Proc. Sixth IEEE Int'l Conf. Computers Comm. and Networks (IC3N '97), pp. 1-20, Sept. 1997.
[10] A. Ephremides, J.E. Wjeselthier, and D.J. Baker, A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling Proc. IEEE, vol. 71, no. 1, pp. 56-73, 1987.
[11] H.N. Gabow, Path-Based Depth-First Search for Strong and Biconnected Components Information Processing Letters, vol. 74, pp. 107-114, 2000.
[12] M. Gerla and J. Tsai, Multicluster, Mobile, Multimedia Radio Network ACM/Baltzer J. Wireless Networks, vol. 1, no. 3, pp. 255-265, 1995.
[13] S. Guha and S. Khuller, Approximation Algorithms for Connected Dominating Sets Algorithmica, vol. 20, no. 4, pp. 374-387, Apr. 1998.
[14] T.J. Kwon and M. Gerla, Efficient Flooding with Passive Clustering (PC) in Ad Hoc Networks ACM SIGCOMM Computer Comm. Rev., vol. 32, no. 1, pp. 44-56, Jan. 2002.
[15] C.R. Lin and M. Gerla, “Adaptive Clustering in Mobile Wireless Networks,” IEEE J. Selected Areas in Communications, vol. 16, pp. 1,265–1,275, 1997.
[16] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying for Flooding Broadcast Message in Mobile Wireless Networks,” Proc. Hawaii Int'l Conf. System Sciences '35, Jan. 2002.
[17] R. Sedgewick, Algorithms in C. Addison-Wesley, third ed., 2002.
[18] M. Shaked and J.G. Shantikumar, Stochastic Orders and Their Applications. Academic Press, 1994.
[19] P. Sinha, R. Sivakumar, and B. Vaduvur, “Enhancing Ad Hoc Routing with Dynamic Virtual Infrastructures,” IEEE Joint Conf. Computer and Comm. Societies (INFOCOM), 2001.
[20] R. Sivakumar, B. Das, and V. Bharghavan, “An Improved Spine-Based Infrastructure for Routing in Ad Hoc Networks,” Proc. Int'l Symp. Computers and Comm. (ISCC '98), 1998.
[21] A. Tanenbaum, Computer Networks. Prentice Hall, Inc., 1996.
[22] Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, The Broadcast Storm Problem in a Mobile Ad Hoc Network Wireless Networks, vol. 8, nos. 2/3, pp. 153-167, Mar.-May 2002.
[23] P.-J. Wan, K. Alzoubi, and O. Frieder, Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks Proc. IEEE INFOCOM, vol. 3, pp. 1597-1604, June 2002.
[24] J. Wu, Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 3, pp. 189-200, Sept. 2002.
[25] J. Wu and H. Li, On Calculating Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 7-14, 1999.
[26] J. Wu and W. Lou, Forward-Node-Set-Based Broadcast in Clustered Mobile Ad Hoc Networks Wireless Comm. and Mobile Computing, 2003.

Index Terms:
Ad hoc wireless networks, dominant pruning, dominating sets, routing, probabilistic analysis, simulation.
Fei Dai, Jie Wu, "An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 10, pp. 908-920, Oct. 2004, doi:10.1109/TPDS.2004.48
Usage of this product signifies your acceptance of the Terms of Use.