By Topic

Robust k -Coverage Algorithms for Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Simon, G. ; Dept. of Comput. Sci., Pannonia Univ., Veszprem ; Molnar, M. ; Gonczy, L. ; Cousin, B.

Robustness, fault tolerance, and a long lifetime are key requirements of sensor networks used in real-world applications. Dense sensor networks with high sensor redundancy offer the possibility of redundant sensing and low duty-cycle operation at the same time; thus, the required robust sensing services can be provided along with an elongated lifetime. In this paper, the controlled greedy sleep algorithm is analyzed. With low local communication overhead, the proposed algorithm is able to solve the k -coverage sensing problem while it effectively preserves energy in the network. In addition, it can adapt to dynamic changes in the network, such as node failures. The quality of service (networkwide k-coverage) is guaranteed independently of communication errors in the network (as long as it is physically possible); message losses affect only the network lifetime. Node failures may cause a temporary decrease in the coverage service. The robustness of the algorithm is proven, and its behavior is illustrated by simulation examples.

Published in:

Instrumentation and Measurement, IEEE Transactions on  (Volume:57 ,  Issue: 8 )