A MULTI-SCHEME ADAPTIVE ROUTING ALGORTHM BASED ON SPRAY AND WAIT FOR DALAY TOLERANT NETWORKS

被引:1
作者
Li, Jianbo [1 ]
Jiang, Shan [1 ]
Song, Youmei [1 ]
Xu, Jixing [1 ]
Wang, Yan [1 ]
机构
[1] Qingdao Univ, Informat Engn Coll, Qingdao 266071, Peoples R China
来源
INTERNATIONAL JOURNAL ON SMART SENSING AND INTELLIGENT SYSTEMS | 2015年 / 8卷 / 04期
基金
中国国家自然科学基金;
关键词
Delay Tolerant Networks; routing algorithm; Spray and Wait algorithm; PROPHET; similarity;
D O I
10.21307/ijssis-2017-846
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Delay tolerant networks (DTNs) are a type of emerging mobile wireless network that experience long delays, intermittent disruption, buffer space and energy limitations, node irregularities and frequent mobility. To this end, many protocols take advantage of the flooding mechanism to increase the probability of successful message transmission. However, sending too many copies of each message may result in large network overhead and communication cost. Based on the Spray and Wait (S&W) algorithm, we propose an improved Adaptive Spray and Wait scheme, named ASW, for different delay tolerant network scenes. In this paper, we define a hybrid utility metric combined with multiple variables, delivery probability and similarity. Then, we distribute message copies in accordance with the proportion of the utility value to optimize the delivery ratio. Extensive simulations have been conducted to verify the efficiency of our proposed algorithm. In addition to the comparison, the results also show that our proposed algorithm achieves a better performance in terms of the delivery ratio and average latency than the other three protocols.
引用
收藏
页码:2136 / 2158
页数:23
相关论文
共 50 条
  • [41] Adaptive Forwarding Scheme for Bounded Time Constraint in Delay Tolerant Networks
    Ali Abbas
    Babar Shah
    Ki-Il Kim
    Wireless Personal Communications, 2017, 96 : 1803 - 1817
  • [42] Secure Multi-copy Routing in Compromised Delay Tolerant Networks
    Bulut, Eyuphan
    Szymanski, Boeslaw K.
    WIRELESS PERSONAL COMMUNICATIONS, 2013, 73 (01) : 149 - 168
  • [43] Probabilistic Routing based on History of Messages in Delay Tolerant Networks
    Lee, Feng Cheng
    Yeo, Chai Kiat
    2011 IEEE VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL), 2011,
  • [44] A Routing Framework for Delay Tolerant Networks Based on Encounter Angle
    Cao, Yue
    Cruickshank, Haitham
    Sun, Zhili
    2011 7TH INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC), 2011, : 2231 - 2236
  • [45] A new fault-tolerant routing scheme for 2-dimesnsioal mesh networks
    Wang, GC
    Chen, JN
    PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PDCAT'2003, PROCEEDINGS, 2003, : 95 - 98
  • [46] Geographic Information and Node Selfish-Based Routing Algorithm for Delay Tolerant Networks
    Fang Lu
    Jianbo Li
    Shan Jiang
    Youmei Song
    Fushu Wang
    TsinghuaScienceandTechnology, 2017, 22 (03) : 243 - 253
  • [47] Geographic Information and Node Selfish-Based Routing Algorithm for Delay Tolerant Networks
    Lu, Fang
    Li, Jianbo
    Jiang, Shan
    Song, Youmei
    Wang, Fushu
    TSINGHUA SCIENCE AND TECHNOLOGY, 2017, 22 (03) : 243 - 253
  • [48] Multi-hop routing under short contact in delay tolerant networks
    Le, Tuan
    COMPUTER COMMUNICATIONS, 2021, 165 : 1 - 8
  • [49] An Adaptive Delay-Tolerant Routing Algorithm for Data Transmission in Opportunistic Social Networks
    Chen, Shupei
    Chen, Zhigang
    Wu, Jia
    Liu, Kanghuai
    ELECTRONICS, 2020, 9 (11) : 1 - 27
  • [50] An optimization model for fragmentation-based routing in delay tolerant networks
    Xuyan BAO
    Yong ZHANG
    Da GUO
    Mei SONG
    ScienceChina(InformationSciences), 2016, 59 (02) : 185 - 200