Izvorni znanstveni članak
https://doi.org/10.30765/er.1900
An energy efficient coverage guaranteed greedy algorithm for wireless sensor networks lifetime enhancement
Berhan Oumer Adame
; Department of Electrical and Computer Engineering, Arba Minch Institute of Technology, Arba Minch University, Arba Minch, Ethiopia
Eyayaw Zewdu
; 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; Saveetha School of Engineering, Saveetha Institute of Medical and Technical Sciences, India
Sažetak
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. Network lifetime is an important metric for battery-powered networks. There are several approaches to improve network lifetime, such as data aggregation, clustering, topology, scheduling, rate allocation, routing, and mobile relay. Therefore, in this paper, the authors present a method that aims to improve the lifetime of WSN nodes using a greedy algorithm. The proposed Greedy Algorithm method is used to extend the network lifetime by dividing the sensors into a number of disjoint groups while satisfying the coverage requirements. The proposed Greedy algorithm has improved the network lifetime compared to heuristic algorithms. The method was able to generate a larger number of disjoint groups.
Ključne riječi
greedy algorithm, disjoint cover set, energy efficient, lifetime, WSN
Hrčak ID:
294985
URI
Posjeta: 256 *