Constructing k-connected M-dominating sets in wireless sensor networks

Proceedings - IEEE Military Communications Conference MILCOM

Volumn , Issue , 2007, Pages

  Wu, Yiwei ^a   Wang, Feng ^b   Thai, My T ^c   Li, Yingshu ^a  

^a GEORGIA STATE UNIVERSITY   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED ALGORITHMS; DOMINATING SETS; K CONNECTED; MINIMUM SIZE; ROUTING FLEXIBILITY; SIMULATION RESULTS; VIRTUAL BACKBONE (VB); WIRELESS SENSORS;

ALGORITHMS; DETECTORS; FAULT TOLERANCE; HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; HYBRID SENSORS; MILITARY COMMUNICATIONS; MILITARY OPERATIONS; PARALLEL ALGORITHMS; QUALITY ASSURANCE; RELIABILITY; ROUTING ALGORITHMS; ROUTING PROTOCOLS; SENSOR NETWORKS; SENSORS; SET THEORY; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 47949083311     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MILCOM.2007.4454774     Document Type: Conference Paper

References (15)

1. B. Das and V. Bharghavan, Routing in Ad Hoc Networks Using Minimum Connected Dominating Set, International Conference on Communications, 1997
2. C. Bettstetter, On the Minimum Node Degree and Connectivity of a Wireless Multihop Network, MOBIHOC'02, 2002.
3. D. B. West, Introduction to Graph Theory (Second Edition), Prentice-Hall, Inc. ISBN 0-13-014400-2, 2001
4. F. Dai and J. Wu, On Constructing k-Connected k-Dominating Set in Wireless Network, IEEE International Parallel & Distributed Processing Symposium, 2005.
5. F. Wang, M. T. Thai, D.-Z. Du, 2-connected Virtual Backbone in Wireless Network, IEEE Transactions on Wireless Communications, accepted with revisions, 2007.
6. J. Wu and H. Li, On Calculating Connected Dominating Set for Effecient Routing in Ad Hoc Wireless Networks, Proc. of the Third International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, PP.7-14, August 1999.
7. K. M. Alzoubi, P.-J. Wan and O. Frieder, Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks, MO-BIHOC, Switzerland, 2002.
8. M. T. Thai, N. Zhang, R. Tiwari and X. Xu, On approximation algorithms of k-connected m-dominating sets in disk graphs Theoretical Computer Science, to appear, 2007.
9. P. Wan, K.M. Alzoubi and O. Frieder, Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks, in Preceeding of 21th Annual Joint Conference of the IEEE Computer and Communication Societies (InfoCom), 2002
10. R. Klasing and C. Laforest, Hardness Results and Approximation Algorithms of k-tuple Domination in Graphs, Information Processing Letters, 89(2), PP.75-83, 2004.
11. S. Even and R. E. Tarjan, Network Flow and Testing Graph Connectivity, SIAM, J. Computing, Col. 4, PP.507-518, 1975.
12. S. Guha and S. Khuller, Approximation Algorithms for Connected Dominating sets, Algorithmica, vol.20, PP.374-387, 1998
13. X. Cheng, M. Ding, D. Du and X. Jia, Virtual Backbone Construction in Multihop Ad Hoc Wireless Networks, Wirel. Commun. Mob. COmput. PP. 183-190, 2006
14. Y. Li, M.T. Thai, F. Wang, C.-W. Yi, P-J. Wang and D.-Z. Du, On Greedy Construction of Connected Dominating Sets in Wireless Nwtworks, Special issue of Wireless Communications and Mobile Computing (WCMC), vol. 5, no. 88, PP.927-932, 2005.
15. Y. Li, S. Zhu, My T. Thai, and D-Zhu 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.