Abstract
Clustering structures are used in wireless ad hoc and sensor networks to provide for efficient communications and control. In addition to communications requirements, another important area of concern is power consumption. With that in mind, we would like to find a good network structure that uses a minimum power. In graph theoretic terminology, this paper considers the problem of clustering to be the problem of assigning powers to a set of nodes in the plane, such that we minimize total power and yield a graph that has a dominating set of a desired size. We first show that this problem is NP-complete for planar geometric graphs. We then propose heuristic solutions to the problem, present simulation data for the heuristics, and discuss the results.
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
Cardei, M., MacCallum, D., Cheng, M.X., Min, M., Jia, X., Li, D., Du, D.-Z.: Wireless Sensor Networks with Energy Efficient Organization. Journal of Interconnection Networks 3, 213–229 (2002)
Ma, C., Yang, Y., Zhang, Z.: Constructing Battery-Aware Virtual Backbones in Sensor Networks. In: Proceedings of the 2005 International Conference on Parallel Processing, June 2005, pp. 203–210 (2005)
Thai, M.T., Du, D.-Z.: Connected Dominating Sets in Disk Graph with Bidirectional Links. IEEE Communication Letters 10(3), 138–140 (2006)
Thai, M.T., Wang, F., Liu, D., Zhu, S., Du, D.-Z.: Connected Dominating Sets in Wireless Networks with Different Transmission Ranges. IEEE Transactions on Mobile Computing 6(7) (July 2007)
Tang, J., Hao, B., Sen, A.: Relay Node Placement in Large Scale Wireless Sensor Networks. Computer Communications 29, 490–501 (2006)
Carle, J., Gallais, A., Simplot-Ryl, D.: Preserving area coverage in wireless sensor networks by using surface coverage relay dominating sets. In: Proceedings. 10th IEEE Symposium on Computers and Communications Issue 27-30, June 2005, pp. 347–352 (2005)
Wu, J., Dai, F.: Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges. IEEE Trans. on Mobile Computing 5(9), 1188–1200 (2006)
Vuong, T., Huynh, D.: Connected D-Hops Dominating Sets in Wireless Ad Hoc Networks. SCI 20002/ISAS 2002, Vol IV
Valiant, L.: Universality Considerations in VLSI Circuits. IEEE Transactions on Computers C-30, 135–140 (1981)
Garey, M.S., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics 32, 826–834
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
Nguyen, T.N., Huynh, D.T., Bolla, J.A. (2008). Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks. 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_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-88582-5_19
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)