Abstract
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor networks. With the help of CDS, routing is easier and can adapt quickly to network topology changes. The CDS problem has been studied extensively in undirected graphs, especially in unit disk graphs, in which each sensor node has the same transmission range. However, in practice, the transmission ranges of all nodes are not necessarily to be equal. In this paper, we model a network as a disk graph where unidirectional links are considered and introduce the Strongly Connected Dominating Set (SCDS) problem in disk graphs. We propose two constant approximation algorithms for the SCDS problem and compare their performances through the theoretical analysis.
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
Thai, M.T., Wang, F., Liu, D., Zhu, S., Du, D.-Z.: Connected Dominating Sets in Wireless Networks with Different Transmission Ranges (2005) (manuscript)
Li, Y., Zhu, S., Thai, M.T., Du, D.-Z.: Localized Construction of Connected Dominating Set in Wireless Networks. In: NSF International Workshop on Thoretical Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks (2004)
Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed Construction on Connected Dominating Set in Wireless Ad Hoc Networks. In: Proceedings of the Conference of the IEEE Communications Society (INFOCOM) (2002)
Li, Y., Thai, M.T., Wang, F., Yi, C.-W., Wang, P.-J., Du, D.-Z.: On Greedy Construction of Connected Dominating Sets in Wireless Networks. In: Special issue of Wireless Communications and Mobile Computing (WCMC) (2005)
Cardei, M., Cheng, M.X., Cheng, X., Du, D.-Z.: Connected Domination in Ad Hoc Wireless Networks. In: Proceedings of the Sixth International Conference on Computer Science and Informatics (CSI) (2002)
Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. Algorithmica 20, 374–387 (1998)
Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., Ko, L.-I.: A Greedy Approximation for Minimum Connected Dominating Sets. Theoretical Computer Science (2005) (to appear)
Wu, J., Li, H.: On Calculating Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks. In: Proceedings of the Third International Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (1999)
Alzoubi, K.M., Wang, P.-J., Frieder, O.: Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In: Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC) (2002)
Dai, F., Wu, J.: An Extended Localized Algorithms for Connected Dominating Set Formation in Ad Hoc Wireless Networks. IEEE Transactions on Parallel and Distributed Systems 15(10) (October 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Du, DZ., Thai, M.T., Li, Y., Liu, D., Zhu, S. (2006). Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds) Frontiers of WWW Research and Development - APWeb 2006. APWeb 2006. Lecture Notes in Computer Science, vol 3841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610113_2
Download citation
DOI: https://doi.org/10.1007/11610113_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31142-3
Online ISBN: 978-3-540-32437-9
eBook Packages: Computer ScienceComputer Science (R0)