An energy efficient coverage guaranteed greedy algorithm for wireless sensor networks lifetime enhancement

Authors

  • Eyayaw Zewdu Department of Electrical and Computer Engineering, Arba Minch Institute of Technology, Arba Minch University, Arba Minch, Ethiopia
  • Berhan Oumer Adame Department of Electrical and Computer Engineering, Arba Minch Institute of Technology, Arba Minch University, Arba Minch, Ethiopia
  • Ayodeji Olalekan Salau Department of Electrical/Electronics and Computer Engineering, Afe Babalola University, Ado-Ekiti, Nigeria http://orcid.org/0000-0002-6264-9783

Abstract

One of the most significant difficulties in Wireless Sensor Networks (WSNs) is energy efficiency, as they rely on minuscule batteries that cannot be replaced or recharged. In battery-operated networks, energy must be used efficiently. The network lifetime is an important metric for battery operated networks. Several approaches are available to improve the network lifetime; such as data aggregation, clustering, topology, scheduling, rate allocation, routing, and mobile relay. Therefore, in this paper, the authors present a method aimed at improving the lifetime of WSN nodes by using a greedy algorithm. The proposed Greedy Algorithm method is used to extend the network's lifetime by dividing the sensors into a number of disjoint sets while satisfying coverage requirements. Comparatively the proposed greedy algorithm has improved network lifetime than heuristic algorithms. The method was able to generate a greater number of disjoint sets.

Downloads

Published

2023-03-29