Solving -Barrier Coverage Problem Using Modified Gravitational Search Algorithm

Yanhua Zhang, Xingming Sun and Zhanke Yu

Mathematical Problems in Engineering, 2017, vol. 2017, 1-12

Abstract:

Coverage problem is a critical issue in wireless sensor networks for security applications. The -barrier coverage is an effective measure to ensure robustness. In this paper, we formulate the -barrier coverage problem as a constrained optimization problem and introduce the energy constraint of sensor node to prolong the lifetime of the -barrier coverage. A novel hybrid particle swarm optimization and gravitational search algorithm (PGSA) is proposed to solve this problem. The proposed PGSA adopts a -barrier coverage generation strategy based on probability and integrates the exploitation ability in particle swarm optimization to update the velocity and enhance the global search capability and introduce the boundary mutation strategy of an agent to increase the population diversity and search accuracy. Extensive simulations are conducted to demonstrate the effectiveness of our proposed algorithm.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2017/1206129.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2017/1206129.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:1206129

DOI: 10.1155/2017/1206129

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().