Spider monkey optimization routing protocol for wireless sensor networks
Abstract
Uneven energy consumption (UEC) is latent trouble in wireless sensor networks (WSNs) that feature a multiple motion pattern and a multi-hop routing. UEC often splits the network, reduces network life, and leads to performance degradation. Sometimes, improving energy consumption is more complicated because it does not reduce energy consumption only, but it also extends network life. This makes energy consumption balancing critical to WSN design calling for energy-efficient routing protocols that increase network life. Some energy-saving protocols have been applied to make the energy consumption among all nodes inside the network equilibrate in the expectancy and end power in almost all nodes simultaneously. This work has suggested a protocol of energy-saving routing named spider monkey optimization routing protocol (SMORP), which aims to probe the issue of network life in WSNs. The proposed protocol reduces excessive routing messages that may lead to the wastage of significant energy by recycling frequent information from the source node into the sink. This routing protocol can choose the optimal routing path. That is the preferable node can be chosen from nodes of the candidate in the sending ways by preferring the energy of maximum residual, the minimum traffic load, and the least distance to the sink. Simulation results have proved the effectiveness of the proposed protocol in terms of decreasing end-to-end delay, reducing energy consumption compared to well-known routing protocols.
Keywords
network lifetime; routing; spider monkey optimization; WSNs;
Full Text:
PDFDOI: http://doi.org/10.11591/ijece.v11i3.pp2432-2442
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
International Journal of Electrical and Computer Engineering (IJECE)
p-ISSN 2088-8708, e-ISSN 2722-2578
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).