Abstract
Connected Dominating Set (CDS) has been a well known approach for constructing a virtual backbone to alleviate the broadcasting storm in wireless networks. Previous literature modeled the wireless network in a 2-dimensional plane and looked for the approximated Minimum CDS (MCDS) distributed or centralized to construct the virtual backbone of the wireless network. However, in some real situations, the wireless network should be modeled as a 3-dimensional space instead of 2-dimensional plane. We propose our approximation algorithm for MCDS construction in 3-dimensional wireless network in this paper. It achieves better upper bound (13 + ln 10)opt + 1 than the only known result 22opt. This algorithm helps bringing the research for MCDS construction in 3-dimensional wireless network to a new stage.
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
Butenko, S., Ursulenko, O.: On minimum connected donimating set problem in unit-ball graphs. Elsevier Science, Amsterdam (2007) (preprint submitted)
Cardei, M., Cheng, M.X., Cheng, X., Du, D.-Z.: Connected domination in multihop ad hoc wireless networks. In: International Conference on Computer Science and Informatics (2002)
Das, B., Bharghavan, V.: Routing in ad hoc Networks Using Minimum Connected Domianting Sets. In: International Conference on Communications (1997)
Ephremides, A., Wieselthier, J., Baker, D.: A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. IEEE 75(1), 56–73 (1987)
Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)
Garey, M.R., Johnson, D.S.: Computers and Intractability. A guide to the Theory of NP-completeness. Freeman, New York (1979)
Li, Y., Kim, D., Zou, F., Du, D.-Z.: Constructing Connected Dominating Sets with Bounded Diameters in Wireless Networks. In: WASA (2007)
Ni, S., Tseng, Y., Chen, Y., Sheu, J.: The Broadcast Storm Problem in a Mobile Ad Hoc Network. In: MOBICOM 1999, Washington, USA, August 1999, pp. 152–162 (1999)
Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., Ko, K.-I.: A Greedy Approximation for Minimum Connected Dominating Sets. Theoretical Computer Science 329(1-3), 325–330 (2004)
Sivakumar, R., Das, B., Bharghavan, V.: An Improved Spine-based Infrastructure for Routing in Ad Hoc Networks. In: IEEE Symposium on Computers and Communications, Athens, Greece (June 1998)
Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Sets in Wireless Ad Hoc Networks. In: Proc. IEEE Infocom 2002, New York, NY, USA (June 2002)
Wu, J., Li, H.: On Calculating Connected Dominating Set for Ecient Routing in Ad Hoc Wireless Networks. In: Proc. the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Seattle, USA, August 1999, pp. 7–14 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zou, F., Li, X., Kim, D., Wu, W. (2008). Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network. In: Li, Y., Huynh, D.T., Das, S.K., Du, DZ. (eds) Wireless Algorithms, Systems, and Applications. WASA 2008. Lecture Notes in Computer Science, vol 5258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88582-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-88582-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88581-8
Online ISBN: 978-3-540-88582-5
eBook Packages: Computer ScienceComputer Science (R0)