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.

An Ant-Colony Routing Algorithm for Wireless Sensor Network

2013 ◽  
Vol 462-463 ◽  
pp. 112-117 ◽  
Author(s):  
Guang Cai Cui ◽  
Shan Shan Wang ◽  
Jing Jing Fang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Search Space ◽  
Feedback Mechanism ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Destination Node

According to real-time and limited energy of the wireless sensor network (WSN), this paper proposed an ant-colony algorithm (ACO) for optimal routing. The algorithm limited the search space to next node based on search angle and designed directional pheromones to guide ants to the destination node. Using negative feedback mechanism encouraged later ants to choose the optimal path. When ants are timeout with limited life cycle, go back along the way and reduce the pheromone. Probability-transfer function contained the factors of distance, energy, pheromones and search angle. Compared with other ACOs, the results show that it can balance the energy consumption and improve the routing in aspects of energy, dead nodes, short path and time delay.

Wireless Sensor Network Mobile Agent Routing Based on the Improved Ant Colony Algorithm

2014 ◽  
Vol 587-589 ◽  
pp. 2339-2345
Author(s):  
Jia Yan Li ◽  
Jun Ping Wang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Mobile Agent ◽  
Large Scale ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Redundant Data

This paper proposes a new wireless sensor routing algorithm by combining the ant colony algorithm with the mobile agent technology. This algorithm considers the distance and path energy overhead among nodes and residual node energy, equalizes the energy overhead in the network, improves the update rule of the ant colony information elements and speeds up convergence of the ant colony algorithm to get the optimal values. The simulation results indicate that this algorithm can improve the globalization and convergence speed, effectively reduce redundant data transmission and communication overhead, extend the network lifecycle and be very suitable for a large-scale wireless sensor network compared to other mobile agent routing algorithms.

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.

scholarly journals An Improved Ant Colony Algorithm in Wireless Sensor Network Routing

2017 ◽  
Vol 13 (05) ◽  
pp. 174 ◽  
Author(s):  
Liping LV
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Ant Colony Algorithm ◽  
Fitness Function ◽  
Optimal Solution ◽  
Network Routing ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Destination Node ◽  
Ant Colony Optimization Algorithm

<p class="0abstract"><span lang="EN-US">In order to make the energy consumption of network nodes relatively balanced, we apply ant colony optimization algorithm to wireless sensor network routing and improve it.</span><span lang="EN-US"> In this paper, we propose a multi-path wireless sensor network routing algorithm based on energy equalization. The algorithm uses forward ants to find the path from the source node to the destination node, and uses backward ants to update the pheromone on the path. In the route selection, we use the energy of the neighboring nodes as the parameter of the heuristic function. At the same time, we construct the fitness function, and take the path length and the node residual energy as its parameters. The simulation results show that the algorithm can not only avoid the problem of local optimal solution, but also prolong the life cycle of the network effectively.</span></p>

An Energy Efficient Wireless Sensor Network QOS Multicast Routing Algorithms Based on Ant Colony Algorithm

2012 ◽  
Vol 532-533 ◽  
pp. 1800-1804
Author(s):  
Qi Zhang ◽  
Hai Jun Xiong
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Ant Colony Algorithm ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Minimum Cost ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Energy Constraint ◽  
Multicast Routing Algorithm

Multicast routing technology of wireless sensor network is a method of transferring special data to a group of clients selectively; therefore, quality of the services is the key to evaluate the method. Ant colony algorithm is a bionic optimization algorithm. Improved QoS Multicast Routing Algorithm is proposed based on energy constraint and based on ant colony algorithm, it takes into account the energy cost routing, making the nodes to establish of minimum cost path under the condition of energy constraint. The results show that this algorithm can obtain better energy balance, improve the network services of the time. This algorithm applies to energy-sensitive multicast applications in wireless sensor networks.

Application of Improved Ant Colony Algorithm Technology in Development of Routing Protocol in Wireless Sensor Network

2014 ◽  
Vol 685 ◽  
pp. 583-586
Author(s):  
Tian Jun Lu ◽  
Yue Wang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Data Transmission ◽  
Ant Colony Algorithm ◽  
Network Routing ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Simulation Results ◽  
Improved Ant Colony Algorithm

This paper discusses the relevant theoretical problems of ant colony algorithm, analyzes the defects of the traditional ant colony algorithm, and proposed an improved ant colony algorithm to solve these problems. Wireless sensor network routing should satisfy both to ensure data transmission and reduce the amount of communication requirements. The paper presents development of routing protocol for wireless sensor network based on improved ant colony algorithm technology. The simulation results show the effectiveness of this algorithm.

Sign in / Sign up

Export Citation Format

Share Document