Name
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 () for selecting sensor nodes to do barrier coverage monitoring operations called . The main objective of this work is to improve the network lifetime in a deployed network. To investigate the performance of , several simulations were conducted and the results of the experiments show that the significantly improves the performance than other state-of-art methods. |
Year | DOI | Venue |
|---|---|---|
2017 | https://doi.org/10.1007/s11227-017-2067-x | The Journal of Supercomputing |
Keywords | Field | DocType |
Barrier coverage,Imperialist competitive algorithm (,ICA,),Wireless sensor networks (WSNs),Border surveillance | Key distribution in wireless sensor networks,Computer science,Computer network,Wireless sensor network,Imperialist competitive algorithm,Intrusion detection system,Distributed computing | Journal |
Volume | Issue | ISSN |
73 | 11 | 0920-8542 |
Citations | PageRank | References |
7 | 0.55 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Habib Mostafaei | 1 | 211 | 13.90 |
| Mohammad Shojafar | 2 | 553 | 42.31 |
| Bahman Zaher | 3 | 7 | 0.55 |
| Mukesh Singhal | 4 | 2602 | 259.07 |