Maximizing Lifetime of Range-Adjustable Wireless Sensor Networks: A Neighborhood-Based Estimation of Distribution Algorithm
Open Access
- 1 April 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 51 (11) , 5433-5444
Abstract
Sensor activity scheduling is critical for prolonging the lifetime of wireless sensor networks (WSNs). However, most existing methods assume sensors to have one fixed sensing range. Prevalence of sensors with adjustable sensing ranges posts two new challenges to the topic: 1) expanded search space, due to the rise in the number of possible activation modes and 2) more complex energy allocation, as the sensors differ in the energy consumption rate when using different sensing ranges. These two challenges make it hard to directly solve the lifetime maximization problem of WSNs with range-adjustable sensors (LM-RASs). This article proposes a neighborhood-based estimation of distribution algorithm (NEDA) to address it in a recursive manner. In NEDA, each individual represents a coverage scheme in which the sensors are selectively activated to monitor all the targets. A linear programming (LP) model is built to assign activation time to the schemes in the population so that their sum, the network lifetime, can be maximized conditioned on the current population. Using the activation time derived from LP as individual fitness, the NEDA is driven to seek coverage schemes promising for prolonging the network lifetime. The network lifetime is thus optimized by repeating the steps of the coverage scheme evolution and LP model solving. To encourage the search for diverse coverage schemes, a neighborhood sampling strategy is introduced. Besides, a heuristic repair strategy is designed to fine-tune the existing schemes for further improving the search efficiency. Experimental results on WSNs of different scales show that NEDA outperforms state-of-the-art approaches. It is also expected that NEDA can serve as a potential framework for solving other flexible LP problems that share the same structure with LM-RAS.Keywords
Funding Information
- National Natural Science Foundation of China (61772569, 61873095, U1611262)
This publication has 33 references indexed in Scilit:
- Maximal Lifetime Scheduling for Roadside Sensor Networks With Survivability $k$IEEE Transactions on Vehicular Technology, 2014
- A Hybrid Memetic Framework for Coverage Optimization in Wireless Sensor NetworksIEEE Transactions on Cybernetics, 2014
- Dynamic adjustment of sensing range for event coverage in wireless sensor networksJournal of Network and Computer Applications, 2014
- Heuristic methods to maximize network lifetime in directional sensor networks with adjustable sensing rangesJournal of Network and Computer Applications, 2014
- Improving Estimation of Distribution Algorithm on Multimodal Problems by Detecting Promising AreasIEEE Transactions on Cybernetics, 2014
- Autonomous Deployment for Load Balancing $k$-Surface Coverage in Sensor NetworksIEEE Transactions on Wireless Communications, 2014
- An exact approach for maximizing the lifetime of sensor networks with adjustable sensing rangesComputers & Operations Research, 2012
- Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing rangesEuropean Journal of Operational Research, 2012
- The many facets of linear programmingMathematical Programming, 2002
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984