Routing protocol based on social characteristics for opportunistic networks

被引:2
|
作者
Cheng, Gang [1 ]
Song, Mei [1 ]
Zhang, Yong [1 ]
Xing, Yi-Hai [2 ]
Bao, Xu-Yan [1 ]
机构
[1] School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
[2] Potevio Institute of Technology Company Limited, Beijing 100876, China
基金
中国国家自然科学基金;
关键词
Chain transitions - End-to-end connections - Epidemic protocols - Forwarding protocols - Improve performance - Network overhead - Opportunistic networks - Transition probabilities;
D O I
10.1016/S1005-8885(14)60270-3
中图分类号
学科分类号
摘要
Opportunistic networks are derived from delay tolerant networks, where mobile nodes have no end-to-end connections. Nodes are represented by people, which means that opportunistic networks can be regarded as social networks. Human mobility plays an important role in affecting the performance of forwarding protocols in social networks, furthermore, the trajectory of people's movements are driven by social characteristics. However, current routing protocols rely on simple mobility models, and rarely consider social characteristics. Considering two heterogeneous network models, an social opportunistic networks routing (SONR) was proposed which brings an adapted discrete Markov chain into nodes' mobility model and calculates the transition probability between successive status. Comparison was made between Spray, Wait and Epidemic protocol. Simulation show that SONR can improve performance on delivery ratio, delivery latency and network overhead, meanwhile. SONR approaches the performance of Epidemic routing. © 2014 The Journal of China Universities of Posts and Telecommunications.
引用
收藏
页码:67 / 73
相关论文
共 50 条
  • [1] Routing protocol based on social characteristics for opportunistic networks
    CHENG Gang
    SONG Mei
    ZHANG Yong
    XING Yihai
    BAO Xuyan
    The Journal of China Universities of Posts and Telecommunications, 2014, 21 (01) : 67 - 73+103
  • [2] Routing protocol based on social characteristics for opportunistic networks
    CHENG Gang
    SONG Mei
    ZHANG Yong
    XING Yi-hai
    BAO Xu-yan
    The Journal of China Universities of Posts and Telecommunications, 2014, (01) : 67 - 73
  • [3] Centrality based Congestion Controlled Routing Protocol for Social Opportunistic Networks
    Sharma, Deepak Kumar
    Dhurandher, Sanjay K.
    Gupta, Amit
    Anand, Ashray
    2016 1ST INDIA INTERNATIONAL CONFERENCE ON INFORMATION PROCESSING (IICIP), 2016,
  • [4] A social-aware routing protocol for opportunistic networks
    Kochem Vendramin, Ana Cristina
    Munaretto, Anelise
    Delgado, Myriam Regattieri
    Fonseca, Mauro
    Viana, Aline Carneiro
    EXPERT SYSTEMS WITH APPLICATIONS, 2016, 54 : 351 - 363
  • [5] Time Routing: a community based routing protocol for Opportunistic Networks
    Ma, Xuebin
    Ouyang, Zhenchao
    Bai, Jing
    Zhan, Xin
    2014 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (CIT), 2014, : 20 - 25
  • [6] TSIRP: A Temporal Social Interactions-Based Routing Protocol in Opportunistic Mobile Social Networks
    Anh Duong, Dat Van
    Kim, Dae-Young
    Yoon, Seokhoon
    IEEE ACCESS, 2021, 9 : 72712 - 72729
  • [7] HiBOp: a history based routing protocol for opportunistic networks
    Boldrini, Chiara
    Conti, Marco
    Iacopini, Iacopo
    Passarella, Andrea
    2007 IEEE INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS, VOL 1, 2007, : 78 - 89
  • [8] Integrated Routing Protocol for Opportunistic Networks
    Verma, Anshul
    Srivastava, Anurag
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2011, 2 (03) : 85 - 92
  • [9] R-SOR: Ranked Social-based Routing Protocol in Opportunistic Mobile Social Networks
    Alrfaay, Mohamad
    Ali, Aref Kurd
    Chaoui, Slim
    Lenando, Halikul
    Alanazi, Aad
    ENGINEERING TECHNOLOGY & APPLIED SCIENCE RESEARCH, 2022, 12 (01) : 7998 - 8006
  • [10] Ant Router: An efficient routing protocol for social opportunistic networks using ant routing
    Sharma, Deepak Kr.
    Singh, Swati
    Gautam, Vishakha
    Kumaram, Shubham
    Sharma, Mehul
    Pant, Shrid
    IET NETWORKS, 2020, 9 (02) : 83 - 93