Abstract

The effectiveness of a wireless sensor network relies on the underlying routing protocol. In this paper, we propose a novel algorithm which leverages both flat and hierarchical routing schemes for maximizing energy efficiency. It designates some desired number of nodes as cluster heads leading to cluster formation in the network. Inside clusters, nodes adopt multi-hop routing scheme to communicate with cluster head, which on reception of data packets from all cluster members, transmits the aggregated data along the precomputed path to the sink. Intra-cluster communication can happen in two modes viz., philanthropist—maximal residual energy neighbor node is selected, and selfish—nearest node is selected as next hop. Our approach refrain nodes from transmitting along long links, thus minimizing the energy consumption of the network. We simulated our algorithm against established protocols, and results indicate that it outperforms other protocols for network characteristics like energy minimization and scalability.

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 call

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.