z-logo
open-access-imgOpen Access
Scaling complexity comparison of an ACO-based routing algorithm used as an IoT network core
Author(s) -
Goran Djukanovic,
Goran Popović,
Dimitris Kanellopoulos
Publication year - 2020
Publication title -
journal of information technology and applications
Language(s) - English
Resource type - Journals
eISSN - 2233-0194
pISSN - 2232-9625
DOI - 10.7251/jit2002073dj
Subject(s) - computer science , wireless sensor network , ant colony optimization algorithms , routing (electronic design automation) , routing algorithm , ant colony , energy consumption , internet of things , computer network , distributed computing , algorithm , routing protocol , embedded system , engineering , electrical engineering
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here