EpSoc: Social-Based Epidemic-Based Routing Protocol in Opportunistic Mobile Social Network

被引:37
作者
Lenando, Halikul [1 ]
Alrfaay, Mohamad [2 ]
机构
[1] Univ Malaysia Sarawak, Fac Comp Sci & Informat Technol, Kota Samarahan, Malaysia
[2] Jouf Univ, Fac Comp & Informat Sci, Jouf, Saudi Arabia
关键词
DELAY;
D O I
10.1155/2018/6462826
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In opportunistic networks, the nature of intermittent and disruptive connections degrades the efficiency of routing. Epidemic routing protocol is used as a benchmark for most of routing protocols in opportunistic mobile social networks (OMSNs) due to its high message delivery and latency. However, Epidemic incurs high cost in terms of overhead and hop count. In this paper, we propose a hybrid routing protocol called EpSoc which utilizes the Epidemic routing forwarding strategy and exploits an important social feature, that is, degree centrality. Two techniques are used in EpSoc. Messages' TTL is adjusted based on the degree centrality of nodes, and the message blocking mechanism is used to control replication. Simulation results show that EpSoc increases the delivery ratio and decreases the overhead ratio, the average latency, and the hop counts as compared to Epidemic and Bubble Rap.
引用
收藏
页数:8
相关论文
共 38 条
  • [1] Routing Protocols in Opportunistic Networks - A Survey
    Alajeely, Majeed
    Doss, Robin
    Ahmad, Asma'a
    [J]. IETE TECHNICAL REVIEW, 2018, 35 (04) : 369 - 387
  • [2] [Anonymous], 2004, PROBABILISTIC ROUTIN
  • [3] Store-Carry-Cooperative Forward Routing with Information Epidemics Control for Data Delivery in Opportunistic Networks
    Aung, Cherry Ye
    Ho, Ivan Wang-Hei
    Chong, Peter Han Joo
    [J]. IEEE ACCESS, 2017, 5 : 6608 - 6625
  • [4] Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution
    Boldrini, Chiara
    Conti, Marco
    Passarella, Andrea
    [J]. PERVASIVE AND MOBILE COMPUTING, 2008, 4 (05) : 633 - 657
  • [5] Cost-Effective Multiperiod Spraying for Routing in Delay-Tolerant Networks
    Bulut, Eyuphan
    Wang, Zijian
    Szymanski, Boleslaw Karol
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2010, 18 (05) : 1530 - 1543
  • [6] Chaintreau Augustin, 2007, P 3 INT C EM NETW EX, P12, DOI [DOI 10.1145/1364654.1364670, 10.1145/ 1364654.1364670]
  • [7] Contact expectation based routing for delay tolerant networks
    Chen, Honglong
    Lou, Wei
    [J]. AD HOC NETWORKS, 2016, 36 : 244 - 257
  • [8] Optimal Control of Epidemic Information Dissemination Over Networks
    Chen, Pin-Yu
    Cheng, Shin-Ming
    Chen, Kwang-Cheng
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (12) : 2316 - 2328
  • [9] SPRINT-SELF: Social-Based Routing and Selfish Node Detection in Opportunistic Networks
    Ciobanu, Radu Ioan
    Dobre, Ciprian
    Cristea, Valentin
    Pop, Florin
    Xhafa, Fatos
    [J]. MOBILE INFORMATION SYSTEMS, 2015, 2015
  • [10] From Opportunistic Networks to Opportunistic Computing
    Conti, Marco
    Giordano, Silvia
    May, Martin
    Passarella, Andrea
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2010, 48 (09) : 126 - 139