Yiwei Wu
Yingshu Li
ABSTRACT
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a k-Connected m-Dominating Set (kmCDS) is necessary for fault tolerance and routing flexibility. Some approximation algorithms have been proposed to construct a kmCDS. However, most of them only consider some special cases where k = 1,2 or k ≤ m, or are not easy to implement, or have high message complexity. In this paper, we propose a novel distributed algorithm LDA with low message complexity to construct a kmCDS for general k and m whose size is guaranteed to be within a small constant factor of the optimal solution when the maximum node degree is a constant. We also propose one centralized algorithm ICGA with a constant performance ratio to construct a kmCDS. Theoretical analysis as well as simulation results are shown to evaluate the proposed algorithms.
- 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. Google Scholar
Digital Library
- B. Das and V. Bharghavan, Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets, Proc. IEEE Intl. Conf. Comm., 1997.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- P.-J. Wan, K. M. Alzoubi and O. Frieder, Distributed Construction of Connected Dominating Sets in Wireless Ad Hoc Networks, IEEE INFOCOM, 2002.Google Scholar
- 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, Chicago, June 2004.Google Scholar
- 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. Google ScholarDigital Library
- F. Dai and J. Wu, On Constructing k-Connected k-Dominating Set in Wireless Network, IEEE International Parallel & Distributed Processing Symposium, 2005 . Google ScholarDigital Library
- F. Wang, M. T. Thai, D.-Z. Du, 2-connected Virtual Backbone in Wireless Network, Accpeted by IEEE Transactions on Wireless Communications, 2007. Google ScholarDigital Library
- W. Shang, F. Yao, P. Wan, and X. Hu, Algorithms for Minimum m-Connected k-Dominating Set Problem, COCOA 2007, LNCS 4616, pp. 182--190, 2007. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google Scholar
- T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, ISBN 0-262-03293-7, MIT Press, 2001. Google ScholarDigital Library
- D. B. West, Introduction to Graph Theory (Second Edition), Prentice-Hall, Inc. ISBN 0-13-014400-2, 2001.Google Scholar
- J. Cheriyan and R.Thurimella, Fast algorithms for k-shredders and k-node connectivity augmentation, Journal of Algorithms 33:15--50, 1999. Google ScholarDigital Library
Index Terms
- Construction algorithms for k-connected m-dominating sets in wireless sensor networks
Recommendations
Energy efficient distributed connected dominating sets construction in wireless sensor networks
IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computingOne important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to reduce the network communication overhead. In the paper, a novel energy ...
Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks
Efficient network coverage and connectivity are the requisites for most Wireless Sensor Network (WSN) deployments, particularly those concerned with area monitoring. Due to the resource constraints of the sensor nodes, redundancy of coverage area must ...
A distributed algorithm for constructing energy-balanced connected dominating set in wireless sensor networks
One important characteristic of wireless sensor networks is stringent energy of sensor nodes. Constructing a Connected Dominating Set (CDS) as the backbone has been widely used as a topology control strategy to reduce the network communication overhead ...
Comments