一种基于网络编码的机会社会网络路由算法

doi:10.3969/j.issn.1671-1122.2015.02.009

信息网络安全 ›› 2015, Vol. 15 ›› Issue (2): 51-56.doi: 10.3969/j.issn.1671-1122.2015.02.009

一种基于网络编码的机会社会网络路由算法

齐峰¹(), 马春光^1,², 周永进¹, 苗俊峰¹

1.哈尔滨工程大学计算机科学与技术学院,黑龙江哈尔滨 150001
2.哈尔滨工程大学国家保密学院,黑龙江哈尔滨 150001

收稿日期:2014-11-25 出版日期:2015-02-10 发布日期:2015-07-05
作者简介:
作者简介：齐峰（1979-）,男,黑龙江,硕士研究生,主要研究方向：信息与网络安全、机会网络、网络编码;马春光（1974-）,男,黑龙江,教授,博士,主要研究方向：密码学、信息安全、传感网与物联网、网络编码;周永进（1990-）,男,山东,硕士研究生,主要研究方向：机会网络、移动模型;苗俊峰（1987-）,男,河南,硕士研究生,主要研究方向：信息安全。
基金资助:
黑龙江省自然科学基金[F201229];哈尔滨市科技创新人才研究专项资金[2012RFXXG086]

A Routing Algorithm of Opportunistic Social Networks Based on Network Coding

Feng QI¹(), Chun-guang MA^1,², Yong-jin ZHOU¹, Jun-feng MIAO¹

1. College of Computer Science and Technology, Harbin Engineering University, Harbin Heilongjiang 150001, China
2. College of National Secrecy, Harbin Engineering University, Harbin Heilongjiang 150001, China

Received:2014-11-25 Online:2015-02-10 Published:2015-07-05

摘要/Abstract

摘要：

为了解决机会社会网络中数据传输成功率低、平均传输延迟大等不利因素,文章提出一种基于网络编码的机会社会网络路由（OSN-NC）算法,OSN-NC路由算法的中间节点只将目标节点相同的编码数据包进行再次编码,因此这样可以降低全局编码系数数量和高斯消元的复杂度,增加数据传输的可靠性。社区内我们采用PROPHET和网络编码相结合的消息传输策略,将编码数据包传输给网络中相遇概率值更大的下一跳转发节点,直到遇到目标节点。在社区间我们选择累积相遇概率值大的节点作为编码节点完成消息的转发,直到遇到具有相同社区的中间节点后采用社区内消息传输策略。仿真结果表明,OSN-NC算法在提高网络吞吐量和数据传输成功率、降低平均传输时延等方面具有明显的改善。

关键词: 机会社会网络, 网络编码, 社区

Abstract:

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 OSN-NC 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 coefficients 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 significantly improved.

Key words: opportunistic social networks, network coding, community

中图分类号:

TP309

齐峰, 马春光, 周永进, 苗俊峰. 一种基于网络编码的机会社会网络路由算法[J]. 信息网络安全, 2015, 15(2): 51-56.

Feng QI, Chun-guang MA, Yong-jin ZHOU, Jun-feng MIAO. A Routing Algorithm of Opportunistic Social Networks Based on Network Coding[J]. Netinfo Security, 2015, 15(2): 51-56.

图/表 6

参考文献 13

