Name
Abstract | ||
|---|---|---|
Maximizing the coverage area while maintaining a lower cost of deployment has always been a challenge, especially when the monitoring region is unknown and possibly hazardous. Many coverage-preserving algorithms have been proposed for maintaining k-coverage. The k-coverage configuration is extensively exploited to ensure that each location is covered by at least k active sensor nodes. However, most of these algorithms incur: i) Redundant sensor occurrence. ii) Considerably high computation cost. In this paper, we propose a Low-Complex Coverage Eligibility Algorithm(LCE), an efficient and accurate k-coverage eligibility algorithm that settles all of the above critical problems and prove that a monitored area is k-covered with very low cost. LCE proves that whether a sensor is eligible to sleep (redundant) or stay active can be accurately determined by simply checking if its neighbours belong to a well known set of points within its sensing range (Eligibility Area). LCE has a computational complexity of O(N), where N is the number of neighbouring nodes, lower than the complexity of many other eligibility algorithms ([7](O(N2log(N))), [9](2O(N2log(N)), [5](O(N3))). Simulation results confirm the theoretical analysis. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2816839.2816854 | Proceedings of the International Conference on Intelligent Information Processing, Security and Advanced Communication |
DocType | ISBN | Citations |
Conference | 978-1-4503-3458-7 | 0 |
PageRank | References | Authors |
0.34 | 3 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manel Chenait | 1 | 13 | 3.28 |
| Bahia Zebbane | 2 | 13 | 3.28 |
| Sihem Filali | 3 | 0 | 0.34 |
| Ibtissem Belhocine | 4 | 0 | 0.34 |
| Chafika Benzaid | 5 | 54 | 13.06 |
| Nadjib Badache | 6 | 612 | 60.98 |