<abstract xmlns="http://www.w3.org/1999/xhtml"><p>In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can easily lead to the “hot spot” problem. Furthermore, the majority of routing algorithms barely consider the problem of long distance communication between adjacent cluster heads that brings high energy consumption. Therefore, this paper proposes a new cross unequal clustering routing algorithm based on the EEUC algorithm. In order to solve the defects of EEUC algorithm, this algorithm calculating of competition radius takes the node’s position and node’s remaining energy into account to make the load of cluster heads more balanced. At the same time, cluster adjacent node is applied to transport data and reduce the energy-loss of cluster heads. Simulation experiments show that, compared with LEACH and EEUC, the proposed algorithm can effectively reduce the energy-loss of cluster heads and balance the energy consumption among all nodes in the network and improve the network lifetime</p></abstract>

In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can easily lead to the “hot spot” problem. Furthermore, the majority of routing algorithms barely consider the problem of long distance communication between adjacent cluster heads that brings high energy consumption. Therefore, this paper proposes a new cross unequal clustering routing algorithm based on the EEUC algorithm. In order to solve the defects of EEUC algorithm, this algorithm calculating of competition radius takes the node’s position and node’s remaining energy into account to make the load of cluster heads more balanced. At the same time, cluster adjacent node is applied to transport data and reduce the energy-loss of cluster heads. Simulation experiments show that, compared with LEACH and EEUC, the proposed algorithm can effectively reduce the energy-loss of cluster heads and balance the energy consumption among all nodes in the network and improve the network lifetime

A Cross Unequal Clustering Routing Algorithm for Sensor Network

College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China

Key Laboratory of E-Business and Information Security, Hangzhou Normal University, Hangzhou 311121, China

College of Mechanical and Electrical, Harbin Engineering University, Harbin 150001, China

School of Computer Science and Technology, Heilongjiang University, Harbin 150080, China

Measurement Science Review

{"article-title":"A Cross Unequal Clustering Routing Algorithm for Sensor Network"}

In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can...

A Cross Unequal Clustering Routing Algorithm for Sensor Network

Publicado en línea: 24 ago 2013

Páginas: 200 - 205

DOI: https://doi.org/10.2478/msr-2013-0029

Palabras clave
Sensor networks, routing algorithm, energy balance

This content is open access.

A Cross Unequal Clustering Routing Algorithm for Sensor Network

Publicado en línea: 24 ago 2013

Páginas: 200 - 205

DOI: https://doi.org/10.2478/msr-2013-0029

Palabras claveSensor networks, routing algorithm, energy balance

This content is open access.

Palabras clave
Sensor networks, routing algorithm, energy balance