A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Scaling complexity comparison of an ACO-based routing algorithm used as an IoT network core
2020
JITA - Journal of Information Technology and Applications (Banja Luka) - APEIRON
This paper proposes a routing method that is based on an Ant Colony Algorithm (ACO) for minimizing energy consumption in Wireless Sensor Networks (WSNs). The routing method is used as the backbone of the Internet of Things (IoT) platform. It also considers the critical design issues of a WSN, such as the energy constraint of sensor nodes, network load balancing, and sensor density in the field. Special attention is paid to the impact of network scaling on the performance of the ACO-based routing algorithm.
doi:10.7251/jit2002073dj
fatcat:iclc33tojrhejhljpd6eic6c4y