期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种机会网络中的消息发布/订阅算法 被引量：3

Message Publish/Subscribe Algorithm for Opportunistic Network
下载PDF
导出
摘要 分析发布/订阅系统的特性,提出一种机会网络中基于生存期的有限消息拷贝发布/订阅算法——CMCPSS,根据节点之间的通信频繁程度,自适应地调整订阅请求和响应事件拷贝数。仿真结果表明,在保证较高消息传输成功率的同时,CMCPSS算法比Epidemic算法平均减少约51%的消息转发次数,比Direct Transmission算法降低约45%的消息传输延迟,能提高消息转发效率并降低网络资源消耗。 This paper analyzes the characteristics of the Publish/Subscribe（Pub/Sub） system, proposes a novel Constrained number of Message Copy Pub/Sub Scbeme（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.
作者 蔡青松 牛建伟 刘畅
机构地区 北京工商大学计算机与信息工程学院 北京航空航天大学计算机学院
出处 《计算机工程》 CAS CSCD 北大核心 2011年第12期19-22,25,共5页 Computer Engineering
基金 国家自然科学基金资助项目(60873241) 国家自然科学基金资助重点项目(60933011) 国家"863"计划基金资助项目(2008AA01Z217)
关键词 发布/订阅 机会网络 消息路由 多副本转发 Publish/Subscribe（Pub/Sub） opportunistic network message routing multi-copy forwarding
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献8

  • 1Xiong Yongping, Sun Limin, Niu Jianwei, et al. Opportunistic Net- works[J].Journal of Software.2009, 20(1):124-137.
  • 2Eugster P, Felber P A, Guerraoui R, et al. The Many Faces of Publish/Subscribe[J]. ACM Computing Surveys, 2001, 35(2): 114-131.
  • 3Zheng Yuan, Cao Jiannong, Liu Ming, et al. Efficient Event Delivery in Publish/Subscribe Systems for Wireless Mesh Networks[C] //Proc. of WCNC’07. Hong Kong, China:[s. n.] , 2007.
  • 4张秋余,乔赞,袁占亭.基于偏好和M-Flooding的网格资源发现[J].计算机工程,2010,36(14):40-42. 被引量：2
  • 5Wischhof L, Ebner A, Rohling H. Information Dissemination in Self-organizing Intervehicle Network[J].IEEE Trans. on Intelli- gent Transportation Systems.2005, 6(1):90-101.
  • 6Broch J, Maltz D A, Johnson D B, et al. A Performance Compa- rison of Multi-hop Wireless Ad Hoc Network Routing Protocols[C] //Proc. of MobiCom’98. Dallas, Texas, USA:[s. n.] , 1998.
  • 7Costa P, Mascolo C, Musolesi M, et al. Socially-aware Routing for Publish-subscribe in Delay-tolerant Mobile Ad Hoc Networks[J].IEEE Journal on Selected Areas in Communications.2008, 26(5):748-760.
  • 8Spyropoulos T, Psounis K, Raghavendra C S. Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks[C] //Proc. of ACM SIGCOMM Workshop on Delay- tolerant Networking. Philadelphia, Pennsylvania, USA: ACM Press, 2005.

二级参考文献5

  • 1苏金树,张博锋,徐昕.基于机器学习的文本分类技术研究进展[J].软件学报,2006,17(9):1848-1859. 被引量：383
  • 2张玉芳,彭时名,吕佳.基于文本分类TFIDF方法的改进与应用[J].计算机工程,2006,32(19):76-78. 被引量：120
  • 3Gong Yili,Li Wei,Sun Yuzhong,et al.A C/S and P2P Hybrid Resource Discovery Framework in Grid Environments[C] //Proc.of International Conference on Parallel Processing.Washington D.C.,USA:IEEE Computer Society,2005.
  • 4Adamic L A,Lukose R M,Puniyani A R,et al.Search in Power-law Networks[J].Physical Review,2001,64(4):719-720.
  • 5Ren Yi,Sha Caofeng,Qian Weining,et al.Explore the "Small World Phenomena" in Pure P2P Information Sharing Systems[C] //Proc.of the 3rd Int'l Symp.on Cluster Computing and the Grid.Washington D.C.,USA:IEEE Computer Society,2003.

共引文献1

同被引文献28

  • 1Ahlswede R,Cai Ning.Network Information Flow[J].IEEE Trans.on Information Theory,2000,46(4):1204-1216.
  • 2Li S Y R,Yeung R W,Cai Ning.Linear Network Coding[J].IEEETrans.on Information Theory,2003,49(2):371-381.
  • 3Cai Ning,Yeung R W.Secure Network Coding[C]//Proc.ofISIT’02.Lausanne,Switzerland:IEEE Press,2002.
  • 4Bhattad K,Narayanan K R.Weakly Secure Network Coding[EB/OL].(2007-05-22).http://netcod.org/papers/06Bhattad N-final.pdf.
  • 5周亚军,李晖,马建峰.防污染和防窃听的网络编码[D].西安:西安电子科技大学,2009.
  • 6Langberg M,Sprintson A,Bruck J.The Encoding Complexity ofNetwork Coding[J].IEEE Trans.on Information Theory,2006,52(6):2386-2397.
  • 7Bhattad K,Kotter R.Minimal Network Coding for Multicast[C]//Proc.of ISIT’05.Adelaide,Australia:IEEE Press,2005.
  • 8Kim M,Medard M.Evolutionary Approaches to MinimizingNetwork Coding Resources[C]//Proc.of INFOCOM’07.[S.l.]:IEEE Press,2007.
  • 9Ma Guanjun,Xu Yinlong,Lin Minghong,et al.A ContentDistribution System Based on Sparse Linear Network Coding[C]//Proc.of NetCOD’07.San Diego,USA:[s.n.],2007.
  • 10Cai Ning,Yeung R W.Network Coding and Error Correction[C]//Proc.of ITW’02.Bangalore,India:IEEE Press,2002.

引证文献3

二级引证文献11

计算机工程
2011年 第12期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部