Node energy-aware probabilistic routing algorithm for delay/disruption tolerant network

2013 ◽  
Vol 32 (12) ◽  
pp. 3512-3516
Author(s):  
Kai FU ◽  
Jing-bo XIA ◽  
Ming-hui LI
Keyword(s):  
Routing Algorithm ◽  
Energy Aware ◽  
Probabilistic Routing ◽  
Disruption Tolerant Network ◽  
Node Energy

A Probabilistic Routing Algorithm Based on Node Free Buffer-Utilization in Delay Tolerant Network

2013 ◽  
Vol 401-403 ◽  
pp. 2044-2047
Author(s):  
Hong Cheng Huang ◽  
Xi Zhang ◽  
Yi Ding Mao
Keyword(s):  
Network Architecture ◽  
Routing Algorithm ◽  
Buffer Management ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Delivery Ratio ◽  
Excitation Threshold ◽  
Probabilistic Routing ◽  
Disruption Tolerant Network ◽  
Set Up

This Delay/Disruption Tolerant Network(DTN) is a New Network Architecture for Communication in Restricted Condition with High Latency and Intermittent Connectivity.In Order to Solve the Problem that Messages can Not be Delivered Reliably because of Mobility and Limited Buffer Size of Nodes in DTN,a Probabilistic Routing Algorithm Based on Node Free Buffer-Utilization (NFBU)is Proposed.The Algorithm Sets Node Free Buffer Warning/excitation Threshold,through Warning/incentive Factor to Increase/decrease the Node Forwarding Probability,and Set up the Buffer Management Strategy,message Time to Live(TTL)value is Smaller,the Higher its Priority,at the same Time Remove the Oldest Message to get more Buffer Space.Simulations Indicate that the Algorithm Improves Delivery Ratio and Reduces Network Latencies in Different Node Free Buffer-Utilization State Compared with some other Routing Algorithms,and it is Highly Adaptable to Network.

P2P Probabilistic Routing Algorithm Based on Data Copying and Bloom Filter

2011 ◽  
Vol 22 (4) ◽  
pp. 773-781
Author(s):  
Gui-Ming ZHU ◽  
De-Ke GUO ◽  
Shi-Yao JIN
Keyword(s):  
Routing Algorithm ◽  
Bloom Filter ◽  
Probabilistic Routing

Research and Improvement about LEACH Routing Protocol for Wireless Sensor Networks

2012 ◽  
Vol 241-244 ◽  
pp. 1028-1032
Author(s):  
Li Wang ◽  
Qi Lin Zhu
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Selection Algorithm ◽  
Energy Factor ◽  
Random Cluster ◽  
Simulation Results ◽  
Node Energy

In recent years, as the development of wireless sensor network, people do some deep researches on cluster-based protocol, most around the prolongation of the lifetime of WSN and decline of energy consumed by the sensors. This paper analyses of classical clustering routing protocol based on LEACH, aiming at the node energy foot presents energy improved clustering routing algorithm, the random cluster head selection algorithm of threshold to be changed, lowering the threshold, in the original threshold increases the node's remaining energy factor, reduces the communication load of cluster nodes, and simulation. The simulation results show that the LEACH-E improved algorithm, energy saving, reducing balance node energy consumption, effectively prolongs the network lifetime.

scholarly journals Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Sohail Jabbar ◽  
Rabia Iram ◽  
Muhammad Imran ◽  
Awais Ahmad ◽  
Anand Paul ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Large Scale ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Route Discovery ◽  
Route Selection ◽  
Energy Aware ◽  
Forwarding Node

Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

scholarly journals An Energy Aware Multipath Routing Algorithm for Wireless Sensor Networks

2017 ◽  
Vol 13 (04) ◽  
pp. 45 ◽  
Author(s):  
Liping LV
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Data Transmission ◽  
Routing Algorithm ◽  
Path Selection ◽  
Low Energy ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Transmission Path

<p class="0abstract"><span lang="EN-US">Wireless sensor network is a new field of computer science and technology research. It has a very broad application prospects. In order to improve the network survival time, it is very important to design efficient energy-constrained routing protocols. In this paper, we studied the characteristics of wireless sensor networks, and analyzed the design criteria of sensor network routing algorithms. In view of the shortcomings of traditional algorithms, we proposed an energy-aware multi-path algorithm. When selecting a data transmission path, the energy-aware multi-path algorithm can avoid nodes with low energy levels. At the same time, it takes the remaining energy of the node and the number of hops as one of the measures of the path selection. The multi-path routing algorithm realized the low energy consumption of the data transmission path, thus effectively prolonging the network lifetime. Compared with the traditional algorithm, the results show that our method has high reliability and energy efficiency.</span></p>

Sign in / Sign up

Export Citation Format

Share Document