This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication
August 2006 (vol. 17 no. 8)
pp. 851-864

Abstract—We propose a notion of an extended dominating set where each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors. This work is motivated by cooperative communication in ad hoc networks whereby transmitting independent copies of a packet generates diversity and combats the effects of fading. We first show the NP-completeness of the minimum extended dominating set problem. Then, several heuristic algorithms, global and local, for constructing a small extended dominating set are proposed. These are nontrivial extensions of the existing algorithms for the regular dominating set problem. The application of the extended dominating set in efficient broadcasting is also discussed. The performance analysis includes an analytical study in terms of approximation ratio and a simulation study of the average size of the extended dominating set derived from the proposed algorithms.

[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] M. Agarwal, J.H. Cho, L. Gao, and J. Wu, “Energy Efficient Broadcast in Wireless Ad Hoc Networks with Hitch-Hiking,” Proc. INFOCOM, Mar. 2004.
[3] K.M. Alzoubi, X.Y. Li, Y. Wang, P.J. Wan, and O. Frieder, “Geometric Spanners for Wireless Ad Hoc Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 5, pp. 408-421, 2003.
[4] K.M. Alzoubi, P.J. Wan, and O. Frieder, “Distributed Heuristics for Connected Dominating Set in Wireless Ad Hoc Networks,” J. Comm. and Networks, vol. 4, no. 1, pp. 22-29, 2002.
[5] K.M. Alzoubi, P.J. Wan, and O. Frieder, “Weakly-Connected Dominating Set and Sparse Spanners in Wireless Ad Hoc Networks,” Proc. Int'l Conf. Distributed Computing Systems, Mar. 2003.
[6] M. Cardei, J. Wu, and S. Yang, “Topology Control in Ad Hoc Wireless Networks with Hitch-Hiking,” Proc. First IEEE Comm. Soc. Conf. Sensor and Ad Hoc Comm. and Networks (SECON), Aug. 2004.
[7] J. Carle and D. Simplot-Ryl, “Energy-Efficient Area Monitoring for Sensor Networks,” Computer, vol. 37, no. 2, pp. 40-46, 2004.
[8] 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, 2002.
[9] Y.P. Chen and L. Liestmen, “Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks,” Proc. MobiHoc, June 2002.
[10] X. Cheng, X. Huang, D. Li, W. Wu, and D. Du, “Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks,” Networks, vol. 42, no. 4, pp. 202-208, 2003.
[11] B.N. Clark, C.J. Colbourn, and D.S. Johnson, “Unit Disk Graphs,” Discrete Math., vol. 86, pp. 165-177, 1991.
[12] F. Dai and J. Wu, “An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 10, pp. 908-920, 2004.
[13] B. Das, E. Sivakumar, and V. Bhargavan, “Routing in Ad-Hoc Networks Using a Virtual Backbone,” Proc. Int'l Conf. Computer Comm. and Networks (IC3N), Sept. 1997.
[14] 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.
[15] L.M. Feeney and M. Nilsson, “Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment,” Proc. INFOCOM, Apr. 2001.
[16] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Algorithmica, vol. 20, no. 4, pp. 374-387, 1998.
[17] T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, a series of monographs and textbooks, Marcel Dekker, Inc., 1998.
[18] Y.W. Hong and A. Scaglione, “Energy-Efficient Broadcasting with Cooperative Transmission in Wireless Sensor and Ad Hoc Networks,” IEEE Trans. Wireless Comm., Sept. 2004.
[19] N. Jindal, U. Mitra, and A. Goldsmith, “Capacity of Ad-Hoc Networks with Node Cooperation,” Proc. IEEE Int'l Symp. Information Theory (ISIT), pp. 271-272, June 2004.
[20] 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, 2002.
[21] N. Laneman, D. Tse, and G. Wornell, “Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior,” IEEE Trans. Information Theory, vol. 50, no. 12, pp. 3060-3080, 2004.
[22] N. Li, J. Hou, and L. Sha, “Design and Analysis of an MST-Based Topology Control Algorithm,” Proc. INFOCOM, Mar. 2003.
[23] C.R. Lin and M. Gerla, “Adaptive Clustering for Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 15, no. 7, pp. 1265-1275, 1996.
[24] A. Nosratinia, T.E. Hunter, and A. Hedayat, “Cooperative Communication in Wireless Networks,” IEEE Trans. Comm., vol. 42, no. 10, pp. 74-80, 2004.
[25] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying for Flooding Broadcast Message in Mobile Wireless Networks,” Proc. Hawaii Int'l Conf. System Sciences (HICSS-35), Jan. 2002.
[26] P. Sinha, R. Sivakumar, and V. Bharghavan, “CEDAR: A Core-Extraction Distributed Ad Hoc Routing Algorithm,” IEEE J. Selected Areas in Comm., special issue on ad hoc networks, vol. 17, no. 8, pp. 1454-1465, 1999.
[27] P. Sinha, R. Sivakumar, and V. Bharghavan, “Enhancing Ad Hoc Routing with Dynamic Virtual Infrastructures,” Proc. INFOCOM, Mar. 2001.
[28] I. Stojmenovic, M. Seddigh, and J. Zunic, “Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, 2002.
[29] Y. Tseng, C. Hsu, and T. Hsieh, “Power-Saving Protocols for IEEE 802.11-Based Multi-Hop Ad Hoc Networks,” Proc. INFOCOM, Mar. 2002.
[30] J. Wu, “Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 9, pp. 866-881, 2002.
[31] J. Wu and F. Dai, “A Distributed Formation of a Virtual Backbone in Manets Using Adjustable Transmission Ranges,” Proc. Int'l Conf. Distributed Computing Systems, Mar. 2004.
[32] J. Wu and H. Li, “On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks,” Proc. Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (DIALM), Aug. 1999.
[33] J. Wu and W. Lou, “Forward Node Set Based Broadcast in Clustered Mobile Ad Hoc Networks,” Wireless Comm. and Mobile Computing, vol. 3, no. 2, pp. 141-154, 2003.
[34] R. Zheng, J.C. Hou, and L. Sha, “Asynchronous Wakeup for Ad Hoc Networks,” Proc. MobiHoc, June 2003.

Index Terms:
Ad hoc network, connectivity, cooperative communication, dominating set, simulation.
Citation:
Jie Wu, Mihaela Cardei, Fei Dai, Shuhui Yang, "Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 8, pp. 851-864, Aug. 2006, doi:10.1109/TPDS.2006.103
Usage of this product signifies your acceptance of the Terms of Use.