FAN Xiumei, WANG Chao, ZHANG Jing. Context-Based Adaptive Routing in Opportunistic Network[J]. Chinese Journal of Electronics, 2013, 22(1): 173-176.
Citation: FAN Xiumei, WANG Chao, ZHANG Jing. Context-Based Adaptive Routing in Opportunistic Network[J]. Chinese Journal of Electronics, 2013, 22(1): 173-176.

Context-Based Adaptive Routing in Opportunistic Network

Funds:  This work is supported by the National Natural Science Foundation of China (No.61272509), the Projects of Major International (Regional) Joint Research Program NSFC (No.61120106010), and Program for New Century Excellent Talents in University (No.NCET-07-0074).
  • Received Date: 2011-12-01
  • Rev Recd Date: 2012-01-01
  • Publish Date: 2013-01-05
  • This paper proposes a novel routing algorithm for opportunistic networks: Context-based adaptive routing (CBAR) that uses network context information and Dempster-Shafer (D-S) evidence theory to calculate a node’s basic reliability assignment function, which describes the reliability of the node’s credibility, incredibility and unknown credibility. As message distributes, the context will determine whether the node is credible or not, then CBAR selects the node with higher value of reliability regarding to its credibility to forward the message, otherwise, floods the message so that better robustness and delivery probability can be achieved. We used Opportunistic network environment simulator (ONE) to simulate and compare the performance of CBAR algorithm with existing routing algorithms which shows that CBAR has better performance in terms of delivery ratio, average latency, and overhead ratio.
  • loading
  • L. Pelusi, A. Passarella, M. Conti, “Beyond MANETs: Dissertationon opportunistic networking”, http://bruno1.iit.cnr.it/~bruno/techreport.html, 2006.
    H. Pan, A. Chaintreau, J. Scott, “Pocket switched networks:Real world mobility and its consequences for opportunistic forwarding”,UCAM-CL-TR-617, University of Cambridge, 2005.
    P. Juang, H. Oki, Y. Wang, “Energy-efficient computing forwildlife tracking: Design tradeoffs and early experiences withZebraNet”, ACM SIGPLAN Notices, Vol.37, pp.96-107, 2002.
    Z.D. Chen, H.T. Kung, D. Vlah, “Ad hoc relay wireless networksover moving vehicles on highways”, Proceeding of Mobihoc,pp.247-250, 2001.
    Y.P. Xiong, L.M. Sun, J.W. Niu, “Opportunistic network”,Journal of Software, Vol.20, No.1, pp.124-137, 2009.
    C.H. Huang, K.C. Lan, C.Z. Tsai, “A survey of opportunisticnetworks”, Proceedings of the 22nd International Conference onAdvanced Information Networking and Applications, Ginowan,pp.1672-1677, 2005.
    V. Cerf, S. Burleith, A. Hooke, “Interplanetary Internet(IPN): Architectural Definition”, https://www.cs.tcd.ie/Stephen.Farrell/ipn/background/draft-irtf-ipnrg-arch-00.txt, 2001.
    F. Warthman, “Delay-tolerant Networks (DTNs)-A tutorialv1.1”, http://www.dtnrg.org/docs/tutorials/warthman-1.1.pdf.
    J. Karvo, J. Ott, “Time scales and delay-tolerant routing protocols”,International Conference on Mobile Computing andNetworking, Proceedings of the third ACM Workshop on ChallengedNetworks, San Francisco, California, USA, pp.33-40,2008.
    P. Costa, C. Mascolo, M. Musolesi, G.P. Picco, “Socially-awarerouting for publish-subscribe in delay-tolerant mobile ad-hocnetworks”, IEEE Journal of Selected Areas in Communication,Vol.26, No.5, pp.748-760, 2008.
    Fan Xiumei, Chen Hui, Asynchronous Opportunity Routingfor Delay-tolerant networks, Chinese Journal of Electronics,Vol.17, No.4, pp.698-702, Oct. 2008.
    S. Grasic, E. Davies, A. Lindgren, A. Doria, “The evolutionof a DTN routing protocol-PRoPHETv2”, Proceedings of the6th ACM Workshop on Challenged Networks, New York, USA,pp.27-30, 2011.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (582) PDF downloads(2043) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return