ADAPTIVE SPRAY ROUTING FOR OPPORTUNISTIC NETWORKS

被引:10
|
作者
Jia, Xu [1 ,2 ,3 ]
Xin, Feng [1 ]
Chuan, Wang Ru [1 ]
机构
[1] Nanjing Univ Posts & Telecommun, Coll Comp, Nanjing Zone, Jiangsu, Peoples R China
[2] Southeast Univ, Minist Educ, Key Lab Comp Network & Informat Integrat, Nanjing Zone, Jiangsu, Peoples R China
[3] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing Zone, Jiangsu, Peoples R China
来源
INTERNATIONAL JOURNAL ON SMART SENSING AND INTELLIGENT SYSTEMS | 2013年 / 6卷 / 01期
基金
中国博士后科学基金;
关键词
opportunistic networks; spray routing; delay constraint; adaptive;
D O I
10.21307/ijssis-2017-530
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
opportunistic networks are sparse wireless networks where most of the time there is no complete path from the source to the destination. Many applications require delay constrained routing mechanism which can provide acceptable and resilient service in the face of challenged environments. A class of adaptive spray mechanisms which aims to achieve the delay constraint with low cost in dynamic circumstances was proposed in this paper. Adaptive spray mechanisms use relay nodes to make spray decisions in order to apperceive the change of network conditions exquisitely. These protocols are least-cost delay-bounded routing protocols under specific spray mechanisms. Theoretic analyses of adaptive spray routings at aspects of routing cost, copy redundancy and expected delay were also given in this paper. Simulation results have shown that adaptive spray mechanisms exhibit prominent superiority in routing cost, adaptability and scalability. Adaptive spray mechanisms are a class of correct and efficient delay-bounded routings for opportunistic networks.
引用
收藏
页码:95 / 119
页数:25
相关论文
共 50 条
  • [1] Adaptive seed spray routing for opportunistic networks
    Xu, Jia
    Sun, Li-Juan
    Wang, Ru-Chuan
    Liu, Feng-Yu
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2010, 38 (10): : 2315 - 2321
  • [2] Performance evaluation of adaptive spray routing for opportunistic networks
    Xu, Jia
    Li, Qianmu
    Zhang, Hong
    Liu, Fengyu
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2010, 47 (09): : 1622 - 1632
  • [3] Delay constraint adaptive routing based on seed spray in opportunistic networks
    Xu, Jia
    Wang, Ruchuan
    Sun, Lijuan
    Journal of Computational Information Systems, 2012, 8 (12): : 5137 - 5148
  • [4] 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
  • [5] Adaptive Routing in Mobile Opportunistic Networks
    Lakkakorpi, Jani
    Pitkanen, Mikko
    Ott, Jorg
    MSWIM 2010: PROCEEDINGS OF THE 13TH ACM INTERNATIONAL CONFERENCE ON MODELING, ANALYSIS, AND SIMULATION OF WIRELESS AND MOBILE SYSTEMS, 2010, : 101 - 109
  • [6] Sharing spray and wait routing algorithm in opportunistic networks
    Derakhshanfard, Nahideh
    Sabaei, Masoud
    Rahmani, Amir Masoud
    WIRELESS NETWORKS, 2016, 22 (07) : 2403 - 2414
  • [7] Sharing spray and wait routing algorithm in opportunistic networks
    Nahideh Derakhshanfard
    Masoud Sabaei
    Amir Masoud Rahmani
    Wireless Networks, 2016, 22 : 2403 - 2414
  • [8] Spray and Forward Routing based on Meeting Prediction of Opportunistic Networks
    Wang, Li
    Wang, Chunhua
    Wang, Yanpeng
    ICFCSE 2011: 2011 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER SUPPORTED EDUCATION, VOL 1, 2011, : 539 - 542
  • [9] An Adaptive Routing Protocol with Congestion Avoidance for Opportunistic Networks
    Kathiravelu, Thabotharan
    Ranasinghe, Nalin
    14TH INTERNATIONAL CONFERENCE ON ADVANCES IN ICT FOR EMERGING REGIONS (ICTER) 2014, 2014, : 241 - 246
  • [10] Probabilistic Quota Based Adaptive Routing in Opportunistic Networks
    Prodhan, M. A. T.
    Das, R.
    Kabir, M. H.
    Shoja, G. C.
    2011 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING (PACRIM), 2011, : 149 - 154