Solving k-Barrier Coverage Problem Using Modified Gravitational Search Algorithm
Coverage problem is a critical issue in wireless sensor networks for security applications. The k-barrier coverage is an effective measure to ensure robustness. In this paper, we formulate the k-barrier coverage problem as a constrained optimization problem and introduce the energy constraint of sen...
Main Authors: | Yanhua Zhang, Xingming Sun, Zhanke Yu |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2017-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2017/1206129 |
Similar Items
-
Solving shortest path problem using gravitational search algorithm and neural networks
by: Sinaie, Saman
Published: (2010) -
A Modified Gravitational Search Algorithm for Function Optimization
by: Shoushuai He, et al.
Published: (2019-01-01) -
A memory-based gravitational search algorithm for solving economic dispatch problem in micro-grid
by: Zahraoui Younes, et al.
Published: (2021-06-01) -
Self-Adaptive Gravitational Search Algorithm With a Modified Chaotic Local Search
by: Junkai Ji, et al.
Published: (2017-01-01) -
Memetic Particle Gravitation Optimization Algorithm for Solving Clustering Problems
by: Ko-Wei Huang, et al.
Published: (2019-01-01)