计算机工程 ›› 2011, Vol. 37 ›› Issue (12): 19-22.doi: 10.3969/j.issn.1000-3428.2011.12.007

• 博士论文 • 上一篇    下一篇

一种机会网络中的消息发布/订阅算法

蔡青松 1,2,牛建伟 2,刘 畅 2   

  1. (1. 北京工商大学计算机与信息工程学院,北京 100037;2. 北京航空航天大学计算机学院,北京 100191)
  • 收稿日期:2010-11-06 出版日期:2011-06-20 发布日期:2011-06-20
  • 作者简介:蔡青松(1973-),男,讲师、博士,主研方向:移动与分布计算,多媒体计算,传感器网络;牛建伟,副教授;刘 畅,硕士研究生
  • 基金项目:

    国家自然科学基金资助项目(60873241);国家自然科学 基金资助重点项目(60933011);国家“863”计划基金资助项目(2008 AA01Z217)

Message Publish/Subscribe Algorithm for Opportunistic Network

CAI Qing-song 1,2, NIU Jian-wei 2, LIU Chang 2   

  1. (1. School of Computer Science and Information Engineering, Beijing Technology and Business University, Beijing 100037, China; 2. School of Computer Science and Engineering, Beihang University, Beijing 100191, China)
  • Received:2010-11-06 Online:2011-06-20 Published:2011-06-20

摘要:

分析发布/订阅系统的特性,提出一种机会网络中基于生存期的有限消息拷贝发布/订阅算法——CMCPSS,根据节点之间的通信频繁程度,自适应地调整订阅请求和响应事件拷贝数。仿真结果表明,在保证较高消息传输成功率的同时,CMCPSS算法比Epidemic算法平均减少约51%的消息转发次数,比Direct Transmission算法降低约45%的消息传输延迟,能提高消息转发效率并降低网络资源消耗。

关键词: 发布/订阅, 机会网络, 消息路由, 多副本转发

Abstract:

This paper analyzes the characteristics of the Publish/Subscribe(Pub/Sub) system, proposes a novel Constrained number of Message Copy Pub/Sub Scheme(CMCPSS) algorithm for opportunistic networks, which can calculate the copy number of subscribe request and the response event according to the communication frequency between different nodes adaptively. Simulation results show that CMCPSS can balance well the tradeoff between the delivery ratio and network resource consumption in intermittently connected networks. CMCPSS can reduce 51% transmission times when compares with Epidemic algorithm and can reduce 45% message transmission delay when compares with Direct Transmission algorithm.

Key words: Publish/Subscribe(Pub/Sub), opportunistic network, message routing, multi-copy forwarding

中图分类号: