Construction algorithms for k-connected m-dominating sets in wireless sensor networks

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2008, Pages 83-90

  Wu, Yiwei ^a   Li, Yingshu ^a  

^a GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Connected dominating Set; Fault tolerance; K connected m dominating set; Localized algorithms; Wireless sensor networks

Indexed keywords

CENTRALIZED ALGORITHMS; CONNECTED DOMINATING SET; CONNECTED DOMINATING SETS; CONSTANT FACTORS; CONSTRUCTION ALGORITHMS; DISTRIBUTED ALGORITHMS; DOMINATING SETS; K-CONNECTED M-DOMINATING SET; LOCALIZED ALGORITHMS; MESSAGE COMPLEXITIES; NODE DEGREES; OPTIMAL SOLUTIONS; PERFORMANCE RATIOS; ROUTING FLEXIBILITIES; SIMULATION RESULTS; THEORETICAL ANALYSES; VIRTUAL BACKBONES;

AD HOC NETWORKS; COMPUTER NETWORKS; ELECTRIC NETWORK ANALYSIS; FAULT TOLERANCE; HYBRID SENSORS; PARALLEL ALGORITHMS; QUALITY ASSURANCE; RELIABILITY; ROUTING ALGORITHMS; ROUTING PROTOCOLS; SENSOR NETWORKS; SENSORS; TELECOMMUNICATION NETWORKS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 57349157704     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374618.1374631     Document Type: Conference Paper

References (17)

1. J. Wu and H. Li, On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks, Proc. Third Intl. Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., 1999.
2. B. Das and V. Bharghavan, Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets, Proc. IEEE Intl. Conf. Comm., 1997.
3. K. M. Alzoubi, P.-J. Wan, and O. Frieder, New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks, Proc. IEEE Hawaii Intl. Conf. System Sciences, 2002.
4. 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, 15(10):908-920, Oct. 2004.
5. B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks, Wireless Network, 8(5):481-494, 2002.
6. P.-J. Wan, K. M. Alzoubi and O. Frieder, Distributed Construction of Connected Dominating Sets in Wireless Ad Hoc Networks, IEEE INFOCOM, 2002.
7. Y. Li, S. Zhu, My T. Thai, and D.-Z. Du, Localized Construction of Connected Dominating Set in Wireless Networks, NS International Workshop on Theoretical Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks, Chicago, June 2004.
8. X. Cheng, M. Ding, D. Du and X. Jia, Virtual Backbone Construction in Multihop Ad Hoc Wireless Networks, Wireless Communnications and Mobile Computing, 6(2):183-190, 2006.
9. F. Dai and J. Wu, On Constructing k-Connected k-Dominating Set in Wireless Network, IEEE International Parallel & Distributed Processing Symposium, 2005 .
10. F. Wang, M. T. Thai, D.-Z, Du, 2-connected Virtual Backbone in Wireless Network, Accpeted by IEEE Transactions on Wireless Communications, 2007.
11. W. Shang, F. Yao, P. Wan, and X. Hu, Algorithms for Minimum m-Connected k-Dominating Set Problem, COCOA 2007, LNCS 4616, pp.l82:190, 2007.
12. M. T. Thai, N. Zhang, R. Tiwari and X. Xu, On approximation algorithms of k-connected m-dominating sets in disk graphs, Accepted by Theoretical Computer Science, 2007.
13. Y. Wu, F. Wang, M. T. Thai and Y. Li, Constructing k-Connected m-Dominating Sets in Wireless Sensor Networks, Military Communications Conference, Orlando, FL, October 29-31, 2007.
14. D. Kim, Y. Wu, Y. Li, F. Zou and D.-Zhu Du Constructing Energy Efficient Connected Dominating Sets with Bounded Diameters in Wireless Networks, submitted to IEEE Transactions on Parallel and Distributed Systems, 2007.
15. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, ISBN 0-262-03293-7, MIT Press, 2001.
16. D. B. West, Introduction to Graph Theory (Second Edition), Prentice-Hall, Inc. ISBN 0-13-014400-2, 2001.
17. J. Cheriyan and R.Thurimella, Fast algorithms for k-shredders and k-node connectivity augmentation, Journal of Algorithms 33:15-50, 1999.