Context-Aware Routing Algorithm for WSNs Based on Unequal Clustering

Clustering and multi-hop routing algorithms prolongs the lifetime of wireless sensor networks(WSNS) substantially. However, existing algorithms usually consider clustering and routing as two independent problems. Information exchanged in clustering phase is not fully utilized in routing phase. Energy Hole is another problem that shrinks the lifetime of WSNs due to the characteristics of the multi-hop forwarding model. In this paper, we propose a Context-Aware Unequal-Clustering Routing Algorithm (CAUCR) for WSNs, which consists of an Optimized Weighted Unequal-Clustering Algorithm (OWUCA) and a Reverse Minimum Energy (RME) multi-hop routing algorithm. During our OWUCA clustering process, we additionally save some useful information for the subsequent RME routing algorithm, including minimum energy, minimum hop to base, and residual energy of neighbor cluster heads. RME starts routing construction based on the cluster head´s distance to the sink, and the cluster head closer to the sink forms the routing table earlier. At the same time, RME utilizes the saved clustering information to reduce the overhead and energy consumption of the routing phase. Simulation results show that our CAUCR balances the energy consumption among sensor nodes, relieves the influence of ´energy hole´, and achieves an obvious improvement on the network lifetime.