An Efficient Routing Scheme Based on Node Attributes for Opportunistic Networks in Oceans

被引:8
|
作者
Ge, Lige [1 ]
Jiang, Shengming [1 ]
机构
[1] Shanghai Maritime Univ, Coll Informat Engn, Shanghai 201306, Peoples R China
关键词
opportunistic networks; node attributes; delivery competency; forwarding willingness; MOBILITY;
D O I
10.3390/e24050607
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Along with the fast development of the marine economy and ever-increasing human activities, handy and reliable marine networking services are increasingly required in recent years. The ocean faces challenges to support cost-effective communication due to its special environments. Opportunistic networks with easy deployment and self-curing capability are expected to play an important role to adapt to such dynamic networking environments. In the literature, routing schemes for opportunistic networks mainly exploit node mobility and local relaying technologies. They did not take into account the impact of node behaviors on encountering opportunities and in case of no further relaying, network performance would be greatly degraded. To solve the problem, we propose an efficient routing scheme based on node attributes for opportunistic networks. We first construct delivery competency to predict the further relay nodes. Then a forwarding willingness mechanism is introduced to evaluate the relaying probability combining device capacity and movement behaviors of nodes. Finally, the utility metric is used to make decisions on message forwarding. The results show that the proposed scheme improves network performance in terms of delivery ratio, average latency, and overhead ratio as compared to other schemes.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] An efficient probabilistic routing scheme based on game theory in opportunistic networks
    Qin, Xueyang
    Wang, Xiaoming
    Wang, Liang
    Lin, Yaguang
    Wang, Xinyan
    COMPUTER NETWORKS, 2019, 149 : 144 - 153
  • [2] An energy-efficient history-based routing scheme for opportunistic networks
    Dhurandher, Sanjay K.
    Sharma, Deepak Kumar
    Woungang, Isaac
    Saini, Aakanksha
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2017, 30 (07)
  • [3] LOOP: A Location Based Routing Scheme For Opportunistic Networks
    Lu, Shanshan
    Liu, Yanliang
    Liu, Yonghe
    Kumar, Mohan
    9TH IEEE INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR SYSTEMS (MASS 2012), 2012, : 118 - 126
  • [4] Replication Probability-based Routing Scheme for Opportunistic Networks
    Sati, Salem
    Ippisch, Andre
    Graffi, Kalman
    2017 INTERNATIONAL CONFERENCE ON NETWORKED SYSTEMS (NETSYS), 2017,
  • [5] An Efficient Routing Algorithm for Opportunistic Networks based on Network Coding
    Yao, Yukun
    Liu, Zhihu
    Ren, Zhi
    Wen, Yadi
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION APPLICATIONS (ICCIA 2012), 2012, : 197 - 200
  • [6] Node Density-based Adaptive Spray and Focus Routing in Opportunistic Networks
    Liu, Yao
    Wang, Jianxin
    Zhou, Hongjing
    Huang, Jiawei
    2013 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS & 2013 IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (HPCC_EUC), 2013, : 1323 - 1328
  • [7] ESTABLISHING RELIABILITY FOR EFFICIENT ROUTING IN OPPORTUNISTIC NETWORKS
    Sharma, Deepak Kumar
    Kukreja, Deepika
    SCALABLE COMPUTING-PRACTICE AND EXPERIENCE, 2019, 20 (01): : 27 - 40
  • [8] Node residual energy balanced routing mechanism for opportunistic networks
    Yang, Peng
    Liu, Dou
    Wang, Ru-Yan
    Yan, Jun-Jie
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2015, 37 (08): : 1894 - 1901
  • [9] Identifying influential nodes for efficient routing in opportunistic networks
    Gao, Zhenxiang
    Shi, Yan
    Chen, Shanzhi
    Journal of Communications, 2015, 10 (01): : 48 - 54
  • [10] Energy based incentive scheme for secure opportunistic routing in vehicular delay tolerant networks
    Lalit Kulkarni
    Jagdish Bakal
    Urmila Shrawankar
    Computing, 2020, 102 : 201 - 219