期刊文献+

基于节点社会性的无线网络编码传输策略研究 被引量:2

Wireless network coding transmission strategy based on nodal sociality
下载PDF
导出
摘要 延迟容忍网络是一种缺乏持续连接的新型网络体系结构,选择合适的转发节点是实现延迟容忍网络高效的转发和投递消息的关键问题。由于节点移动性和网络拓扑动态变化等会对延迟容忍网络的传输效率产生影响,提出了一种基于节点社会性和利用随机线性网络编码的DTN模型NSNC-DTN。NSNC-DTN模型利用网络中的社团结构、社团紧密度以及节点活跃度,选择出最合适的转发节点。离线计算节点的社会性,对源节点和center节点进行随机线性网络编码,在线完成转发,从而达到高效转发和投递的目的。仿真结果表明NSNC-DTN能够有效地提高信息投递成功率,减小端对端的网络延迟和网络开销。 Delay tolerant network(DTN) is a new network architecture which lacks continuous connectivity, choosing the appropriate forwarding node is a key of efficient forwarding and delivery. Due to the dynamic change of node mobility and network topology affect the transmission efficiency of DTN, this paper proposed a new DTN model NSNC-DTN based on nodal sociality and random linear network coding. NSNC-DTN model chose the most appropriate forwarding node by the community structure, the similarity of community and activity of the nodes in the network. It calculated nodal sociality in offline mode and used random linear network coding for source nodes and center nodes, implements messages forwarding online to reach the goal of efficient forwarding and delivery. The simulation result shows that NSNC-DTN model can effectively improve the success rate of information delivery and reduce network delay and network overhead.
作者 张晓军 李领治 朱艳琴 Zhang Xiaojun;Li Lingzhi;Zhu Yanqin(School of Computer Science & Technology, Soochow University, Suzhou Jiangsu 215006, China)
出处 《计算机应用研究》 CSCD 北大核心 2019年第7期2104-2107,2119,共5页 Application Research of Computers
基金 国家自然科学基金资助项目(61373164,61672370)
关键词 延迟容忍网络 社团发现 网络编码 数据转发 delay-tolerant network community detection network coding data forwarding
  • 相关文献

参考文献6

二级参考文献42

  • 1Daly E, Haahr M. Social Network Analysis Disconnected Delay-tolerant MANETs[C]//Proc. International Symposium on Mobile Ad Hoc Computing. Mon.n'eal, Canada: ACM Press, 2007 for Routing in of the 8th ACM Networking and 32-40.
  • 2Vahdat A, Beeker D. Epidemic Routing for Partially-connected Ad Hoc Networks[R]. Duke University, Tech. Rep.: CS-2000-06, 2000.
  • 3Lindgren A, Doria A, Schel6n O. Probabilistic Routing in Intermittently Connected Networks[J]. Mobile Computing and Communications Review, 2003, 7(3): 19-20.
  • 4Newman M E J. A Measure of Betweenness Centrality Based on Random Walks[J]. Social Networks, 2005, 27(5): 39-54.
  • 5Peter V. Marsden Egocentric and Sociocentric Measures of Network Centrality[J]. Social Networks, 2002, 24(4): 407-422.
  • 6Machine Perception and Learning of Complex Social Systems [EB/OL]. (2011-11-15). http://reality.media.mit.edu/.
  • 7Chaintreau A, Pan Hui, Crowcroft J, et al. Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms[J]. IEEE Transactions on Mobile Computing, 2007, 6(6): 606-620.
  • 8Vahdat A, Becker D. Epidemic routing for partially-connect- ed ad hoe networks. Durham NC, USA: Duke University, Technical Report: CS-200006, 2000.
  • 9Ramanathan R, Hansen R, Basu P, Rosales-Hain R, Krishnan R. Prioritized epidemic routing for opportunistic networks// Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking (MobiOpp07). San Juan, USA, 2007:62-66.
  • 10Spyropoulos T, Psounis K, Raghavendra C. Spray and wait: An efficient routing scheme for intermittently connected mobile networks//Proceedings of the ACM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications Workshop on Delay Tolerant Networking (WDTN' 05). Philadelphia, USA, 2005 : 252- 259.

共引文献55

同被引文献20

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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