An Unequally Clustered Multihop Routing protocol for Wireless Sensor Networks
U. Hari, Рамачандран Баласубраманиан, Chris Johnson · 2013
Recent advances in Wireless Sensor Networks(WSN) have lead to many new protocols specifically designed for improving energy efficiency. Clustering is a key routing technique used to reduce the energy consumption. Most clustering algorithm provide an equal cluster size using node's ID degree and etc. In this paper we propose a simple clustering algorithm named as Unequally Clustered Multihop Routing (UCMR) protocol where each cluster has a different cluster size, based on its distance with reference to base station. In order to minimize the energy consumption of network and to improve the overall network performance the multi-hop routing with using Dijkstra's shortest path algorithm is used for intracluster and intercluster transmission. Simulation results show that UCMR improves network lifetime over Unequal Cluster-based Routing(UCR) algorithm and LEACH significantly.