期刊文献+

一种基于网络编码的机会社会网络路由算法 被引量:4

A Routing Algorithm of Opportunistic Social Networks Based on Network Coding
下载PDF
导出
摘要 为了解决机会社会网络中数据传输成功率低、平均传输延迟大等不利因素,文章提出一种基于网络编码的机会社会网络路由(OSN-NC)算法,OSN-NC路由算法的中间节点只将目标节点相同的编码数据包进行再次编码,因此这样可以降低全局编码系数数量和高斯消元的复杂度,增加数据传输的可靠性。社区内我们采用PROPHET和网络编码相结合的消息传输策略,将编码数据包传输给网络中相遇概率值更大的下一跳转发节点,直到遇到目标节点。在社区间我们选择累积相遇概率值大的节点作为编码节点完成消息的转发,直到遇到具有相同社区的中间节点后采用社区内消息传输策略。仿真结果表明,OSN-NC算法在提高网络吞吐量和数据传输成功率、降低平均传输时延等方面具有明显的改善。 In order to solve opportunistic social network with negative factors that the low success rate of data transmission and the large average network latency, we proposed the a routing algorithm of opportunistic social networks based on network coding(OSN-NC). The intermediate nodes of OSNNC routing algorithm are coded again only on the same target nodes of the coded data packet, so this can reduce the overall number of coded coeffi cients and the complexity of Gaussian elimination, and increase the reliability of data transmission. We use the message transmission strategy of combining PROPHET with network coding within the community, transmission the encoded data packets to the next hop node with greater encounter probability, until it reaches the destination node. We select the greater cumulative probability as the encoding node to complete message forwarding between the communities, until encounter intermediate nodes with the same community, then according to the messaging strategy within community. The simulation results show OSN-NC in improving network throughput and success rate of data transmission, reducing he average transmission delay other properties have signifi cantly improved.
出处 《信息网络安全》 2015年第2期51-56,共6页 Netinfo Security
基金 黑龙江省自然科学基金[F201229] 哈尔滨市科技创新人才研究专项资金[2012RFXXG086]
关键词 机会社会网络 网络编码 社区 opportunistic social networks network coding community
  • 相关文献

参考文献1

二级参考文献67

  • 1Hull B, Bychkovsky V, Zhang Y, Chen K, Goraczko M, Miu A, Shih E, Balakrishnan H, Madden S. CarTel: A distributed mobile sensor computing system. In: Proc. of the 4th Int'l Conf. on Embedded Networked Sensor Systems. Boulder: ACM, 2006. 125-138.
  • 2Pan H, Chaintreau A, Scott J, Gass R, Crowcroft J, Diot C. Pocket switched networks and human mobility in conference environments. In: Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia: ACM. 2005. 244-251.
  • 3Juang P, Oki H, Wang Y, Martonosi M, Peh LS, Rubenstein D. Energy-Efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In: Proc. of the 10th Int'l Conf. on Architectural Support for Programming Languages and Operating Systems. New York: ACM, 2002.96-107. DO1=http://doi.acm.org/10.1145/605397.605408
  • 4Pelusi L, Passarella A, Conti M. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. Communications Magazine, 2006,44(11): 134-141.
  • 5Conti M, Giordano S. Multihop ad hoe networking: The reality. Communications Magazine, 2007,45(4):88-95.
  • 6Fall K. A delay-tolerant network architecture for challenged Internets. In: Proc. of the 2003 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications. Karlsruhe: ACM, 2003.27-34.
  • 7Akyildiz IF, Akan B, Chert C, Fang J, Su W. InterPlaNetary Intemet: State-of-the-Art and research challenges. Computer Networks, 2003,43(2):75-112.
  • 8Gupta P, Kumar P. The capacity of wireless networks. IEEE Trans. on Information Theory, 2000,46(2):388-404.
  • 9Grossglauser M, Tse DNC. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. on Networking, 2002, 10(4):477-486.
  • 10Small T, Haas ZJ. The shared wireless infostation model: A new ad hoc networking paradigm (or where there is a whale, there is a way). In: Proc. of the 4th ACM Int'l Symp. on Mobile Ad Hoc Networking. Annapolis: ACM, 2003. 233-244.

共引文献323

同被引文献45

  • 1王慧强,赖积保,朱亮,梁颖.网络态势感知系统研究综述[J].计算机科学,2006,33(10):5-10. 被引量:126
  • 2Huston G. Analyzing the Internet BGP routing table[J]. Internet Protocol Journal, 2001,4(1):2-15.
  • 3Hiran R, Carlsson N, Gill P. Characterizing Large-Scale Routing Anomalies: A Case Study of the China Telecom Incident[J]. Lecture Notes in Computer Science, 2013:229-238.
  • 4Khare V, Ju Q, Zhang B. Concurrent Prefix Hijacks: Occurrence and Impacts 65[C]// Proceedings of the 2012 ACM conference on Internet measurement conference. ACM, 2012:29-36.
  • 5https://www.ripe.net/. [EB/OL]. RIPE NCC Project Homepage.
  • 6http://www.routeviews.org/. [EB/OL]. Router Views Project Homepage.
  • 7Lad M, Massey D, Pei D, et al. PHAS: A Prefix Hijack Alert System[J]. Security, 2006, 15:108-119.
  • 8Chi Y J, Oliveira R, Zhang L. Cyclops: the AS-Level connectivity observatory. [J]. Sigcomm Comput.commun.rev, 2009, 38(5):5-16.
  • 9Yan H, Oliveira R, Burnett K, et al. BGPmon: A Real-Time, Scalable, Extensible Monitoring System[C]//Cybersecurity Applications & Technologies Conference for Homeland Security, 2009:212-223.
  • 10Archipelago (Ark) Measurement Infrastructure Project Homepage[EB/OL]. http://www.caida.org/proj ects/ark/, 2015-06-10.

引证文献4

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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