Abstract

The energy consumption optimization in the routing protocols of wireless sensor networks has always been at the center of scientific research. In this context, an improved version of the TDEEC protocol entitled ITDDEC allowing maximization lifetime of the network by excluding the closest nodes to the base station from the election process of the cluster heads. In fact, this approach has led to a new energy balance that depends on two critical parameters: the number of excluded nodes and the number of clusters. However, the implementation of this proposition by traditional optimization methods, must take into consideration the implementing cost and its speed in each sensor node because it has low memory and modest processing capacities. In this paper, we present a comparative study between different classical optimization methods and one nature-inspired algorithm entitled Firefly. This in the goal to highlight the different indicators, such as the number of iterations, the execution time, the convergence, the precision and the memory capacity. Simulations under Matlab proves that this last optimization method offers an improvement of lifetime by 48% compared to the TDEEC protocol and 13.58% compared to the ITDEEC protocol and an increase in the number of packets received of 178% compared to the TDEEC protocol and 3% compared to the ITDEEC protocol. The proposed solution is suitable for application because it offers satisfactory optimization enhancement of the total network energy consumption by recovering the energy lost in the node's calculation.

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.