A convex-hull based algorithm to connect the maximal independent set in unit-disk graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4138 LNCS, Issue , 2006, Pages 363-370

  Chen, Dechang ^a   Mao, Xilong ^b   Fei, Xia ^c   Xing, Kai ^d   Liu, Fang ^d   Song, Min ^e  

^a UNIFORMED SERVICES UNIVERSITY OF THE HEALTH SCIENCES   (United States)

^b NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^c Institute of Urban and Rural Construction   (China)

^d George Washington University   (United States)

^e Old Dominion University   (United States)

Author keywords

Ad hoc and sensor networks; Connected dominating set; Maximal independent set

Indexed keywords

ALGORITHMS; SENSORS; TELECOMMUNICATION NETWORKS; VIRTUAL REALITY;

AD HOC SENSOR NETWORKS; CONNECTED DOMINATING SETS; MAXIMAL INDEPENDENT SETS;

GRAPH THEORY;

EID: 33749668882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814856_35     Document Type: Conference Paper

References (16)

1. K.M. Alzoubi, P.-J. Wan and O. Frieder, Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks, MOBIHOC, EPFL Lausanne, Switzerland, 2002.
2. K. M. Alzoubi, P.-J. Wan, and O. Frieder, New Distributed Algorithm for Connected Dominating Set in Wireleess Ad Hoc Networks. Proceedings of the 35th Hawaii International Conference on System Sciences, Big Island, Hawaii, 2002.
3. K.M. Alzoubi, P.-J. Wan and O. Frieder, Distributed Heuristics for Connected Dominating Sets in Wireless Ad Hoc Networks, Journal of Communications and Networks, Vol. 4, No. 1, Mar. 2002.
4. J. Blum, M. Ding, A. Thaeler, and X. Cheng, Connected Dominating Sets in Sensor Networks and MANETs, in Handbook of Combinatorial Optimization (Eds. D.-Z. Du and P. Pardalos), pp.329-369, 2004.
5. X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z.Du, Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks, Networks, Vol. 42, No. 4, pp. 202-208, 2003.
6. X. Cheng, M. Ding, D.H. Du, and X. Jia, On The Construction of Connected Dominating Set in Ad Hoc Wireless Networks, Wireless Communications and Mobile Computing, Vol. 6, pp. 183-190, 2006.
7. X. Cheng, Routing Issues in Ad Hoc Wireless Networks, PhD Thesis, Department of Computer Science, University of Minnesota, 2002.
8. I. Cidon and O. Mokryn, Propagation and Leader Election in Multihop Broadcast Environment, Proc. 12th Int. Symp. Distr. Computing, pp. 104-119, Greece, Spt. 1998.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd Edition, Me Graw Hill, 2001.
10. M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, Freeman, San Frncisco, 1978.
11. S. Guha and S. Khuller, Approximation algorithms for connected dom- inating sets, Algorithmica, 20(4), pp. 374-387, Apr. 1998.
12. M. Min, H. Du, X. Jia, C. X. Huang, S. C.-H. Huang, and W. Wu, Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks, Journal of Global Optimization, Vol. 35, No. 1, pp. 111-119, May 2006.
13. R. Sivakumar, P. Sinha and V. Bharghavan, CEDAR: a core-extraction distributed ad hoc routing algorithm, IEEE Journal on Selected Areas in Communications, Vol. 17(8), Aug. 1999, pp. 1454-1465.
14. P.-J. Wan, K.M. Alzoubi, and O. Frieder, Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks, IEEE INFOCOM, pp. 1597-1604, 2002.
15. J. Wu, F. Dai, M. Gao, and I. Stojmenovic, On Calculating Power- Aware Connected Dominating Set for Ecient Routing in Ad Hoc Wire- less Networks, Journal of Communications and Networks, Vol. 5, No. 2, pp. 169-178, March 2002.
16. Y. Xu, J. Heidemann, and D. Estrin, Geography-informed energy con- servation for Ad Hoc routing, MobiCom 2001, pp.70-84, 2001.