Abstract
Connected dominating set (CDS) is widely used in wireless networks as a virtual backbone for communication and routing between nodes. In order to measure the quality of a CDS, most researches in this area focus on reducing the size of a CDS, neglecting other important metrics, such as diameter between two communication parties. This paper considers the diameter as a quality factor for CDS construction, and develops two new heuristic algorithms. In particular, the CDS computed by the first algorithm has constant ratios 9 and 3 for its size and diameter, respectively. And that of the second algorithm has constant ratios 5 + ln 10 and 2. Both theoretical analysis and simulation show out the performance of the algorithms.
The work is supported by NNSF (60373012, 10871119) of China, NSF (ZR2009GM009, ZR2009AM013), Promotional Foundation (BS2009DX024) for Middle-aged or Young Scientists, EDRP (J07WH05) of Shandong Province, DRF and UF (XJ0609) of QFNU.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alzoubi, K.M., Wan, P.J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (June 2002)
Cardei, M., Cheng, M.X., Cheng, X., Du, D.-Z.: Connected domination in ad hoc wireless networks. In: International Conference on Computer Science and Informatics (2002)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics 86, 165–177 (1990)
Cheng, X., Ding, M., Du, H., Jia, X.: Virtual backbone construction in multi hop ad hoc wireless networks. Wireless Communications and Mobile Computing 6(2), 183–190 (2006)
Das, B., Bharghavan, V.: Routing in ad hoc networks using minimum connected dominating sets. In: ICC 1997, Montreal, Canada (June 1997)
Ephremides, A., Wieselthier, I., Baker, D.: A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. IEEE 75(1), 56–70 (1987)
Garey, M.L., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374–387 (1998)
Islam, K., Akl, S.G., Meijer, H.: A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks. In: 2008 14th IEEE International Conference on Parallel and Distributed Systems, pp. 559–566 (2008)
Kim, D., Li, Y., Zou, F., Du, D.-Z.: Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks. IEEE Transactions on Parallel and Distributed System 20(2), 147–157 (2009)
Marathe, M.V., et al.: Simple heuristics for unit disk graphs. Networks 25, 59–68 (1995)
Mohammed, K., Gewali, L., Muthukumar, V.: Generating quality dominating sets for sensor networks. In: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications, pp. 204–211 (August 2005)
Schmid, S., Wattenhofer, R.: Algorithmic models for sensor networks. In: Proc. of the 14th International Workshop on Parallel and Distributed Real-Time Systems (2006)
Vahdatpour, A., Dabiri, F., Moazeni, M., Sarrafzadeh, M.: Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks. In: Proceedings of the 22nd International Symposium on Distributed Computing, pp. 481–495 (2008)
Zou, F., Li, X., Kim, D., Wu, W.: Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network. In: Li, Y., Huynh, D.T., Das, S.K., Du, D.-Z. (eds.) WASA 2008. LNCS, vol. 5258, pp. 134–140. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, J., Wang, N., Wang, G. (2010). Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2010. Lecture Notes in Computer Science, vol 6221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14654-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-14654-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14653-4
Online ISBN: 978-3-642-14654-1
eBook Packages: Computer ScienceComputer Science (R0)