Barrier coverage of WSNs with the imperialist competitive algorithm |
| |
| Authors: | Habib Mostafaei " target="_blank">Mohammad Shojafar Bahman Zaher Mukesh Singhal |
| |
| Affiliation: | 1.Department of Engineering,Roma Tre University,Rome,Italy;2.Department of Information Engineering, Electronic and Telecommunication,“Sapienza” University of Rome,Rome,Italy;3.CNIT (Center of National Consortium Inter-universities in Telecommunication),Department of Electronic Engineering, University of Rome – Tor Vergata, Via del Politecnico, 1,Rome,Italy;4.Department of Computer Engineering,Shabestar Branch, Islamic Azad University,Shabestar,Iran;5.Computer Science and Engineering,University of California at Merced,Merced,USA |
| |
| Abstract: | Barrier coverage in wireless sensor networks has been used in many applications such as intrusion detection and border surveillance. Barrier coverage is used to monitor the network borders to prevent intruders from penetrating the network. In these applications, it is critical to find optimal number of sensor nodes to prolong the network lifetime. Also, increasing the network lifetime is one of the important challenges in these networks. Various algorithms have been proposed to extend the network lifetime while guaranteeing barrier coverage requirements. In this paper, we use the imperialist competitive algorithm (ICA) for selecting sensor nodes to do barrier coverage monitoring operations called ICABC. The main objective of this work is to improve the network lifetime in a deployed network. To investigate the performance of ICABC, several simulations were conducted and the results of the experiments show that the ICABC significantly improves the performance than other state-of-art methods. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
