Open AccessEfficient time reducing and energy saving routing algorithm for wireless sensor network
Author(s) -
S. Venkataramana,
B. V. D. S. Sekhar,
N. Deshai,
V. V. S. S. S. Chakravarthy,
Sreenivasa Rao
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1228/1/012002
Subject(s) - wireless sensor network , computer science , routing algorithm , energy (signal processing) , routing (electronic design automation) , homogeneous , throughput , node (physics) , computer network , key distribution in wireless sensor networks , energy consumption , geographic routing , distributed computing , wireless network , wireless , dynamic source routing , routing protocol , engineering , telecommunications , mathematics , electrical engineering , statistics , structural engineering , combinatorics
The research article presents a novel energy saving routing algorithm for wireless sensor networks (WSNs) to meet the demand of present research trend. In contrast to conventional methods, a new concept of dominant node has been introduced in this paper. Unlike the conventional algorithms, the proposed method can be applied to both homogeneous and heterogeneous networks. The proposed method focuses on the proper energy distribution among the sensor nodes so that it can offer an energy efficient solution while maintaining improved network lifetime and throughput. The proposed idea has been validated through simulation results. Moreover, the supremacy of the proposed method has been established over existing ones.