Abstract

Efficient clustering is a well-documented NP-hard optimization problem in wireless sensor networks (WSNs). Variety of computational intelligence techniques including evolutionary algorithms, reinforcement learning, artificial immune systems and recently, artificial bee colony (ABC) metaheuristic have been applied for efficient clustering in WSNs. Due to ease of use and adaptive nature, ABC arose much interest over other population-based metaheuristics for solving optimization problems in WSNs. However, its search equation contributes to its insufficiency due to comparably poor exploitation cycle and requirement of certain control parameters. Thus, we propose an improved artificial bee colony (iABC) metaheuristic with an improved solution search equation to improve exploitation capabilities of existing metaheuristic. Further, to enhance the global convergence of the proposed metaheuristic, an improved population sampling technique is introduced through Student’s t-distribution, which require only one control parameter to compute and store and therefore increase efficiency of proposed metaheuristic. The proposed metaheuristic maintain a good balance between exploration and exploitation search abilities with least memory requirements; moreover, the use of first-of-its-kind compact Student’s t-distribution makes it suitable for limited hardware requirements of WSNs. Additionally, an energy-efficient clustering protocol based on iABC metaheuristic is presented, which inherits the capabilities of the proposed metaheuristic to obtain optimal cluster heads along with an optimal base station location to improve energy efficiency in WSNs. Simulation results show that the proposed clustering protocol outperforms other well-known protocols on the basis of packet delivery, throughput, energy consumption, network lifetime and latency as performance metric.

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.