Energy efficient neighbor selection for flat wireless sensor networks

TL;DR

This paper compares two energy-efficient neighbor selection algorithms in flat wireless sensor networks, analyzing their performance as network size, operation rounds, and node failures increase to improve energy conservation and network longevity.

Contribution

It introduces and evaluates two energy-efficient neighbor selection algorithms specifically designed for flat wireless sensor networks.

Findings

Energy-efficient algorithms outperform traditional methods in conserving energy.

Performance degrades gracefully with increasing nodes and node failures.

The algorithms extend network lifetime under various conditions.

Abstract

In this paper we have analyzed energy efficient neighbour selection algorithms for routing in wireless sensor networks. Since energy saving or consumption is an important aspect of wireless sensor networks, its precise usage is highly desirable both for the faithful performance of network and to increase the network life time. For this work, we have considered a flat network topology where every node has the same responsibility and capability. We have compared two energy efficient algorithms and analyzed their performances with increase in number of nodes, time rounds and node failures.