Abstract
In this work, we present the design of two novel algorithms for constructing connected dominating set (CDS) in wireless sensor networks (WSNs). Both algorithms are intended to minimize CDS size. The first algorithm has a performance factor of 5 from the optimal solution, which outperforms the best-published results (5.8+ ln 4) in [1]. The second algorithm is an improved version of the first one. We included the theoretical analysis and simulation results showing the effectiveness of both algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Li, Y., Thai, M.T., Wang, F., Yi, C.-W., Wan, P.-J., Du, D.-Z.: On greedy construction of connected dominating sets in wireless networks. Wireless Communications & Mobile Computing - RRM for Next-Generation Wireless and Mobile Communication Systems 5(8) (December 2005)
Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected Dominating Set in Sensor Networks and MANETs. In: Handbook of Combinatorial Optimization, vol. 5, pp. 329–369. Kluwer Academic Publishers (2005)
West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)
Liang, O.: Multipoint Relay and Connected Dominating Set Based Broadcast Algorithms for Wireless Ad Hoc Networks. Monash University, Melbourne (2007)
Rai, M., Verma, S., Tapaswi, H.: A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks. Journal of Networks 4(6), 511–519 (2009)
Rai, M., Verma, S., Tapaswi, S.: A Heuristic for Minimum Connected Dominating Set with Local Repair for Wireless Sensor Networks. In: Eighth International Conference on Networks, ICN 2009, pp. 106–111 (2009)
Wan, P., Alzoubi, K., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications 9, 141–149 (2004)
Bondorf, S., Jens, B.: Statistical Response Time Bounds in Randomly Deployed Wireless Sensor Networks. In: LCN 2010 Proceedings of the 2010 IEEE 35th Conference on Local Computer Networks, Washington, DC, USA., pp. 340–343 (2010)
Poe, W., Schmitt, B.: Node deployment in large wireless sensor networks: coverage, energy consumption, and worst-case delay. In: AINTEC 2009 Asian Internet Engineering Conference, New York, USA, pp. 77–84 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Al-Nabhan, N., Zhang, B., Al-Rodhaan, M., Al-Dhelaan, A. (2012). Two Connected Dominating Set Algorithms for Wireless Sensor Networks. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_62
Download citation
DOI: https://doi.org/10.1007/978-3-642-31869-6_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31868-9
Online ISBN: 978-3-642-31869-6
eBook Packages: Computer ScienceComputer Science (R0)