DocumentCode :
1658509
Title :
RET: A Random and Encounter Time Based Forwarding Mechanism for Opportunistic Network
Author :
Shu, Jian ; Yu, Kun ; Liu, Linlan ; Chen, Yebin ; Fan, Youlei
Author_Institution :
Sch. of Software, Nanchang Hangkong Univ., Nanchang, China
fYear :
2010
Firstpage :
50
Lastpage :
53
Abstract :
Based on the analysis of the existing utility-based forwarding mechanisms, for the inefficient forwarding of history encounter time based forwarding mechanism in the initial phase of the node movement, a Random and Encounter Time Based algorithm named RET is proposed in this paper. RET divides the nodes moving into two phases-random forwarding phase (initial phase) and utility-based forwarding phase. In random forwarding phase, random algorithm is used to forward packets. And in utility-based forwarding phase, the packets are forwarded by using utility value. The results of simulation experiment show that the RET algorithm can reduce the delivery delay under low node density.
Keywords :
computer networks; random processes; RET algorithm; delivery delay; historical encounter time; low node density; node movement; opportunistic network; packet forwarding; random algorithm; random and encounter time based forwarding mechanism; random forwarding phase; utility value; utility-based forwarding mechanism; utility-based forwarding phase; Ad hoc networks; Analytical models; Conferences; Delay; Mobile communication; Mobile computing; Routing; forwarding mechanism; historical encounter time; opportunistic network; utility-based;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Processing (ISIP), 2010 Third International Symposium on
Conference_Location :
Qingdao
Print_ISBN :
978-1-4244-8627-4
Type :
conf
DOI :
10.1109/ISIP.2010.86
Filename :
5668996
Link To Document :
بازگشت