Abstract
In general, wireless sensor network works by a small battery-powered, or limited energy. Once the wireless sensor network is deployed, the energy of small sensor nodes can not be replaced. So, to improve energy efficiency and extend the survival time of the whole network is a crucial issue. This paper presents a new type of energy balancing algorithm for wireless sensor networks. The BCDCP-M algorithm draws on the main idea of the BCDCP routing protocol. When the base station divides the network, the new algorithm makes the number of cluster heads equal to the optimal number of cluster heads as far as possible. On cluster head election, not only the average energy of the sensor network, but also the remaining energy of the individual node must be taken into account. In data transmission, we use the multi-hop method to select the optimal path. The simulation results show that the survival time of the network in the new BCDCP-M algorithm is 19% longer than BCDCP.
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.
