Exact and Efficient Heuristic Deployment in WSN under Coverage, Connectivity, and Lifetime Constraints
Wireless sensor networks lay down many challenging optimization problems, such as coverage, node deployment, tracking or energy conservation. In this paper, we are interested in deployment strategies that result in a minimum of sensors network while ensuring target coverage connectivity between the sensors and sink. To this end, we propose two alternative deployment approaches based on integer linear programming and we exploit the linear-programming sequential fixing technique to design three polynomial-time heuristic procedures. The performance and effectiveness of these approaches in terms of network cost and computational requirements are highlighted through several experiments. Furthermore, we investigate the network lifetime problem where a given operational duration must be reached.
Year of publication: |
2017
|
---|---|
Authors: | Fellah, Soumaya ; Kaddour, Mejdi |
Published in: |
International Journal of Mobile Computing and Multimedia Communications (IJMCMC). - IGI Global, ISSN 1937-9404, ZDB-ID 2703549-9. - Vol. 8.2017, 2 (01.04.), p. 27-43
|
Publisher: |
IGI Global |
Subject: | Connectivity | Coverage | Energy | Integer Linear Programming | Lifetime | Wireless Sensor Network |
Saved in:
Saved in favorites
Similar items by subject
-
Guermazi, Abderrahmen, (2016)
-
Maximum lifetime coverage preserving scheduling algorithms in sensor networks
Cheng, Maggie, (2011)
-
Maximum lifetime connected coverage with two active-phase sensors
Du, Hongwei, (2013)
- More ...