Abstract
In wireless sensor networks, clustering routing algorithms have been widely used owing to their high energy-efficiency and scalability. In clustering schemes, the nodes are organized in the form of clusters, and each cluster is governed by a cluster head. Once the cluster heads are selected, they form a backbone network to periodically collect, aggregate, and forward data to the base station using minimum energy (cost) routing. This approach significantly improves the network lifetime. Therefore, a new cluster head selection method that uses a weighted sum method to calculate the weight of each node in the cluster and compare it with the standard weight of that particular cluster is proposed in this paper. The node with a weight closest to the standard cluster weight becomes the cluster head. This technique balances the load distribution and selects the nodes with highest residual energy in the network. Additionally, a data routing scheme is proposed to determine an energy-efficient path from the source to the destination node. This algorithm assigns a weight function to each link on the basis of a fuzzy membership function and intra-cluster communication cost within a cluster. As a result, a minimum weight path is selected using Dijkstra’s algorithm that improves the energy efficiency of the overall system. The experimental results show that the proposed algorithm shows better performance than some existing representative methods in the aspects of energy consumption, network lifetime, and system throughput.
Highlights
Wireless sensor networks (WSNs) have received great attention owing to their wide usage in potential applications in numerous fields [1]
This study proposes an efficient cluster head (CH) selection method based on a weighted sum method to ensure the selection of an energy rich node in the whole network for each cluster
The fuzzy membership function considers the residual energy of the neighbor nodes instead of the source node, as seen in fuzzy maximum lifetime (FML) and energy saving routing algorithm based on Dijkstra (ESRAD)
Summary
Wireless sensor networks (WSNs) have received great attention owing to their wide usage in potential applications in numerous fields [1]. While designing a cluster-based routing algorithm, selection of CH should be performed efficiently because a CH executes energy intensive functions in a cluster such as data receiving, aggregation, and transmission to the BS. During the intra-cluster multi-hop communication, the sensor nodes located closer to the CH are required to receive and forward data more frequently compared to the farther nodes, which may lead to more energy depletion. This extra dissipation of energy minimizes the lifetime of the corresponding relay nodes and induces an energy imbalance in the whole network system [9].
Sign-in/Register to view highlights & summary 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.
