Storage allocation plan for routing nodes in delay tolerant network

被引：0
|
作者：
Cong L. [1 ,2 ]
Yang H. [1 ]
Di X. [1 ,2 ,3 ]
机构：
[1] School of Computer Science and Technology, Changchun University of Science and Technology, Changchun
[2] Jilin Province Key Laboratory of Network and Information Security, Changchun
[3] Information Center, Changchun University of Science and Technology, Changchun
来源：
Ingenierie des Systemes d'Information | 2019年 / 24卷 / 01期
关键词：
Delay tolerant network (DTN); Routing algorithm; Weighted max-min fairness;
D O I：
10.18280/isi.240113
中图分类号：
学科分类号：
摘要：
During data storage and forwarding, the storage resources in the delay tolerant network (DTN) are often allocated unfairly between the routing nodes. To improve the fairness and the routing performance in the DTN, this paper puts forward an optimal storage allocation plan for routing nodes based on the weighted max-min fairness. Unlike the existing storage allocation plan, which adopts the first-come, first-served mode, the weighted max-min fairness principle can allocate data transmission opportunities fairly to the data nodes, while giving more resources to key tasks and reducing service waiting time. The simulation experiment shows that the DTN routing algorithm after the optimization of storage resources achieved better transmission success rate and mean network delay than unoptimized routing algorithm. © 2019 Lavoisier. All rights reserved.
引用
收藏
页码：89 / 94
页数：5
相关论文
共 50 条
  • [41] A Performance Comparison of Delay-Tolerant Network Routing Protocols
    Abdelkader, Tamer
    Naik, Kshirasagar
    Nayak, Amiya
    Goel, Nishith
    Srivastava, Vineet
    IEEE NETWORK, 2016, 30 (02): : 46 - 53
  • [42] Connection Time for Routing Decisions in Vehicular Delay Tolerant Network
    Ali, Adnan
    Sarwar, Nadeem
    Rafique, Hamaad
    Hussain, Imtiaz
    Khan, Faheem Nawaz
    INTELLIGENT TECHNOLOGIES AND APPLICATIONS, INTAP 2018, 2019, 932 : 679 - 690
  • [43] Analysis of routing algorithm for space delay/disruption tolerant network
    Wang, Sai
    Deng, Fuxing
    Cheng, Zijing
    Wang, Zhaojun
    Zhang, An'an
    Wu, Jing
    Wuhan Daxue Xuebao (Xinxi Kexue Ban)/Geomatics and Information Science of Wuhan University, 2015, 40 (10): : 1312 - 1316
  • [44] A comparative study on delay-tolerant network routing protocols
    Angulakshmi, M.
    Deepa, M.
    Vanitha, M.
    Mangayarkarasi, R.
    Nagarajan, I
    INTERNATIONAL JOURNAL OF INTELLIGENT UNMANNED SYSTEMS, 2021, 9 (04) : 283 - 301
  • [45] A Framework and Mathematical Modeling for the Vehicular Delay Tolerant Network Routing
    Nasir, Mostofa Kamal
    Noor, Rafidah Md.
    Iftikhar, Mohsin
    Imran, Muhammad
    Wahab, Ainuddin Wahid Abdul
    Jabbarpour, Mohammad Reza
    Khokhar, R. H.
    MOBILE INFORMATION SYSTEMS, 2016, 2016
  • [46] Architecture, an Efficient Routing, Applications, and Challenges in Delay Tolerant Network
    Godha, Preshi
    Jadon, Swati
    Patle, Anshi
    Gupta, Ishu
    Sharma, Bharti
    Singh, Ashutosh Kumar
    PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICCS), 2019, : 824 - 829
  • [47] RPRTD: Routing protocol based on remaining time to encounter nodes with destination node in delay tolerant network using artificial neural network
    Ahmad Karami
    Nahideh Derakhshanfard
    Peer-to-Peer Networking and Applications, 2020, 13 : 1406 - 1422
  • [48] Threshold based locking routing strategy for delay tolerant network
    Qaisar Ayub
    M. Soperi Mohd Zahid
    Sulma Rashid
    A. Hanan Abdullah
    Wireless Networks, 2013, 19 : 2067 - 2078
  • [49] A Survey on PROPHET Based Routing Protocol in Delay Tolerant Network
    Pathak, Sneha
    Gondaliya, Nikhil
    Raja, Nirav
    2017 INTERNATIONAL CONFERENCE ON EMERGING TRENDS & INNOVATION IN ICT (ICEI), 2017, : 110 - 115
  • [50] RPRTD: Routing protocol based on remaining time to encounter nodes with destination node in delay tolerant network using artificial neural network
    Karami, Ahmad
    Derakhshanfard, Nahideh
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2020, 13 (05) : 1406 - 1422
12345