.png){kind=icon}
.png){kind=icon}
Return
Distributed lifetime coverage optimization protocol in wireless sensor networks
.png){kind=icon}
OA
AI
DOI：10.1007/s11227-015-1558-x.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
One of the main research challenges faced in Wireless Sensor Networks (WSNs) is to preserve continuously and effectively the coverage of an area (or region) of interest to be monitored, while simultaneously preventing as much as possible a network failure due to battery-depleted nodes. In this paper, we propose a protocol, called distributed lifetime coverage optimization protocol (DiLCO), which maintains the coverage and improves the lifetime of a wireless sensor network. First, we partition the area of interest into subregions using a classical divide-and-conquer method. Our DiLCO protocol is then distributed on the sensor nodes in each subregion in a second step. To fulfill our objective, the proposed protocol combines two effective techniques: a leader election in each subregion, followed by an optimization-based node activity scheduling performed by each elected leader. This two-step process takes place periodically, to choose a small set of nodes remaining active for sensing during a time slot. Each set is built to ensure coverage at a low energy cost, allowing to optimize the network lifetime. Simulations are conducted using the discrete event simulator OMNET++. We refer to the characteristics of a Medusa II sensor for the energy consumption and the computation time. In comparison with two other existing methods, our approach is able to increase the WSN lifetime and provides improved coverage performances.
Keywords:
Wireless sensor networks
Area coverage
Network lifetime
Optimization
Scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
990
Citations:
1.0W