scholarly journals Unequal Clustering Multipath Routing Algorithm for Wireless Sensor Network based on Clustering and Ant Colony

Author(s):  
Jin Yong-xian

To improve the energy efficiency of the wireless sensor network (WSN), and extend the network life. This paper proposes an improved unequal clustering multipath routing algorithm (UCMRA). The algorithm improves the formula of cluster head selection probability and competition radius, and considers the energy factor, node density, optimal number of cluster heads, etc. Experimental results show that, compared with the traditional algorithm, UCMRA has more stable cluster head distribution, less energy consumption and longer network lifetime.

Author(s):  
Pawan Singh Mehra

AbstractWith huge cheap micro-sensing devices deployed, wireless sensor network (WSN) gathers information from the region and delivers it to the base station (BS) for further decision. The hotspot problem occurs when cluster head (CH) nearer to BS may die prematurely due to uneven energy depletion resulting in partitioning the network. To overcome the issue of hotspot or energy hole, unequal clustering is used where variable size clusters are formed. Motivated from the aforesaid discussion, we propose an enhanced fuzzy unequal clustering and routing protocol (E-FUCA) where vital parameters are considered during CH candidate selection, and intelligent decision using fuzzy logic (FL) is taken by non-CH nodes during the selection of their CH for the formation of clusters. To further extend the lifetime, we have used FL for the next-hop choice for efficient routing. We have conducted the simulation experiments for four scenarios and compared the propound protocol’s performance with recent similar protocols. The experimental results validate the improved performance of E-FUCA with its comparative in respect of better lifetime, protracted stability period, and enhanced average energy.


2013 ◽  
Vol 13 (4) ◽  
pp. 200-205 ◽  
Author(s):  
Wang Tong ◽  
Wu Jiyi ◽  
Xu He ◽  
Zhu Jinghua ◽  
Charles Munyabugingo

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


2014 ◽  
Vol 644-650 ◽  
pp. 2366-2369
Author(s):  
Li Zhe Yu ◽  
Tiao Juan Ren ◽  
Zhang Quan Wang ◽  
Ban Teng Liu

Vehicle networking is an important part of intelligent traffic system. It combines wireless sensor network and mobile autonomous network, which is better for drivers to obtain road condition information to ensure driving safety. This paper focuses on the analysis of subtractive clustering and proposed clustering routing algorithm based on subtractive clustering in order to reduce communication of wireless sensor network and redundant flooding and routing expanse. In the algorithm, cluster head selection adopts subtractive clustering to produce cluster node in node intensive place. Cluster forms by adopting current non cluster head node mechanism which reduced energy consumption. Then the maintenance method of cluster is proposed. At last, it introduces routing protocol of cluster which is easier for clustering structure to manage and synchronize network.


2013 ◽  
Vol 765-767 ◽  
pp. 980-984
Author(s):  
Xi Rong Bao ◽  
Jia Hua Xie ◽  
Shuang Long Li

This article focused on the energy limit property of Wireless Sensor Network, and proposed a residual energy based algorithm WN-LEACH, with the classic network mode of LEACH routing algorithm. The algorithm combines the proportion of residual energy in the total energy with the cumulative number of the normal nodes supported by the cluster heads as a cluster selection reference. In order to balance the energy consumption of each cluster-head, the algorithm took both the different positions of the base station and the initial energy of the network into consideration, and weighted the two factors to balance the energy consumption between transmitting the signals and data fusion. Simulation results show that the algorithm can promote the lifetime of the uneven energy network and does not impair the effects of the LEACH algorithm.


Wireless Sensor Network (WSN) is a set of self-regulating sensors which are minute devices and it has limited battery power and a reduced amount of computing ability. The nodes of the sensors dispensed arbitrarily or physically in the sensing region to log the environmental constraints of a region meant to notify a specific destination called BS (BS). The organization of WSN into a set of clustering enabling effective exploitation of restricted energy resources of the placed nodes. But, the issue of uneven energy utilization exists and is related to the localization of a specific node in WSN. When the network undergo organization into different clusters where few significant nodes plays a vital role of cluster head (CH) for network management. In some cases, the clusters are organized in an unequal form called Unequal Clustering Size (UCS) to organize the nodes, results in consistent energy utilization and maximized lifetime of WSN. Besides, it is evident that it offers consistent energy utilization in a homogeneous way.


2013 ◽  
Vol 411-414 ◽  
pp. 716-720
Author(s):  
Lei Sang ◽  
Duo Long

Routing protocol is mainly responsible for seeking optimized path between source node and destination node and forwarding data package along the optimized path in a right way, which is a core link in wireless sensor network. In this thesis, a research on WSN routing algorithm based on ant-colony algorithm is done, targeting the features of WSN and on the basis of the analysis of classic routing protocol. Comparison and analysis of the path and convergence rate of cluster head node are done by means of emulated analysis, which is to some extent innovative and significant to research.


Sign in / Sign up

Export Citation Format

Share Document