Energy-Efficient Ant Colony-Based k-Hop Clustering and Transmission Range Assignment Protocol for Connectivity Construction in Dense Wireless Sensor Networks
Gokou Hervé Fabrice Diédié1, Boko Aka1 & Michel Babri2 Show affiliations
- Université Nangui Abrogoua, Cote D'Ivoire
- Institut National Polytechnique Houphouet Boigny, Cote D'Ivoire
Journal of Computer Science, Volume 14, Issue 3, pp. 376–395 · doi.org/10.3844/jcssp.2018.376.395
Abstract
Connectivity construction is the main phase of a communication-oriented topology control process. It consists of improving the current network physical topology while preserving important properties such as connectivity and symmetry. In this paper, we address the problem of combining two of the techniques commonly used for this purpose in networks composed of a large number of energy constrained wireless sensor-nodes namely, clustering and power control. We propose an ant colony-based asynchronous and localized protocol that helps to significantly reduce energy losses by simultaneously eliminating redundant and poor quality links, always keeping the Cluster Head-to-member distance up to k-hops (k≥1) and minimizing signalization. Simulation results show that our protocol outperforms some state-of-the-art solutions in terms of Quality of the Topology (QoT) and network lifetime prolongation.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Fabrice Diédié, G. H., Aka, B. & Babri, M. (2018). Energy-Efficient Ant Colony-Based k-Hop Clustering and Transmission Range Assignment Protocol for Connectivity Construction in Dense Wireless Sensor Networks. Journal of Computer Science, 14(3), 376–395. https://doi.org/10.3844/jcssp.2018.376.395
- Licence
- CC BY 3.0
- Issue
- Volume 14, Issue 3
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
