Energy Efficient Node Selection Algorithm (EENSA) in Routing Protocols of Wireless Sensor Networks

Main Article Content

Mahendra Dongare, Satish Jondhal, Balasaheb Agarkar

Abstract

The sensor node with finite energy becomes the main constraint for operation of wireless sensor networks (WSNs). Researchers proposed routing protocols that use little energy for dealing the constraint. We suggest an Energy-Efficient Node Selection Algorithm (EENSA) that increases the network's overall lifespan. The node's trust level, connectivity degree, and distance from the sink is analyzed individually and combined linearly by assigning weights to each parameter. It provides node’s effective potential function that makes it an energy efficient node. Rounds needed to choose the most energy-efficient node is also conformed. EENSA comparison with traditional method using energy distance for routing protocols like Power Efficient Gathering in Sensor Information Systems (PEGASIS), Shortest Hop Routing (SHORT), Optimized Reduced Energy Consumption (OREC), and Load Balance and Energy Efficient Routing Algorithm (LBEERA) is done through simulation. There is significant extended 8% improvement in network lifetime using EENSA which carries the energy efficient node selection.

Article Details

Section
Articles