An Unequally Clustered Multihop Routing protocol for Wireless Sensor Networks
Authors:
- 1 August 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1007-1011
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Diversity-Multiplexing Tradeoff Analysis of Coded Multi-User Relay NetworksIEEE Transactions on Communications, 2011
- Multi-Hop Data Communication Algorithm for Clustered Wireless Sensor NetworksInternational Journal of Distributed Sensor Networks, 2011
- Multiple-User Cooperative Communications Based on Linear Network CodingIEEE Transactions on Communications, 2010
- The Clustering Algorithm of Wireless Sensor Networks Based on Multi-hop between Clusters2009
- An unequal cluster-based routing protocol in wireless sensor networksWireless Networks, 2007
- HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networksIEEE Transactions on Mobile Computing, 2004
- An application-specific protocol architecture for wireless microsensor networksIEEE Transactions on Wireless Communications, 2002