Abstract
Lifetime is one of the most critical indexes of the Wireless Sensor Network (WSN). In this paper, we propose a clustering protocol based on the meta-heuristic approach (CPMA). CPMA takes the network lifetime as the primary consideration and consists of two parts. The first part focuses on the online cluster head selection and network communication coordination. The selection is based on the Harmony Search (HS) Algorithm, which aims to reduce the total energy dissipation and smooth the energy distribution throughout the network. Currently, most clustering protocols cannot automatically tune the corresponding protocol parameters according to the diversity of different WSNs. To solve such issue, the second part of CPMA uses the Artificial Bee Colony (ABC) algorithm to optimize its crucial parameters. The optimization is offline and will be executed only once before the network is working. We make a detailed comparison of CPMA with classical clustering protocols. The results show that CPMA can better prolong the network lifetime and improve network throughput under almost all the network conditions. Furthermore, our simulation also exhibits that CPMA has good adaptability and performs well under different network lifetime definitions. All the results prove that CPMA has the advantages of being suitable and efficient for a wide number of WSN applications.
Highlights
T HE rapid advances in the field of integrated sensors, low power wireless transceivers, and microcontroller units have made low-cost multi-functional tiny sensing platforms available [1] in the last decades
We propose a clustering protocol based on the meta-heuristic approach (CPMA)
We develop an online cluster head selection strategy based on the Harmony Search Algorithm
Summary
T HE rapid advances in the field of integrated sensors, low power wireless transceivers, and microcontroller units have made low-cost multi-functional tiny sensing platforms available [1] in the last decades. Effective routing protocols are requisite to avoid the sensor depletion and prolong the network lifetime [5]. Many clustering protocols were proposed for adhoc networks to overcome mobility and enable point-to-point connectivity. We propose a clustering protocol based on the meta-heuristic approach (CPMA). In the second part of the CPMA, we use the Artificial Bee Colony (ABC) algorithm to optimize the cluster head ratio P and the weight factor α jointly. The result shows that CPMA can prolong the network lifetime and improve the throughput compared to other protocols in almost all the application scenarios. The rest of the paper is organized as follows: In Section II, we give a brief review of the existing clustering-based routing protocols.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: 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.
