Energy Efficient Routing Strategies for Clustered Wireless Sensor Networks: An Analytical Framework

Abstract

The efficiency of a wireless sensor network depends on its life time. By conserving the battery power of individual sensor devices, considerable amount of total energy can be saved thereby increasing the total lifetime of the network. The operation phases of a wireless sensor network comprises of sensing the data, aggregating the data in an intermediate node, communicating and forwarding the aggregated data to the sink for further process. Among these, communication or routing process requires more energy than any other operation. Hence a better approach would be allowing only a selected number of nodes to communicate with the sink. This idea led to the construction of the sensor network as a number of clusters with a dynamically elected cluster-head node is only allowed to forward the data to the sink. Various routing techniques for clustered Wireless Sensor Networks has emerged yielding good result in improving the lifetime of the network. Here in this paper, a survey of these routing techniques are presented.

An Improved Energy Balanced Dissimilar Clustered Routing Architecture for Wireless Sensor Networks

“…A variant of Leach [18] is one among the very popular clustering algorithm that uses an uniform pattern in forming cluster sizes. We have enumerated various clustering protocols that effectively reduce energy consumption in our previous work [19]. The architecture that is being presented in this work is expected to increase the life-time of the network by placing the nodes nominally throughout the network.…”