Abstract

Wireless Sensor Network (WSN) is a wireless network to connecting devices in the form of nodes and used to collect data. Every node that is connected has limited energy because it only uses batteries. Currently there are many routing protocols that function to save energy from nodes on the network. Low-energy adaptive clustering hierarchy (LEACH) is TDMA-based MAC protocols which aim of improves the lifespan of WSN by lowering the energy consumption with clustering. There have also been many developments of LEACH with various advantages. A LEACH genetic algorithm (LEACH-GA) is one of them that use genetic algorithms in order to choose the cluster head (CH) optimization processes. This study aims to analyze the performance of LEACH-GA and LEACH in term of network lifetime and energy efficiency in several scenarios with different location of sink node. In previous studies where genetic algorithms for first use in LEACH obtained results of effective producing optimal energy consumption for wireless sensor networks, and resulting in an extension of lifetime for the network. In our research we added several scenarios, namely regarding the location of the base station placement. By using several scenarios that have been compiled, the results of the LEACH-GA have a better performance than LEACH with the results of a longer network life, higher energy efficiency, and more data received by the base station. In addition if applied to a wider area with the same number of nodes, the LEACH-GA performance can be better than LEACH.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.