Abstract

Energy maintenance is one of the crucial characteristics for wireless sensor networks. Clustering techniques in WSNs is wildly used to cope with sensor network deficiencies. Organizing nodes in such clusters and specifying a particular node in each cluster to undertake the task of intra-cluster and inter-cluster data communications leads to alleviate the number of transmissions and hence longer lifetime of the Network. Most of decentralized clustering protocols are performed without any acknowledgement of a route which data traverse to reach the base station. In this paper, a new distributed energy efficient multi-level route-aware clustering algorithm for WSNs called MLRC is proposed. To establish tree among sensor nodes, MLRC applies a route conscious manner in which nodes could gain desired information about possible routes to the destination. The proposed protocol eliminates extra generation of routing control packets by implementing cluster formation and routing tree construction, concurrently. Cluster heads are elected based on effective parameters. The algorithm could moderate energy consumption of relays close to the base station with assigning probability to adjacent cluster head and avoiding the insistence on the nearest cluster head selection. Experimental results illustrate that the protocol improves network longevity in comparison with other known protocols.

Full Text
Published version (Free)

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