Abstract

In wireless sensor network (WSN), most of the devices function on batteries. These nodes or devices have inadequate amount of initial energy which are consumed at diverse rates, based on the power level and intended receiver. In sleep scheduling algorithms, most of the sensor nodes are turned to sleep state to preserve energy and improve the network lifetime (NL). In this paper, an energy-efficient dynamic cluster-based protocol is proposed for WSN especially for physics-based applications. Initially, the network is divided into small clusters using adaptive clustering. The clusters are managed by the cluster heads. The cluster heads are elected based on the novel dynamic threshold. Afterwards, general variable neighborhood search is used to obtain the energy-efficient paths for inter-cluster data aggregation which is used to communicate with the sink. The performance of the proposed method is compared with competitive energy-efficient routing protocols in terms of various factors such as stable period, NL, packets sent to base station and packets sent to cluster head. Extensive experiments prove that the proposed protocol provides higher NL than the existing protocols.

Full Text
Paper version not known

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.