Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks

Authors:
Trac N. Nguyen;Dung T. Huynh;Jason A. Bolla
Affiliations:
Department of Computer Science, University of Texas at Dallas, Richardson 75083-0688;Department of Computer Science, University of Texas at Dallas, Richardson 75083-0688;Department of Computer Science, University of Texas at Dallas, Richardson 75083-0688
Venue:
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Year:
2008

Citing 5
Cited 1

Constructing Battery-Aware Virtual Backbones in Sensor Networks

ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets

ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges

IEEE Transactions on Mobile Computing
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges

IEEE Transactions on Mobile Computing
Relay node placement in large scale wireless sensor networks

Computer Communications

A constant-factor approximation for d-hop connected dominating sets in unit disk graph

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

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.