Evolution of Various Controlled Replication Routing Schemes for Opportunistic Networks

Author(s):  
Hemal Shah ◽  
Yogeshwar P. Kosta
2012 ◽  
Vol 2012 ◽  
pp. 1-14 ◽  
Author(s):  
Daru Pan ◽  
Wei Cao ◽  
Han Zhang ◽  
Mu Lin

Due to the features of long connection delays, frequent network partitions, and topology unsteadiness, the design of opportunistic networks faces the challenge of how to effectively deliver data based only on occasional encountering of nodes, where the conventional routing schemes do not work properly. This paper proposes a hybrid probability choice routing protocol with buffer management for opportunistic networks. A delivery probability function is set up based on continuous encounter duration time, which is used for selecting a better node to relay packets. By combining the buffer management utility and the delivery probability, a total utility is used to decide whether the packet should be kept in the buffer or be directly transmitted to the encountering node. Simulation results show that the proposed routing outperforms the existing one in terms of the delivery rate and the average delay.


2013 ◽  
pp. 209-222 ◽  
Author(s):  
Vangelis Angelakis ◽  
Elias Tragos ◽  
George Perantinos ◽  
Di Yuan

2013 ◽  
Vol 24 (2) ◽  
pp. 230-242
Author(s):  
Liang-Yin CHEN ◽  
Zhen-Lei LIU ◽  
Xun ZOU ◽  
Zheng-Kun XU ◽  
Zhen-Qian GUO ◽  
...  

2014 ◽  
Vol 24 (3) ◽  
pp. 507-525 ◽  
Author(s):  
Lei WU ◽  
De-An WU ◽  
Ming LIU ◽  
Xiao-Min WANG ◽  
Hai-Gang GONG

2009 ◽  
Vol 32 (1) ◽  
pp. 54-68 ◽  
Author(s):  
Yang WANG ◽  
Chuang LIN ◽  
Quan-Lin LI ◽  
Jing-Qi WANG ◽  
Xin JIANG

Sign in / Sign up

Export Citation Format

Share Document