Abstract
Considering the characteristics of sensor nodes' limited energy and limited transmission radius, the clustering hierarchy tree routing algorithm based on LEACH was proposed. In cluster construction stage, the optimal candidate cluster heads would become the final cluster heads, which guaranteed the distance between any two heads was far enough and neither of them was in the same area of radius, so the cluster heads were uniformly distributed in the network. In the inter-cluster communication, cluster heads form a hierarchical tree and the root was Base Station (BS), which reduced the energy consumption of direct data transmission from the head to BS, thereby prolonging the life cycle of the network.
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.
