Mobility adaptive unequal cluster-based routing protocol in wireless sensor networks

Abstract

In wireless sensor networks, the impact of mobility and node failure on data delivery and network lifetime are crucial. This paper presents a mobility aware clustering algorithm which works in conjunction with the fault detection algorithm. Nodes detected as faulty do not participate in cluster election which in turn improves data delivery. An energy and mobility aware greedy geographic routing protocol is designed which constructs a cluster head backbone for the inter–cluster communication. Since the stability of the hierarchical architecture is crucial in determining the network performance, a sensor node elects itself as a cluster head basing on its residual energy and mobility. A non–cluster head node chooses a cluster head with highest link stability. To address the hot spot problem, this work groups the nodes into clusters of unequal sizes.