scholarly journals Predictive Retransmissions for Intermittently Connected Sensor Networks with Transmission Diversity

2018 ◽  
Vol 17 (1) ◽  
pp. 1-25 ◽  
Author(s):  
MD. Majharul Islam Rajib ◽  
Asis Nasipuri
Keyword(s):  
Sensor Networks ◽  
Transmission Diversity ◽  
Intermittently Connected

scholarly journals A novel energy-aware routing protocol in intermittently connected delay-tolerant wireless sensor networks

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771738 ◽  
Author(s):  
Min Wook Kang ◽  
Yun Won Chung
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Probabilistic Routing ◽  
History Of ◽  
Delay Tolerant ◽  
Overhead Ratio ◽  
Intermittently Connected

In delay-tolerant wireless sensor networks, messages for sensor data are delivered using opportunistic contacts between intermittently connected nodes. Since there is no stable end-to-end routing path like the Internet and mobile nodes operate on battery, an energy-efficient routing protocol is needed. In this article, we consider the probabilistic routing protocol using history of encounters and transitivity protocol as the base protocol. Then, we propose an energy-aware routing protocol in intermittently connected delay-tolerant wireless sensor networks, where messages are forwarded based on the node’s remaining battery, delivery predictability, and type of nodes. The performance of the proposed protocol is compared with that of probabilistic routing protocol using history of encounters and transitivity and probabilistic routing protocol using history of encounters and transitivity with periodic sleep in detail, from the aspects of delivery ratio, overhead ratio, delivery latency, and ratio of alive nodes. Simulation results show that the proposed protocol has better delivery probability, overhead ratio, and ratio of alive nodes, in most of the considered parameter settings, in spite of a small increase in delivery latency.

An Improved Routing Algorithm in Intermittently Connected Sensor Networks

2011 ◽  
Vol 213 ◽  
pp. 236-240
Author(s):  
Qi Lie Liu ◽  
Ying Jun Pan ◽  
Hui Feng Yan ◽  
Xin Li ◽  
Meng Wei Zhu
Keyword(s):  
Sensor Networks ◽  
Routing Algorithm ◽  
Contact Duration ◽  
Contact Frequency ◽  
Simulation Results ◽  
And Performance ◽  
Intermittently Connected

This paper analyzes the principle and performance of routing algorithm in intermittently connected sensor networks, and proposes an enhanced routing algorithm, which is named Transmission Probabilities Routing (TPR).TPR chooses the next-hop node to forward packets according to the forward-probability, which is calculated by contact-frequency and contact-duration. Simulation results indicate that TPR can obviously improve the performance of networks, compared to PROPHET and Epidemic.

Sign in / Sign up

Export Citation Format

Share Document