Area k-Coverage Optimization Protocol for Heterogeneous Dense Wireless Sensor Networks

Abstract

Abstract-Detecting redundant nodes and scheduling their activity is mandatory to prolong the lifetime of a densely-deployed wireless sensor network. Provided that the redundancy check and the scheduling phases both help to preserve the coverage ratio and guarantee energy efficiency. However, most of the solutions usually proposed in the literature, tend to allocate a large number of unnecessary neighbor (re)discovery time slots in the dutycycle of the active nodes. Such a shortcoming is detrimental to battery power conservation. In this paper, we propose a crossing points-based heuristic to fast detect redundant nodes even in heterogeneous networks; then, an integer linear program and a local exclusion based strategy to respectively, formulate and solve the sensing unit scheduling problem. Simulations show that the resulting localized asynchronous protocol outperforms some state-of-the-art solutions with respect to coverage preservation and network lifetime enhancement.

CHEAP: An Efficient Localized Area Coverage Maintenance Protocol for Wireless Sensor Networks

“…Also note that any area coverage redundancy check protocol found in the literature can be used to detect redundant nodes [14]. Although, we suggest the MRZ-based one we proposed in our previous works [51,52].…”

“…These errors are detrimental to hole full coverage. HORA and ZBFR provide better results (respectively between 95.2% and 95.6% and between 96.5% and 97%) because these schemes mainly consider redundant nodes when trying to eliminate a coverage hole; but these performances are mitigated by the fact that coverage redundancy check is a NP-complete problem [51,52] which requires approximate solutions that often lead to several false negative cases. The latter prevent efficient candidates mobility and hole full coverage.…”