Abstract
Aiming at the problem of energy imbalance and low-energy efficiency in wireless sensor network, a novel energy-balanced clustering routing algorithm based on spectral graph partition is proposed in this paper, which firstly calculates the optimum single-hop distance, balances the energy consumption of cluster heads, and avoids that the number of cluster heads is not fixed and cluster heads are clustered by using the traditional probability function. In addition, the transmission cost function is designed to construct the optimum transmission path to reduce energy consumption. The experimental results show that the network performance of our proposed algorithm is improved, which achieves on low-energy network for loss reduction and load balancing.
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 callMore From: Journal of Ambient Intelligence and Humanized Computing
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.
