Efficient routing based on past information to predict the future location for message passing in infrastructure-less opportunistic networks

被引:17
作者
Dhurandher, Sanjay K. [1 ]
Sharma, Deepak Kumar [2 ]
Woungang, Isaac [3 ]
Saini, Aakanksha [1 ]
机构
[1] Univ Delhi, Netaji Subas Inst Technol, Div Informat Technol, CAITFS, New Delhi, India
[2] Univ Delhi, Netaji Subas Inst Technol, Div Comp Engn, New Delhi, India
[3] Ryerson Univ, Dept Comp Sci, Toronto, ON, Canada
关键词
Opportunistic networks; Infrastructure-less protocols; Delay tolerant networks; The ONE simulator;
D O I
10.1007/s11227-014-1243-5
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Opportunistic network (OppNet) is the recent evolution of mobile ad-hoc networks that has emerged as an active research subject in recent times. High mobility, frequent disconnections, sparse connectivity, no infrastructure, and limited resources are considered to be norms rather than hindrances. Hence, the challenges that one is likely to face while routing in opportunistic networks are very different from those faced in traditional wireless networks. Routing being the biggest challenge in such networks leads us to propose a new history-based prediction routing (HBPR) protocol for infrastructure-less OppNets which uses the behavioral information of the nodes to make predictions about their movements in the network. This helps to find and select a better next hop for the message to be routed to the destination. It also incorporates a method for the acknowledgment of the received messages, which helps in the buffer management of the intermediate nodes. Through simulations, the performance of HBPR is compared against popular solutions such as epidemic routing and Probabilistic routing protocol using history of encounters and transitivity, using the custom human mobility model. The HBPR performs fairly well in terms of number of messages delivered, average residual energy, overhead ratio, and average latency.
引用
收藏
页码:1694 / 1711
页数:18
相关论文
共 19 条
[1]  
[Anonymous], P 7 IEEE INT C WIR O
[2]  
[Anonymous], CS200006 DUK U
[3]  
[Anonymous], OPPORTUNISTIC NETWOR
[4]  
[Anonymous], 2005, P 2005 ACM SIGCOMM W
[5]  
Boldrini C., 2007, P IEEE INT S WORLD W, P1
[6]   Analysis of branch prediction via data compression [J].
Chen, ICK ;
Coffey, JT ;
Mudge, TN .
ACM SIGPLAN NOTICES, 1996, 31 (09) :128-137
[7]   Ubiquitous Computing in Prospect: a Bibliographic Study [J].
Chen, Tsung Teng ;
Lee, Maria .
INTERNATIONAL SYMPOSIUM ON UBIQUITOUS MULTIMEDIA COMPUTING, PROCEEDINGS, 2008, :57-+
[8]   HBPR: History Based Prediction for Routing in Infrastructure-less Opportunistic Networks [J].
Dhurandher, Sanjay K. ;
Sharma, Deepak Kumar ;
Woungang, Isaac ;
Bhati, Shruti .
2013 IEEE 27TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA), 2013, :931-936
[9]  
Dhurandher SK, 2011, IEEE GLOBE WORK, P1067, DOI 10.1109/GLOCOMW.2011.6162342
[10]  
Huang CM, 2008, 2008 22ND INTERNATIONAL WORKSHOPS ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS, VOLS 1-3, P1672, DOI 10.1109/WAINA.2008.292