Scaling complexity comparison of an ACO-based routing algorithm used as an IoT network core

Authors

  • Goran Djukanovic PanEuropean University APEIRON Banjaluka, Bosnia and Herzegovina
  • Goran Popovic Department of Electrical Engineering, International University Travnik, Bosnia and Herzegovina
  • Dimitris Kanellopoulos ESD Lab, Department of Mathematics, University of Patras, Patras, Greece

DOI:

https://doi.org/10.7251/JIT2002073DJ

Abstract

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.

Author Biographies

Goran Djukanovic, PanEuropean University APEIRON Banjaluka, Bosnia and Herzegovina

PanEuropean University APEIRON Banjaluka, Bosnia and Herzegovina

Goran Popovic, Department of Electrical Engineering, International University Travnik, Bosnia and Herzegovina

Department of Electrical Engineering, International University Travnik, Bosnia and Herzegovina

Dimitris Kanellopoulos, ESD Lab, Department of Mathematics, University of Patras, Patras, Greece

ESD Lab, Department of Mathematics, University of Patras, Patras, Greece

Downloads

Published

2021-09-20

Issue

Vol. 20 No. 2 (2020): JITA - APEIRON

Section

Чланци