Abstract
Low-energy adaptive clustering routing protocol is a low-power adaptive hierarchical routing protocol designed for IoT, which has the function of extending network life time. In order to balance the energy consumption of wireless sensor network nodes and extend the life cycle of the whole network, the cluster heads are randomly selected in the classical clustering LEACH algorithm of the wireless sensor network of the Internet of Things, and the residual energy, node position and node density of the nodes are not considered. The problem is solved by the research of LEACH protocol, the selection of cluster head and the communication mechanism between cluster head and Sink. An improved clustering routing algorithm of LEACH protocol is proposed. The simulation experiment proves that the improved LEACH algorithm has more energy consumption than the comparison algorithm, the lowest power consumption of the cluster head node, and better network connectivity and reliability.
Highlights
The 21st century is an era in which human beings fully enter the electronic information
This paper focuses on the clustering routing algorithm of IoT, especially the energy-balanced clustering routing algorithm
IoT SENSING LAYER CLUSTERING ROUTING ALGORITHM BASED ON ENERGY BALANCE In order to balance the energy consumption of wireless sensor network nodes and extend the life cycle of the whole network, an improved LEACH protocol is proposed by studying the LEACH protocol, optimizing the cluster head selection and the communication mechanism between the cluster head and Sink cluster routing algorithm
Summary
The 21st century is an era in which human beings fully enter the electronic information. IoT SENSING LAYER CLUSTERING ROUTING ALGORITHM BASED ON ENERGY BALANCE In order to balance the energy consumption of wireless sensor network nodes and extend the life cycle of the whole network, an improved LEACH protocol is proposed by studying the LEACH protocol, optimizing the cluster head selection and the communication mechanism between the cluster head and Sink cluster routing algorithm. The algorithm proposed by Zhang and Chen [22] considers the residual energy of the node and the distance from the base station to select the relay node for multi-hop routing on the basis of non-uniform clustering, and calculates the competition radius of the non-uniform clustering. The cluster head node fuses the received data and transmits the data to the sink in a single hop manner
Sign-in/Register to view highlights & summary 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.
