Comparison of particle swarm and ant colony optimization in wireless sensor network routing

Abstract

Wireless Sensor Networks (WSNs) represent an indispensable means for data acquisition from distributed devices within Industry 4.0. WSN consists of sensor nodes placed randomly in a plant. As a rule, their allocation does not provide the possibility for direct transmission of data between two nodes, and multi-hop data transfer is necessary. WSN energy efficiency is an important issue and to address it the communication effort should be minimized. One of the most effective ways to achieve this is routing, i.e. the process of finding the optimal path from the transmitting to the receiving node. In this paper, we compare four different routing algorithms, based on particle swarm and ant colony optimization.