Analysis of routing and forwarding protocols in opportunistic networks

被引:5
作者
Prabha, Chander [1 ]
Kumar, Surender [2 ]
Khanna, Ravinder [3 ]
机构
[1] MM Univ, Comp Sci & Engn, Ambala 134007, India
[2] GTB Coll, Comp Applicat, Sangrur 148026, India
[3] MM Univ, Elect & Commun Engn, Ambala 134007, India
来源
INTERNATIONAL CONFERENCE ON COMPUTATIONAL MODELLING AND SECURITY (CMS 2016) | 2016年 / 85卷
关键词
Opportunistic networks; HiBop; Propicman; CAOR; Delivery Probability; Forwarding;
D O I
10.1016/j.procs.2016.05.279
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The role of opportunistic networks can be crucial in data transmission. Here message forwarding depends solely on node cooperation. Opportunistic networks use store-and-carry forward mechanism. The frequent disconnection of nodes is very common in these networks because of dynamic nature of mobile nodes. Therefore use of suitable routing protocol is very important in message delivery. In this paper, three social context aware routing protocols that support message forwarding in opportunistic networks i.e. HiBop, Propicman and CAOR are analysed in terms of performance metrics viz. delivery probability, overhead ratio, number of hops and delay. The results show that CAOR outperform the other two protocols in all these aspects. The delivery probability of CAOR is higher whereas the overhead ratio, number of hops and delay are less than those for HiBop and Propicman routing protocols. (C) 2015 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license
引用
收藏
页码:891 / 898
页数:8
相关论文
共 13 条
[1]   Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution [J].
Boldrini, Chiara ;
Conti, Marco ;
Passarella, Andrea .
PERVASIVE AND MOBILE COMPUTING, 2008, 4 (05) :633-657
[2]   Security inopportunistic networks [J].
Chen Xi ;
Tian Youliang ;
Li Guangsong ;
Ma Jianfeng .
2012 INTERNATIONAL CONFERENCE ON INDUSTRIAL CONTROL AND ELECTRONICS ENGINEERING (ICICEE), 2012, :2006-2009
[3]   OPPORTUNITIES IN OPPORTUNISTIC COMPUTING [J].
Conti, Marco ;
Kumar, Mohan .
COMPUTER, 2010, 43 (01) :42-50
[4]  
Frederic, 2008, USE NET DISCUSSION S, P1678
[5]  
Giodano Silvia, 2007, P 1 ACM WORKSH SANET
[6]  
Giordano Silvia, 2007, IEEE INT S WOWMOM JU, P1
[7]  
Liu Li, 2012, IEEE 12 INT C CIT, P635
[8]   A comprehensive-integrated buffer management strategy for opportunistic networks [J].
Pan, Daru ;
Ruan, Zhaohua ;
Zhou, Nian ;
Liu, Xiong ;
Song, Zhaohui .
EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2013,
[9]  
Prabha C., 2014, IOSR J. Comput. Eng, V16, P54, DOI [10.9790/0661-16265462, DOI 10.9790/0661-16265462]
[10]   Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication [J].
Schurgot, Mary R. ;
Comaniciu, Cristina ;
Jaffres-Runser, Katia .
IEEE COMMUNICATIONS MAGAZINE, 2012, 50 (07) :155-162