期刊文献+

DTN中网络场景与路由度量映射模型 被引量:2

Mapping model of network scenarios and routing metrics in DTN
下载PDF
导出
摘要 为实现容延网络(DTN)长期运行的高网络可达率,提高DTN的传输性能,提出了1种网络场景与路由度量映射模型。以DTN标准数据集为样本,研究分析DTN特征参数,提出了运用k-means聚类算法对动态DTN场景分类的方法。利用时间图结合Floyd算法的方法统计信息时效期内的网络可达率。采用破坏性方法建立网络场景与路由度量的映射模型。仿真结果验证了该模型的有效性。 Aiming to accelerate the long-term network delivery rate and improve network transmission performance of delay tolerant networks (DTN),a mapping model of network scenarios and routing metrics is proposed here .A network scenarios classification method based on k-means clustering algorithm is proposed by taking real standard trace datasets as samples and analyzing DTN network characteristics .The network delivery rate in time to live ( TTL) is computed using the temporal graph and Floyd algorithm .A mapping model of network scenarios and routing metrics is constructed using the destructive analysis method .The simulation results verify the validity of the model proposed here .
出处 《南京理工大学学报》 EI CAS CSCD 北大核心 2016年第3期290-296,共7页 Journal of Nanjing University of Science and Technology
基金 中国博士后科学基金(2012M521291)
关键词 容延网络 网络场景分类 路由度量 K-MEANS聚类算法 时间图 FLOYD算法 网络可达率 delay tolerant networks network scenarios classifications routing metrics k-means clustering algorithm temporal graph Floyd algorithm network delivery rate
  • 相关文献

参考文献1

二级参考文献14

  • 1Pelusi L, Passarella A, Conti M. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks [ J ]. Communications Magazine, 2006,44 (11) :134-141.
  • 2Spyropoulos T, Psounis K, Raghavendra C S. Efficient routing in intermittently connected mobile networks: The multiple-copy case[J]. IEEE Transactions on Net- working,2008,16( 1 ) :77-89.
  • 3Spyropoulos T, Psounis K, Raghavendra C S. Efficient routing in intermittently connected mobile networks: The single-copy case [ J ]. IEEE Transactions on Networking,2008,16( 1 ) :63-76.
  • 4Vahdat A, Becker D. Epidemic routing for partially connected ad hoc networks [ R ]. CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000.
  • 5Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait : Efficient routing in intermittently connectedmobile networks [ A ]. Proceedings of the ACM Special Interest Group on Data Communication (SIGCOMM) Workshop on Delay Tolerant Networks [ C ]. Philadelphia, PA, USA : ACM Press,2005 : 183-189.
  • 6Nguyen H A, Giordano S, Puiatti A. Probabilistic routing protocol for intermittently connected mobile ad hoc network [ A ]. Proceedings of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks [ C ]. Espoo, Finland: IEEE Press ,2007 : 1-6.
  • 7Burgess J, Gallagher B, Jensen D, et al. Maxprop: Routing for vehicle-based disruption-tolerant networks [A]. Proceedings of the IEEE INFOCOM [C]. Barcelona, Spain : IEEE Computer Society Press, 2006 : 1-11.
  • 8Boldrini C, Conti M, Delmastro F, et al. Context-and social-aware middleware for opportunistic networks [ J ]. Journal of Network and Computer Applications, 2010(33 ) :525-541.
  • 9Nelson S C, Bakht M, Kravets R. Encounter-based routing in DTNs [ A ]. Proceedings of IEEE INFOCOM [ C ]. Rio de Janeiro, Brazil: IEEE Press, 2009 : 846 -854.
  • 10Anindya T, Rajkumar D, Humayun K, et al. TYL based routing in opportunistic networks [ J J. Journal of Network and Computer Applications, 2011,34 ( 5 ) : 1660-1670.

同被引文献16

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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