CDS-HG: A new distributed MCDS approximation algorithm for wireless sensor networks

2007 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2007

Volumn , Issue , 2007, Pages 2663-2666

  Xie, Rong ^a   Qi, Deyu ^a   Li, Yongjun ^a   Wang, James Z ^b  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b AMRL   (United States)

Author keywords

Connected dominating set; Hierarchical graph, greedy algorithm

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTER SIMULATION; DATA ACQUISITION; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS;

ALGORITHM MODELS; CONNECTED DOMINATING SET (CDS); HIERARCHICAL GRAPHS;

WIRELESS SENSOR NETWORKS;

EID: 38049086119     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WICOM.2007.662     Document Type: Conference Paper

References (14)

1. J. Lee and B. Mans, Energy-Efficient Virtual Backbones for Reception-Aware MANET, Vehicular Technology Conference. VTC, Vol. 3, pp. 1097-1101, 2006.
2. S. Guha and S. Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374-387, Apr. 1998.
3. B. Das, R. Sivakumar, and V. Bhargavan. Routing in ad hoc networks using a spine. Proc. of 6th IEEE Int'l Conf. on Computers Communications and Networks (IC3N '97), pages 1-20, Sep. 1997.
4. S. Butenko, X. Cheng, C. Oliveira, and P.M. Pardalos, A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks, In Recent Developments in Cooperative Control and Optimization, pp. 61-73, Kluwer Academic Publishers, 2004.
5. K. M. Alzoubi, P.-J.Wan, and O. Frieder: Maximal Independent Set, Weakly Connected Dominating Set, and Induced Spanners for Mobile Ad Hoc Networks, International Journal of Foundations of Computer Science, Vol. 14, No. 2, pp. 287-303, 2003.
6. Y. Li, S. Zhu, My T. Thai, and D.Z. Du, Localized Construction of Connected Dominating Set in Wireless Networks, NSF International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks (TAWN04), Chicago, June 2004.
7. Bo Gao, Yuhang Yang, and Huiye Ma. A new Distributed Approximation Algorithm for Constructing Minimum Connected Dominating Set in Wireless Ad Hoc Networks, International Journal of Communication Systems Vol.18, Issue 8 pp734-762, October 2005.
8. Wu J, Li H. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7-14, Seattle, USA, August 1999.
9. F.Dai and J.Wu. An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks. IEEE Transactions on Parallel and Distributed Systems, 15(10): 908-920, 2004.
10. I. Stojmenovic, M. Seddigh, and J. Zunic. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. In Proc. IEEE Hawaii Int. Conf. on System Sciences, 2001.
11. Ehrig, H. Introduction to the algebraic theory of graph grammars. In Claus, V., Ehrig, H. and Rozenberg, G. (editors), Graph-Grammars and Their Application to Computer Science and Biology, Lecture Notes in Computer Science 73,1-69. Springer-Verlag.
12. I. Cidon and O. Mokryn, Propagation and leader election in multihop broadcast environment, in Proc. 12th Int. Symp. Distr. Computing, Greece, Sept. 1998, pp.104-119.
13. D.S. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences 9(1974), pp. 256-278.
14. LBL, Xerox PARC, UCB, and USC/ISI, The Network Simulator-ns2, http://www.isi.edu/nsnam/ns/