The complexity of domination problems in circle graphs
Discrete Applied Mathematics
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
A transmission control scheme for media access in sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 8th annual international conference on Mobile computing and networking
The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Impact of Network Density on Data Aggregation in Wireless Sensor Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Cluster based dynamic routing on powerline carrier network
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
MEACA: mobility and energy aware clustering algorithm for constructing stable MANETs
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Constructing sensor barriers with minimum cost in wireless sensor networks
Journal of Parallel and Distributed Computing
Fast track article: Reliable networks with unreliable sensors
Pervasive and Mobile Computing
Hi-index | 0.00 |
We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the sensor network is surveillance and monitoring, where upon observation of certain event of interest, a sensor node generates a message and forwards it to a gateway located somewhere in or near the network. This forwarding relies on routes constructed using sensors whose radios are on/active. In order for such messages to reach the gateway with minimal delay, any sensor in the network should ideally have a route to the gateway consisting of active sensors at all times. Prior approaches to similar problems include clustering, virtual backbone, and connected dominating sets. Low energy consumption and good connectivity are potentially conflicting objectives. Our principal goal is to find an approach that results in the lowest possible duty cycle, and that provides better trade-off between the two objectives. In this paper we introduce the concept of partial clustering, which may be viewed as a generalized method of clustering. We compare the theoretical performance of different instances of partial clustering to that of standard clustering, and show that partial clustering can achieve lower duty cycle and provide greater flexibility in the trade-off between energy efficiency and connectivity. We then present a distributed algorithm based on the partial clustering method. Simulation results are provided to evaluate their effectiveness and energy efficiency.