[1]	熊永平,孙利民,牛建伟,等. 机会网络[J]. 软件学报,2009,20(1):124-137.
[2]	FALL K.A delay-tolerant network architecture for challenged internets[C]//Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications. ACM, 2003: 27-34.
[3]	GIRVAN M, NEWMAN M E J. Community structure in social and biological networks[J]. Proceedings of the National Academy of Sciences, 2002, 99(12): 7821-7826.
[4]	AHLSWEDE R, CAI N, LI S Y R, et al. Network information flow[J]. Information Theory, IEEE Transactions on, 2000, 46(4): 1204-1216.
[5]	PELUSI L, PASSARELLA A, CONTI M.Opportunistic networking: data forwarding in disconnected mobile ad hoc networks[J]. Communications Magazine, IEEE, 2006, 44(11): 134-141.
[6]	VAHDAT A, BECKER D.Epidemic routing for partially connected ad hoc networks[R]. Technical Report CS-200006, Duke University, 2000.
[7]	SPYROPOULOS T, PSOUNIS K, RAGHAVENDRA C S.Spray and wait: an efficient routing scheme for intermittently connected mobile networks[C]//Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. ACM, 2005: 252-259.
[8]	SPYROPOULOS T, PSOUNIS K, RAGHAVENDRA C S.Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility[C]//Pervasive Computing and Communications Workshops, 2007. PerCom Workshops' 07. Fifth Annual IEEE International Conference on. IEEE, 2007: 79-85.
[9]	LINDGREN A, DORIA A, Schelén O.Probabilistic routing in intermittently connected networks[J]. ACM SIGMOBILE mobile computing and communications review, 2003, 7(3): 19-20.
[10]	DALY E M, HAAHR M.Social network analysis for routing in disconnected delay-tolerant manets[C]//Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing. ACM, 2007: 32-40.
[11]	HUI P, CROWCROFT J, YONEKI E.Bubble rap: Social-based forwarding in delay-tolerant networks[J]. Mobile Computing, IEEE Transactions on, 2011, 10(11): 1576-1589.
[12]	DUCH J, ARENAS A.Community detection in complex networks using extremal optimization[J]. Physical review E, 2005, 72(2): 027104.
[13]	SPYROPOULOS T, PSOUNIS K, RAGHAVENDRA C S.Performance analysis of mobility-assisted routing[C]//Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing. ACM, 2006: 49-60.

[1]	王雅旋, 林喜军, 曲海鹏. 一种有效抗污染攻击的混合网络编码方案[J]. 信息网络安全, 2019, 19(5): 69-76.
[2]	俞惠芳, 高新哲. 多源网络编码同态环签名方案研究[J]. 信息网络安全, 2019, 19(2): 36-42.
[3]	王劲松, 南慧荣, 张洪豪. 基于二分图模型的主机行为分析[J]. 信息网络安全, 2018, 18(12): 1-7.
[4]	马苗立, 张洪波, 丁卫颖. 基于字节级优化更新的云存储增量式网络编码方法研究[J]. 信息网络安全, 2018, 18(11): 18-26.
[5]	付顺顺, 顾益军, 张大瀚, 孟凡鹏. 基于改进MCMC方法的重叠社区发现算法[J]. 信息网络安全, 2017, 17(9): 138-142.
[6]	刘浩, 陈志刚, 张连明. 基于社区的移动社交网络安全路由算法设计与实现[J]. 信息网络安全, 2017, 17(7): 25-31.
[7]	温俊伟. 面向Twitter的分析系统研究[J]. 信息网络安全, 2016, 16(9): 234-239.
[8]	周玉晶, 沈嘉荟, 邱海韬, 查达仁. 基于复杂网络的社交媒体内容安全可视化分析系统[J]. 信息网络安全, 2016, 16(9): 158-162.
[9]	许为, 林柏钢, 林思娟, 杨旸. 一种基于用户交互行为和相似度的社交网络社区发现方法研究[J]. 信息网络安全, 2015, 15(7): 77-83.
[10]	陈福臻, 程久军, 廖竞学, 邵剑雨. 基于网络编码的同态HASH抗污染攻击系统研究[J]. 信息网络安全, 2015, 15(6): 33-40.
[11]	周永进, 马春光, 苗俊峰, 齐峰. 基于社区层次的机会网络移动模型[J]. 信息网络安全, 2014, 14(8): 45-49.
[12]	. 社交网Twitter平台的人物关系网社区发现[J]. , 2014, 14(5): 32-.
[13]	. 信息论课程在网络安全与执法专业建设中的重要性研究[J]. , 2014, 14(11): 87-.
[14]	陈旻, 崔学敏, 徐明, 郭红怡. 信息论课程在网络安全与执法专业建设中的重要性研究[J]. 信息网络安全, 2014, 15(11): 87-91.
[15]	谢垂益;鲁向前;卿斯汉. 云存储系统的分区编码冗余方法研究[J]. , 2013, 13(6): 0-0.

一种基于网络编码的机会社会网络路由算法

A Routing Algorithm of Opportunistic Social Networks Based on Network Coding

RichHTML

可视化

摘要/Abstract

引用本文

使用本文

图/表 6

参考文献 13

相关文章 15

编辑推荐

Metrics

本文评价