.png){kind=icon}
.png){kind=icon}
Return
Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2014.11.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this study, we aim to cover a sensing area by deploying a minimum number of wireless sensors while maintaining the connectivity between the deployed sensors. The problem may be reduced to a two-dimensional critical coverage problem which is an NP-Complete problem. We develop an integer linear programming model to solve the problem optimally. We also propose a local search (LS) algorithm and a genetic algorithm (GA) as approximate methods. We verify by computational experiments that the integer linear model, using Cplex, is able to provide an optimal solution of all our small and medium size problems. We also show that the proposed methods outperform some regular sensor deployment patterns. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Wireless sensor networks
Coverage problem
Connectivity
Integer linear model
Genetic algorithm
Local search algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W