Research on Vehicle Networking Clustering Routing Algorithm Based on Subtractive Clustering

2014 ◽  
Vol 644-650 ◽  
pp. 2366-2369
Author(s):  
Li Zhe Yu ◽  
Tiao Juan Ren ◽  
Zhang Quan Wang ◽  
Ban Teng Liu
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Driving Safety ◽  
Subtractive Clustering ◽  
Head Node ◽  
Intelligent Traffic System ◽  
Vehicle Networking

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.

Research on Routing Protocol for Wireless Sensor Network Based on Ant-Colony Algorithm

2013 ◽  
Vol 411-414 ◽  
pp. 716-720
Author(s):  
Lei Sang ◽  
Duo Long
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Destination Node ◽  
Head Node

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.

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

2021 ◽  
Vol 3 (3) ◽  
pp. 156-160
Author(s):  
Jin Yong-xian
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Multipath Routing ◽  
Cluster Head ◽  
Optimal Number ◽  
Wireless Sensor ◽  
Unequal Clustering ◽  
Selection Probability ◽  
Factor Node

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.

PROCEDURE OF SELECTING A CLUSTER HEAD NODE IN A WIRELESS SENSOR NETWORK USING FUZZY LOGIC

2018 ◽  
pp. 81-89
Author(s):  
Ekaterina Andreevna Evstifeeva ◽  
Valeriy Dmitrievich Semeykin
Keyword(s):  
Fuzzy Logic ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Power Efficiency ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Head Node ◽  
Input Parameters

Clustering, as one of the energy-efficient approaches, is widely used in wireless sensor networks. This method is based on creating clusters and selecting cluster head nodes in a wireless sensor network. Clustering saves network energy because data transfer is restricted between multiple nodes. Thus, clustering is provided between several nodes, and the service life of the wireless sensor network can be extended. Since the parent cluster node interacts with other nodes of the network, a node with a high level of residual energy must be selected to perform this role. When the energy level of the selected cluster head node becomes lower than the threshold value, then the re-election of this node takes place. It should be noted that multiple patterns of choosing cluster head nodes built using various parameters (residual node energy, distance from the base station to a node, distance between the head node and a cluster member, the number and proximity of neighboring nodes, etc.) lacked for a factor of energy consumption, i.e. how many times nodes communicated to each other. To cope with the problem, this paper presents a prognostic algorithm for selecting a cluster head node using fuzzy logic. This algorithm suggests using a number of input parameters, such as the residual energy of the node, the proximity of neighboring nodes, and the centralization of the node in the cluster. The proposed algorithm has been implemented using the software package MATLAB Fuzzy Logic Toolbox. The simulation results prove the advantages of the proposed technique; application of the input parameters mentioned above helps select optimal cluster head nodes in a wireless sensor network, which increases power efficiency of a wireless sensor network.

Level and Cluster Based Routing for Wireless Sensor Network

2013 ◽  
Vol 321-324 ◽  
pp. 515-522 ◽  
Author(s):  
Kou Lin Yuan ◽  
Lin Qiao ◽  
Lei Han
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Sensor Node ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Method ◽  
Sink Node ◽  
Head Node ◽  
Cluster Based Routing

This paper proposes a level and cluster based routing approach for a wireless sensor network. Nodes in the network are divided into several levels according to their hops to sink node. Every sensor node has a level number. Using level information, a sensor node can send messages to a sink node in a more efficient way, and a sink node can easily locate other sensor nodes. To make network more balanced, the paper introduces a cluster method, which splits nodes in the same level into different clusters, and chooses a cluster head for every cluster, to switch nodes in the cluster to work in turn. Unlike all other cluster routing methods, a cluster head node takes schedule jobs of sensor nodes in the cluster according to their energy left, instead of sensing. The paper also presents several algorithms for constructing a wireless sensor network, querying and scheduling. The simulation experiment shows that the scalability of our method is approximately linear.

WN-LEACH: A Weighted Residual Energy Based Cluster-Heads Selection Algorithm for Wireless Sensor Network

2013 ◽  
Vol 765-767 ◽  
pp. 980-984
Author(s):  
Xi Rong Bao ◽  
Jia Hua Xie ◽  
Shuang Long Li
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cumulative Number ◽  
Cluster Heads

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.

The Research of Routing Algorithm Based on Shortest Path Tree in WSNs

2013 ◽  
Vol 347-350 ◽  
pp. 3899-3902
Author(s):  
Yu Hua Liu ◽  
Zhen Rong Luo ◽  
Ke Xu ◽  
Cui Xu
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Shortest Path ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Shortest Path Tree ◽  
Hierarchical Topology

This article poses an algorithm of the hierarchical topology in wireless sensor network based on shortest path tree algorithm to cover the shortage of LAC Routing Algorithm (LAC-T), which based on SPT(Shortest Path Tree). LAC-T algorithm elects cluster head by the remaining energy of nodes and the distance between node and base station. Meanwhile, it uses SPT to communicate among cluster heads in WSNs. The result of stimulation shows that LAC-T algorithm is not only easy to achieve, but could be better balance the energy consumption of each node, extend the lifespan of WSN (Wireless Sensor Network).

Sign in / Sign up

Export Citation Format

Share Document