Coverage Optimization for Wireless Sensor Networks by Evolutionary Algorithm
@inproceedings{Li2015CoverageOF,
title={Coverage Optimization for Wireless Sensor Networks by Evolutionary Algorithm},
author={Kangshun Li and Zhichao Wen and Shen Li},
booktitle={International Symposium on Intelligence Computation and Applications},
year={2015},
url={https://api.semanticscholar.org/CorpusID:21960591}
}The deficiencies of traditional evolution algorithm fitness function are analyzed, an improved fitness function design scheme is put forward, and it has been proved that it has advantage of solving problem on wireless sensor networks coverage optimization.
2 Citations
A genetic algorithm-based solution for multi-type maximal covering location problem (MMCLP): application to defense and deterrence
- 2024
Engineering, Computer Science
A multi-type with non-overlapping coverage requirement as an extension to the classical formulation for the maximal covering location problem (MCLP) is presented and a hybrid metaheuristic solution approach is proposed, for which a genetic algorithm is proposed and integrated with local and large neighborhood search operators.
An Overview on Set Covering Problems With a Focus on Military Applications
- 2019
Mathematics, Political Science
This chapter deals with the set covering problem, a specific type of a discrete location and representative combinatorial optimization problem, which occupies a huge space in military operations…
15 References
An energy-efficient algorithm for connected target coverage problem in wireless sensor networks
- 2010
Computer Science, Engineering
A heuristic solution to solve the connected set covers (CSC) problem is proposed and the simulation results show that the proposed algorithm can get acceptable solutions with polynomial computation time and can improve the performance of the Greedy-CSC heuristic algorithm in solution quality.
Layout optimization for a wireless sensor network using a multi-objective genetic algorithm
- 2004
Engineering, Computer Science
This paper examines the optimization of wireless sensor network layouts by benchmarking a multi objective genetic algorithm (MOGA) for the sensor placement, where the two competing objectives considered are the total sensor coverage and the lifetime of the network.
Evolutionary algorithm for the dynamic coverage problem applied to wireless sensor networks design
- 2005
Computer Science, Engineering
This work presents an integer linear programming formulation and an evolutionary algorithm for this combinatorial problem, applying the dynamic coverage problem (DCP) to network-design purposes.
Maximum network lifetime in wireless sensor networks with adjustable sensing ranges
- 2005
Computer Science, Engineering
This paper mathematically model solutions to the adjustable range set covers (AR-SC) problem and design heuristics that efficiently compute the sets and simulation results are presented to verify the approaches.
Grid-based approach for working node selection in wireless sensor networks
- 2004
Computer Science, Engineering
The performance of the proposed WN selection schemes is quantified and the tradeoff among accuracy, communication overhead and computational time is evaluated via analyses and simulations.
Coverage problems in wireless ad-hoc sensor networks
- 2001
Computer Science, Engineering
This work establishes the main highlight of the paper-optimal polynomial time worst and average case algorithm for coverage calculation, which answers the questions about quality of service (surveillance) that can be provided by a particular sensor network.
Wireless Sensor Networks
- 2012
Engineering, Computer Science
An overview of this new and exciting field of wireless sensor networks is provided and a brief discussion on the factors pushing the recent flurry of sensor network related research and commercial undertakings is discussed.
A GA approach to the optimal placement of sensors in wireless sensor networks with obstacles and preferences
- 2006
Computer Science, Engineering
A new and efficient genetic algorithm (GA) to the optimal placement of sensors in a grid area with obstacles and preferences to minimize the number of sensors is proposed.
Multi-objective evolutionary optimizations of a space-based reconfigurable sensor network under hard constraints
- 2007
Engineering, Computer Science
This paper presents the optimizations of a space-based reconfigurable sensor network under hard constraints by employing an efficient multi-objective evolutionary algorithm (MOEA) and a system model is proposed for cluster-based space wireless sensor networks.
Sensor placement for effective coverage and surveillance in distributed sensor networks
- 2003
Engineering, Computer Science
Two algorithms are presented that address coverage optimization under the constraints of imprecise detections and terrain properties and are targeted at average coverage as well as at maximizing the coverage of the most vulnerable grid points.