电子学报 ›› 2016, Vol. 44 ›› Issue (11): 2607-2617.DOI: 10.3969/j.issn.0372-2112.2016.11.007

• 学术论文 • 上一篇    下一篇

机会网络中基于摆渡节点与簇节点相互协作的路由机制

刘春蕊1, 张书奎1,2, 贾俊铖1, 林政宽1   

  1. 1. 苏州大学计算机科学与技术学院, 江苏苏州 215006;
    2. 江苏省无线传感网高技术研究重点实验室 江苏南京 210003
  • 收稿日期:2015-04-23 修回日期:2015-10-13 出版日期:2016-11-25 发布日期:2016-11-25
  • 作者简介:刘春蕊,女,1987年出生于河南周口,现为苏州大学计算机科学与技术学院硕士研究生,主要研究方向为:群智感知、网络编码以及隐私保护等.E-mail:20134227012@suda.edu.cn;张书奎,男,1966年生于内蒙古,博士,教授、博士生导师,主要研究方向为物联网、无线传感器网络、信息安全、移动计算、智能信息处理等.E-mail:zhangsk@suda.edu.cn
  • 基金资助:

    国家自然科学基金(No.61201212,No.61572340);江苏省自然科学基金资助项目(No.BK2011376);江苏省“六大人才高峰”项目(No.2014-WLW-010);苏州市融合通信重点实验室(No.SKLCC2013XX);江苏省产学前瞻性项目(No.BY2012114);软件新技术与产业化协同创新中心部分资助;江苏省科技项目(No.BY2014059-02)

Routing Mechanism Based on the Cooperation of the Ferry Nodes and Cluster Nodes in Opportunistic Networks

LIU Chun-rui1, ZHANG Shu-kui1,2, JIA Jun-cheng1, LIN Cheng-kuan1   

  1. 1. School of Computer Science and Technology, Soochow University, Suzhou, Jiangsu 215006, China;
    2. Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing, Jiangsu 210003, China
  • Received:2015-04-23 Revised:2015-10-13 Online:2016-11-25 Published:2016-11-25

摘要:

机会网络是一种不需要在源节点和目的节点之间存在完整路径,利用节点移动带来的相遇机会实现网络通信的延迟容忍自组织网络,它以“存储-携带-处理-转发”的模式进行.为实现互不相交簇间的信息传输,本文设计了一种带阈值的簇移动模型CMMT,并提出了一种基于摆渡(Ferry)节点与簇节点协作的路由算法(CBSW).该算法减少了冗余的通信和存储开销,以及在Spray阶段簇节点没有遇到目的节点或摆渡节点,进入Wait阶段携带消息的节点采用直接分发方式只向目的节点传输等问题.仿真实验表明,CBSW算法能够增加传输成功率,减少网络开销和传输延迟.

关键词: 机会网络, 移动模型, 协作, 路由算法

Abstract:

Opportunistic Networks are delay tolerant self-organized networks with sparse nodes,where the message propagation depends on the cooperation of nodes to fulfill a "store-carry-process-and-forward" fashion by leveraging the mobility of nodes,because there does not exist a complete path from the source to the destination in the most time.To achieve the communication of nodes in mutually disjoint clusters,we propose a Cluster Movement Model with Threshold (CMMT) and routing algorithm (CBSW),which is Cooperative Binary Spray and Wait routing algorithm based on the Ferry nodes and cluster nodes cooperation.This routing algorithm reduces of the redundancy of communication and store the cost,as well as if the destination or Ferry nodes are not found in the spraying phase,nodes carrying a message copy will forward the message only to its destination in the Waiting phase nodes etc.Simulation results demonstrate the effectiveness of the proposed CBSW protocol in terms of high delivery ratio,low overhead and small average delay.

Key words: opportunistic networks, movement model, cooperation, routing algorithm

中图分类号: