• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Xu Jia, Li Qianmu, Zhang Hong, Liu Fengyu. Performance Evaluation of Adaptive Spray Routing for Opportunistic Networks[J]. Journal of Computer Research and Development, 2010, 47(9): 1622-1632.
Citation: Xu Jia, Li Qianmu, Zhang Hong, Liu Fengyu. Performance Evaluation of Adaptive Spray Routing for Opportunistic Networks[J]. Journal of Computer Research and Development, 2010, 47(9): 1622-1632.

Performance Evaluation of Adaptive Spray Routing for Opportunistic Networks

More Information
  • Published Date: September 14, 2010
  • Opportunistic networks are sparse wireless networks where most of the time there does not exist complete path from the source to the destination. The messages can be forwarded to destination ultimately in the manner of asynchronous transmission which relies on the contact opportunities between nodes in opportunistic networks. This characteristics of opportunistic networks can greatly extend the space-time metric of information collection and processing. Although opportunistic network often shows large delay, it doesnt mean that it is not necessary to implement quality assurance. For examples, electronic notice in campus networks and short-term weather information in large national parks must be forwarded with specific delay. On the other hand, as the access networks, configuration and forecast for QoS are also necessary in order to provide acceptable service (such as e-mail) in opportunistic networks. Hence opportunistic networks must provide acceptable and resilient service in the face of challenging environments. According to the shortcoming of traditional spray routing in dynamic opportunistic networks, a class of adaptive spray mechanisms are proposed in this paper. Adaptive spray mechanisms use relay nodes to make spray decisions in order to apperceive and react to the change of network conditions exquisitely, and are least-cost delay-bounded routing protocols under specific spray mechanisms. Theoretic analysis of adaptive spray routing at aspects of routing cost, copy redundancy and expected delay are also given. Simulation results show that adaptive spray mechanisms show prominent superiority in routing cost, adaptability and expansibility, and are a class of correct and efficient delay-bounded opportunistic networks routing mechanisms.
  • Related Articles

    [1]Wei Jia, Zhang Xingjun, Wang Longxiang, Zhao Mingqiang, Dong Xiaoshe. MC2 Energy Consumption Model for Massively Distributed Data Parallel Training of Deep Neural Network[J]. Journal of Computer Research and Development, 2024, 61(12): 2985-3004. DOI: 10.7544/issn1000-1239.202330164
    [2]Yang Zhenkun, Yang Chuanhui, Han Fusheng, Wang Guoping, Yang Zhifeng, Cheng Xiaojun. Architecture and Technology of OceanBase Distributed Relational Database[J]. Journal of Computer Research and Development, 2024, 61(3): 540-554. DOI: 10.7544/issn1000-1239.202330835
    [3]Xu Ke, Li Yanbiao, Xie Gaogang, Zhang Dafang. Efficient Name Lookup Method Based on Hybrid Counting Bloom Filters[J]. Journal of Computer Research and Development, 2023, 60(5): 1136-1150. DOI: 10.7544/issn1000-1239.202111242
    [4]Xu Kunhao, Nie Tiezheng, Shen Derong, Kou Yue, Yu Ge. Parallel String Similarity Join Approach Based on CPU-GPU Heterogeneous Architecture[J]. Journal of Computer Research and Development, 2021, 58(3): 598-608. DOI: 10.7544/issn1000-1239.2021.20190567
    [5]Lu Le, Sun Yu’e, Huang He, Wang Runzhi, Cao Zhen. Detection of Persistent Elements in Distributed Monitoring System[J]. Journal of Computer Research and Development, 2020, 57(5): 1046-1056. DOI: 10.7544/issn1000-1239.2020.20190287
    [6]Cui Xingcan, Yu Xiaohui, Liu Yang, Lü Zhaoyang. Distributed Stream Processing: A Survey[J]. Journal of Computer Research and Development, 2015, 52(2): 318-332. DOI: 10.7544/issn1000-1239.2015.20140268
    [7]Zheng Liping, Chan Bin, Wang Wenping, Liu Xiaoping, Cao Li, Kuang Zhengzheng. Remote Visualization Based on Distributed Rendering Framework[J]. Journal of Computer Research and Development, 2012, 49(7): 1438-1449.
    [8]Jiang Guiyuan, Zhang Guiling, and Zhang Dakun. A Distributed Parallel Algorithm for SIFT Feature Extraction[J]. Journal of Computer Research and Development, 2012, 49(5): 1130-1141.
    [9]Hu Kongfa, Chen Ling, Zhao Maoxian, Da Qingli, Ji Zhaohui. DHMC:An Improved Parallel & Distributed Storage Structure for High-Dimensional Cube[J]. Journal of Computer Research and Development, 2007, 44(12): 2098-2105.
    [10]Jia Xiaolin, Qin Zheng, He Jian, and Yu Fan. A Distributed Software Architecture Description Language Based on Attributed Grammar[J]. Journal of Computer Research and Development, 2006, 43(1): 54-60.

Catalog

    Article views (641) PDF downloads (503) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return