• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Jiang Haitao, Li Qianmu, Xu Jian, and Zhang Hong. Cross-Regional Ferry Routing Design for Multiple Messengers in Opportunistic Networks[J]. Journal of Computer Research and Development, 2012, 49(4): 700-709.
Citation: Jiang Haitao, Li Qianmu, Xu Jian, and Zhang Hong. Cross-Regional Ferry Routing Design for Multiple Messengers in Opportunistic Networks[J]. Journal of Computer Research and Development, 2012, 49(4): 700-709.

Cross-Regional Ferry Routing Design for Multiple Messengers in Opportunistic Networks

More Information
  • Published Date: April 14, 2012
  • Opportunistic networks are wireless networks where most of the time there does not exist a complete path between source and destination due to various reasons such as node mobility, wide deployment area, limited radio power, etc. The messages can be forwarded in asynchronous manners, which relies on the contacts between nodes and infrastructures. Ferry routing is an approach which utilizes a set of special mobile infrastructures called messenger to provide communication services for the nodes in opportunistic networks. According to the shortcoming of messengers scheduling and collaboration in traditional ferry routing, a cross-regional multiple messengers scheduling method is proposed in the paper. The network is divided into several horizontal and vertical regions, and each region contains a messenger who provides service for nodes. Messages are forwarded through a single messenger or the collaboration between a horizontal and a vertical messenger. Theoretic analysis of the proposed method at the expected delay is described. The improvement of delay and fault tolerance are also given. Simulation results show that the cross-regional ferry routing not only balances the network load and delay, but also has the capability of tolerancing single messenger fault, and it is a kind of reasonable and efficient multiple messengers scheduling method.
  • Related Articles

    [1]Li Mingyue, Luo Xiangyang, Chai Lixiang, Yuan Fuxiang, GanYong. City-Level IP Geolocation Method Based on Network Node Clustering[J]. Journal of Computer Research and Development, 2019, 56(3): 467-479. DOI: 10.7544/issn1000-1239.2019.20170473
    [2]Wang Changda, Huang Lei, Liu Zhifeng. Information Hiding Algorithm of IP Covert Timing Channels and Its Performance Analysis[J]. Journal of Computer Research and Development, 2016, 53(5): 988-999. DOI: 10.7544/issn1000-1239.2016.20150063
    [3]Wang Zhiwei and Zhang Wei. ID Based Signature Scheme from Strong RSA Assumption in the Standard Model[J]. Journal of Computer Research and Development, 2013, 50(2): 302-306.
    [4]Gao Haiying. Provable Secure ID-Based Authenticated Key Agreement Protocol[J]. Journal of Computer Research and Development, 2012, 49(8): 1685-1689.
    [5]Zhou Yousheng, Sun Yanbin, Qing Sihan, Yang Yixian. An Efficient ID-Based Verifiably Encrypted Signature Scheme[J]. Journal of Computer Research and Development, 2011, 48(8): 1350-1356.
    [6]Lai Xin, Huang Xiaofang, He Dake. An ID-Based Efficient Signcryption Key Encapsulation Scheme[J]. Journal of Computer Research and Development, 2009, 46(5): 857-863.
    [7]Zhou Ling, Sun Yamin. Research on Multicast Routing Algorithm for Mobile IP Based on Bone Node Set[J]. Journal of Computer Research and Development, 2008, 45(7): 1126-1132.
    [8]Wang Li, Xu Mingwei, and Xu Ke. On the Deployment Approach of IPSec and IP Filter in Routers[J]. Journal of Computer Research and Development, 2006, 43(3): 375-380.
    [9]Qu Haipeng, Li Dequan, Su Purui, Feng Dengguo. An IP Traceback Scheme with Packet Marking in Blocks[J]. Journal of Computer Research and Development, 2005, 42(12): 2084-2092.
    [10]Wu Yichuan, Huang Kui, Zheng Jianping, Sun Limin, and Cheng Weiming. An Adaptive Robust TCP/IP Header Compression Algorithm[J]. Journal of Computer Research and Development, 2005, 42(4): 655-661.

Catalog

    Article views (583) PDF downloads (434) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return