Open AccessDistributed multi-hop routing algorithm for wireless sensor networks
Author(s) -
Morteza Mohammadi Zanjireh,
Jaafar Gadban
Publication year - 2020
Publication title -
facta universitatis. series electronics and energetics/facta universitatis. series: electronics and energetics
Language(s) - English
Resource type - Journals
eISSN - 2217-5997
pISSN - 0353-3670
DOI - 10.2298/fuee2004617m
Subject(s) - computer science , dijkstra's algorithm , shortest path problem , wireless sensor network , computer network , routing algorithm , link state routing protocol , static routing , hop (telecommunications) , algorithm , suurballe's algorithm , geographic routing , energy consumption , dynamic source routing , distance vector routing protocol , routing (electronic design automation) , routing protocol , engineering , theoretical computer science , graph , electrical engineering
In a Wireless Sensor Network (WSN), routing is the process of finding a cost effective route in terms of power consumption. As an evaluation criterion for the WSN performance, network lifetime is directly affected by the routing method. In a wide variety of WSNs, different techniques are used as routing methods, such as shortest distance path. In this paper, we propose a novel algorithm, optimizing power consumption in WSN nodes, based on the shortest path algorithm. In this approach, the energy level of nodes and their geographical distance from each other contribute to the weight of the connecting path. The proposed algorithm is used as a data dissemination method in WSNs with randomly scattered nodes. We also apply Dijkstra?s shortest path algorithm to the same networks. The results showed that the proposed algorithm increases the network lifetime up to 30 % by preventing nodes with low charge levels from early disconnection.