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

基于社区的容迟网络路由方法 被引量：3

Community Based Routing in Delay and Tolerance Networks
下载PDF
导出
摘要 提出一种基于社区的容迟网络路由方法.通过对网络节点历史运动轨迹点聚类建立其热点活动区域,把热点区域重叠度较高的节点归为同一社区.在源节点和目的节点社区中以洪泛的方式加快消息扩算和传递速度.同时,针对热点区域准确地选择中继节点,降低了冗余消息数量.模拟结果显示,该方法能够提高消息传递数量,并且大大降低系统负载率. A new technique for community based routing in delay and tolerance networks（DTNs） is proposed.The history mobility tracks are used to establish the most visited area of DTN nodes,called home area,through clustering.The nodes whose home areas overlap most are regarded as in the same community.The delivery speed could be accelerated by flooding nodes in the source and destination communities.Furthermore,the home area facilitates the selection of intermediate nodes.Simulation results show that this method could improve the message delivery rate and achieve less overhead.
作者 周瑞涛 曹元大 胡晶晶 朱东锋
机构地区 北京理工大学计算机学院智能信息技术实验室 北京理工大学软件学院
出处 《北京理工大学学报》 EI CAS CSCD 北大核心 2012年第9期966-970,共5页 Transactions of Beijing Institute of Technology
基金 国家自然科学基金资助项目(61101214)
关键词 容迟网络(DTN) 聚类 社区 delay and tolerance networks（DTN） cluster community
分类号 TP393.03 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献10

  • 1Fall K. A delay-tolerant network architecture for challenged internets [ C] // Proceedings of ACM SIGCOMM. Karlsruhe, Germany: ACM Press, 2003:27 - 34.
  • 2Vahdat A, Becker D. Epidemic routing for partiallyconnected ad hoc networks[S]. Durhan, NC: Duke U- niversity, 2000.
  • 3Padmal M, Matthew S, Ginnah L. Epidemic routing with immunity in delay tolerant networks[C] //Proceedings of IEEE Military Communications Conference. Washington D. C., USA: IEEE Press, 2008 : 1 - 7.
  • 4Wu Yahui, Deng Su, Huang Hongbin. Performance analysis of copy-limited epidemic routing in delay tolerant networks [C] // Proceedings of ICIS 2010. Xiamen, China: IEEE Computer Society, 2010: 630 -634.
  • 5Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks[C] //Proceedings of the 1st International Workshop on Service Assurance with Partial and Intermittent Resources. Fortaleza, Brazil: [s. n. ], 2004:239 -254.
  • 6Widmer J6rg, Boudec J Le. Network coding for efficient communication in extreme networks[C] // Proceedings of ACM SIGCOMM 2005 Workshops- Conference on Computer Communications. Philadelphia, USA: ACM Press, 2005:284 - 291.
  • 7Wang Y, Sushant J, Margaretl M, et al. Erasure- coding based routing for opportunistic network[C] // Proceedings of ACM SIGCOMM 2005 Workshops: Conference on Computer Communications. Philadelphia, USA: ACM Press, 2005:229 - 236.
  • 8Chen Z, Kung H, Vlah D. Ad hoc relay wireless networks over moving vehicles on highways[C] // Proeeedings of the ACM MobiHoe; 01. Long Beach, USA: ACM Press, 2001:247-250.
  • 9Zhou R, Cao D, Jin J. Group based epidemic routing for delay and tolerant networks [C] //Proceedings of WiCOM 2010. Chengdu, China: IEEE Computer Society, 2010 : 1 - 4.
  • 10Zhao W, Ammar M, Zegura E. A message ferrying approach for data delivery in sparse mobile ad hoc networks[C]//Proceedings of the ACM MobiHoc' 01. New York, USA: ACM Press, 2004:187 -198.

同被引文献29

  • 1FALL K. A delay-tolerant network architecture for challenged Internets[A]. Proc of the ACM SIGCOMM[C]. 2003.27-34.
  • 2BURLEIGH S, HOOKE A, TORGERSON L, et aJ. Delay tolerant networking: an approach to interplanetary intemet[J]. IEEE Communications Magazine, 2003.41(6):128-136.
  • 3AKYILDIZ I F, SU W, SANKARASUBRAMANIAM Y, et al. A survey on sensor networks[J]. IEEE Communications Magazine, 2002, 40(8): 102-114.
  • 4JONES E, WARD P. Routing strategies for delay-tolerant networks[A]. Proc of International Conference on Wireless Communications and Mobile Computing[C].2006.
  • 5JAIN S, FALL K, PATRA R. Routing in delay tolerant network[A]. Proc ofSIGCOMM[C]. New York: ACM Press, 2004.145-157.
  • 6VAHDAT A, BECKER D. Epidemic routing for partially connected ad hoc networks[R]. Duke University, 2000.
  • 7TANG L, ZHENG Q, LIU J, et aJ. SMART: A selective controlled-flooding routing for delay tolerant networks[A]. Fourth International Conference on IEEE Broadband Communications, Networks and Systems[C]. 2007.356-365.
  • 8SOYROPOULOS T, PSOUNIS K, RAGHA VENDRA C S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks[A]. Proc of the ACM SIGCOMM Workshop on Delay- Tolerant Networking[C]. 2005.252-259.
  • 9SU J, CHIN A, POPIVANOVA A, et aJ. User mobility for opportunistic ad-hoc networking[A]. Proc of the 6th IEEE Workshop on Mobile Computing System and Applications[C]. 2004.41-50.
  • 10ZENG Z P,WANG J Y,ZHOU L Z, et aJ. Coherent closed quasi-clique discovery from large dense graph databases[A]. Proc of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '06[C]. 2006. 797-802.

引证文献3

二级引证文献17

北京理工大学学报
2012年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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