In recent years Mobile Wireless Sensor Networks have observed a substantial increase in the use of specific applications like surveillance, military applications, disaster management, wildlife monitoring, etc. The wireless nodes are small electronic devices embedded with various sensors to perform the given tasks. These sensor nodes are provided with a limited battery power which is a big constraint for the performance of the network in unattended environments. Also, mobility affects the battery life of the nodes to a great extent. Thus, it is necessary to design protocols to make the efficient use of available energy in the nodes and to acquire complete operability. This problem can be solved to some extent by clustering of the sensor nodes. This paper is a study about constraints of WSN and clustering techniques used for forming the network are presented.

A Survey on Mobility Driven Clustering Techniques for Wireless Sensor Networks

One of the most important challenges in Wireless Sensor Networks is their stringent energy contraint. Sensors are basically battery power devices where the replacement of these batteries can be costly and complicated. Node mobility is the main cause of energy over consumption, the disconnection between nodes and by the way the instability of the whole network. Motivated by this, we investigate clustering approach based on the Weighted Clustering Algorithm (WCA) that outperforms the state-art in terms of energy consumption and possesses the advantages of resilience against node mobility. The proposed method aims to elect the most stable and powerful node in term of energy, connectivity and link quality by controlling the network stability in order to avoid the disconnection between nodes.

Clustering approach using node mobility in Wireless Sensor Networks

Energy consumption has always been the most serious issue to consider while deploying Wireless Sensor Networks (WSNs). Sensor nodes are limited in power, computational capacities and memory so reporting the occurring of specific events, such as fire or flooding, as quickly as possible using minimal energy resources is definitely a challenging issue. In this work, we propose a novel, reactive and energy-efficient scheme in order to report events. In our algorithm, nodes that detect a certain event will organize themselves into a cluster, elect a clusterhead that will collect data from the cluster members, aggregate it and forward it to the mobile sink. Our approach considers the signal strength received from the mobile sink as well as the residual energy of sensor nodes. It is worth to mention that our scheme is completely reactive, so no pre-configuration phase is needed, which will lead to a high energy saving. In order to implement and evaluate our algorithm, we used Opnet simulator. A new Opnet sensor node model, where the network layer is implemented from scratch, is also proposed in this paper; our scheme is implemented using Opnet Process Modeling Methodology (PMM).

A Survey on Mobility Driven Clustering Techniques for Wireless Sensor Networks

References

Clustering approach using node mobility in Wireless Sensor Networks

A new clustering scheme for wireless sensor networks

Related Papers (5)

A Survey on Clustering Approaches to Strengthen the Performance of Wireless Sensor Network

Comparison of Energy Efficient Clustering Protocols in Heterogeneous Wireless Sensor Networks

Energy Efficient Cluster based Hierarchical Routing Protocols in Wireless Sensor Network - a Survey

Cooperative Clustering Algorithms for Wireless Sensor Networks

An effective key management scheme for mobile heterogeneous sensor networks