HBPR: History Based Prediction for Routing in Infrastructure-less Opportunistic Networks

被引:67
作者
Dhurandher, Sanjay K. [1 ]
Sharma, Deepak Kumar
Woungang, Isaac
Bhati, Shruti [1 ]
机构
[1] Univ Delhi, CAITFS, Div Informat Technol, Netaji Subas Inst Technol, New Delhi, India
来源
2013 IEEE 27TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA) | 2013年
关键词
Opportunistic network (Oppnets); Opportunistic routing; The ONE (Opportunistic Network) simulator;
D O I
10.1109/AINA.2013.105
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In Opportunistic Networks (OppNets), the existence of an end-to-end connected path between the sender and the receiver is not possible. Thus routing in this type of networks is different from the traditional Mobile Ad hoc Networks (MANETs). MANETs assume the existence of a fixed route between the sender and the receiver before the start of the communication and till its completion. Routes are constructed dynamically as the source node or an intermediate node can choose any node as next hop from a group of neighbors assuming that it will take the message closer to the destination node or deliver to the destination itself. In this paper, we proposed a novel History Based Prediction Routing (HBPR) protocol for infrastructure-less OppNets which utilizes the behavioral information of the nodes to find the best next node for routing. The proposed protocol was compared with the Epidemic routing protocol. Through simulations it was found that the HBPR performs better in terms of number of messages delivered and the overhead ratio than the Epidemic protocol.
引用
收藏
页码:931 / 936
页数:6
相关论文
共 19 条
[1]  
[Anonymous], 2006, CHALLENGES PRIVACY S
[2]  
[Anonymous], 2000, HDB SYSTEMIC AUTOIMM
[3]  
Boldrini C, 2007, I S WORLD WIREL MOBI, P78
[4]  
Bose P., 1999, PROC 3 INT WORKSHOP, P48
[5]   Analysis of branch prediction via data compression [J].
Chen, ICK ;
Coffey, JT ;
Mudge, TN .
ACM SIGPLAN NOTICES, 1996, 31 (09) :128-137
[6]  
Dhurandher SK, 2011, IEEE GLOBE WORK, P1067, DOI 10.1109/GLOCOMW.2011.6162342
[7]  
Fall K, 2003, ACM SIGCOMM COMP COM, V33, P27
[8]   Routing in a delay tolerant network [J].
Jain, S ;
Fall, K ;
Patra, R .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (04) :145-157
[9]  
Jie Gao, 2001, MOBIHOC 2001. Proceedings of the 2001 ACM International Symposium on Mobile Ad Hoc Networking and Computing, P45
[10]  
Keranen A., 2008, OPPORTUNISTIC NETWOR