ROAL: A Randomly Ordered Activation and Layering Protocol for Ensuring K-Coverage in Wireless Sensor Networks

Authors:
Hogil Kim;Eun Jung Kim;Ki Hwan Yum
Affiliations:
Texas A&M University, USA;Texas A&M University, USA;University of Texas at San Antonio, USA
Venue:
ICWMC '07 Proceedings of the Third International Conference on Wireless and Mobile Communications
Year:
2007

Citing 0
Cited 2

An efficient multilevel coverage scheme in mobile sensor networks

ISWPC'09 Proceedings of the 4th international conference on Wireless pervasive computing
Efficient K-coverage grouping scheduling in wireless sensor networks

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

K-coverage in wireless sensor networks (WSNs) is defined as ensuring that every point in the area is monitored by at least K different sensor nodes. In this paper, we propose a new K-coverage algorithm for sensor networks, called Randomly Ordered Activation and Layering (ROAL), that solves the K-coverage problem in a small constant time in a distributed manner while providing simple and efficient dynamic reconfiguration for the WSNs. The simulation results show that the ROAL can guarantee K-coverage with the uncovered area less than 5% when a sufficient number of sensor nodes are provided, and that the lifetime of the sensor network is significantly extended by more than 400%.