Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks
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.
Unable to display preview. Download preview PDF.
- 2.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)Google Scholar
- 4.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)Google Scholar
- 6.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)Google Scholar
- 8.Vuong, T., Huynh, D.: Connected D-Hops Dominating Sets in Wireless Ad Hoc Networks. SCI 20002/ISAS 2002, Vol IVGoogle Scholar
- 10.Garey, M.S., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics 32, 826–834Google Scholar