Clustering Routing Algorithms In Wireless Sensor Networks: An Overview

Xuxun Liu; Jinglun Shi
July 2012
KSII Transactions on Internet & Information Systems;Jul2012, Vol. 6 Issue 7, p1735
Academic Journal
Wireless sensor networks (WSNs) are becoming increasingly attractive for a variety of applications and have become a hot research area. Routing is a key technology in WSNs and can be coarsely divided into two categories: flat routing and hierarchical routing. In a flat topology, all nodes perform the same task and have the same functionality in the network. In contrast, nodes in a hierarchical topology perform different tasks in WSNs and are typically organized into lots of clusters according to specific requirements or metrics. Owing to a variety of advantages, clustering routing protocols are becoming an active branch of routing technology in WSNs. In this paper, we present an overview on clustering routing algorithms for WSNs with focus on differentiating them according to diverse cluster shapes. We outline the main advantages of clustering and discuss the classification of clustering routing protocols in WSNs. In particular, we systematically analyze the typical clustering routing protocols in WSNs and compare the different approaches based on various metrics. Finally, we conclude the paper with some open questions.


Related Articles

  • Energy Efficiency of Wireless Sensor Network using Reactive and Proactive Protocols. Bhattad, J. M.; Chede, S. D. // International Journal of Computer Applications;Nov2014, Vol. 105 Issue 1-18, p23 

    Data transfer between two or multiple nodes is a common but critical operation in many applications of wireless networks. One of the major constraints of wireless networks is limited energy available to sensor nodes because of the small size of the batteries used as source of power. Clustering...

  • A Survey on Energy Efficient Multipath Routing Algorithms for Wireless Sensor Networks. Reddy, K. Chandra; Padhy, Chinmaya P.; Jena, Sudarson // International Journal of Advanced Research in Computer Science;Apr2014 Special Issue, Vol. 5 Issue 4, p146 

    Routing in wireless sensor networks is a demanding task. This demand has led to a number of routing protocols which efficiently utilize the limited resources available at the sensor nodes. All these protocols typically find the minimum energy path. In this paper we analyze different routing...

  • Performance Comparison of LEACH and LEACH-N Protocols BY MATLAB. Parashar, Sunita; Sharma, Poonam // International Journal of Advanced Research in Computer Science;Jul/Aug2012, Vol. 3 Issue 4, p216 

    In recent years, there has been a growing interest in wireless sensor networks. In Wireless Sensor Networks sensor nodes life time is the most critical parameter. Minimizing energy dissipation and maximizing network lifetime are important issues in the design of applications and protocols for...

  • Numerical Modeling and Experimental Verification for High-Speed and Heavy-Load Planar Mechanism with Multiple Clearances. Meng, Fangang; Wu, Shijing; Zhang, Fan; Liang, Liang // Mathematical Problems in Engineering;10/29/2015, p1 

    Transmission mechanism is one of the most important parts of the Ultra-High Voltage (UHV) circuit breaker. It has specific characteristics such as fast response, high speed, and heavy load in the processes of open and close actions. This paper studies the effects of multiple clearances on the...

  • ENERGY EFFICIENT DISTRIBUTED MULTI-PARENT ROUTING FOR WIRELESS SENSOR NETWORKS. Kaushik, Praveen; Singhai, Jyoti // International Conference on Information Technology;2013, p1 

    Increasing the lifetime of energy constraint Wireless Sensor Network (WSN) is one of most critical and challenging requirement. In this paper, an Energy Efficient Distributed Multi-Parent (EEDMP) heuristic routing algorithm is proposed to maximize the minimum lifetime of WSN and enhance its...

  • Strategic Network Formation Game for Energy Consumption Balancing. Khanmirza, Hamed; Yazdani, Nasser // Wireless Personal Communications;Sep2015, Vol. 84 Issue 2, p841 

    Creation of hot-spots is unavoidable, in multihop wireless sensor networks using the least power (or shortest path) routing method. This happens due to the irregularity of underlying network structures. Since hot-spots lose their energy faster than other nodes, they might create network...

  • Security DV-hop localisation algorithm against wormhole attack in wireless sensor network. Jianpo Li; Dong Wang; Yanjiao Wang // IET Wireless Sensor Systems;2018, Vol. 8 Issue 2, p68 

    Distance vector-hop (DV-hop) is a localisation algorithm based on distance vector routing, which often suffers the wormhole attack. To solve this problem, a security DV-hop localisation algorithm against wormhole attack (AWDV-hop) is proposed. First, the algorithm establishes the neighbour node...

  • (EBHCR) Energy Balancing and Hierarchical Clustering Based Routing algorithm for Wireless Sensor Networks. Hamed, Roghaiyeh Gachpaz; Karimpour, Jaber // Australian Journal of Basic & Applied Sciences;2011, Vol. 5 Issue 9, p1 

    Whereas the energy constraint is one of the most important restrictions in wireless sensor networks so the energy balancing is essential for prolonging the network lifetime. In the recent years many protocols have been proposed for clustering on wireless sensor network to balance the energy...

  • Topology Control and Routing in Large Scale Wireless Sensor Networks. Slama, Ines; Jouaber, Badii; Zeghlache, Djamal // Wireless Sensor Network;Aug2010, Vol. 2 Issue 8, p584 

    In this paper, a two-tiered Wireless Sensor Network (WSN) where nodes are divided into clusters and nodes forward data to base stations through cluster heads is considered. To maximize the network lifetime, two energy efficient approaches are investigated. We first propose an approach that...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics