A Routing Algorithm of Opportunistic Social Networks Based on Network Coding

doi:10.3969/j.issn.1671-1122.2015.02.009

Abstract

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

CLC Number:

TP309

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

Figures/Tables 6

References 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]	MU Zhiying, XU Jiaquan, LI Xiaoyu. Community-Detection-Based Influence Blocking Maximization Algorithm in Social Network [J]. Netinfo Security, 2023, 23(1): 44-56.
[2]	MA Xiangjun, HE Jingsha, WU Tiejun, FAN Dunqiu. An Approach to Identifying Key Hackers in Social Networks [J]. Netinfo Security, 2023, 23(1): 57-65.
[3]	Yaxuan WANG, Xijun LIN, Haipeng QU. An Effective Hybrid Network Coding Scheme Against Pollution Attacks [J]. Netinfo Security, 2019, 19(5): 69-76.
[4]	Huifang YU, Xinzhe GAO. Homomorphic Ring Signature Scheme Technology for Multi-source Network Coding [J]. Netinfo Security, 2019, 19(2): 36-42.
[5]	Jinsong WANG, Huirong NAN, Honghao ZHANG. Host Behavior Analysis Based on Bipartite Graph Model [J]. Netinfo Security, 2018, 18(12): 1-7.
[6]	Miaoli MA, Hongbo ZHANG, Weiying DING. Research on Incremental Network Coding Method for Cloud Storage Based on Byte Level Optimization Update [J]. Netinfo Security, 2018, 18(11): 18-26.
[7]	Shunshun FU, Yijun GU, Dahan ZHANG, Fanpeng MENG. Overlapping Community Detection Algorithm Based on Improved MCMC Method [J]. Netinfo Security, 2017, 17(9): 138-142.
[8]	Hao LIU, Zhigang CHEN, Lianming ZHANG. A Secure Routing Algorithm of Mobile Social Network Based on Community [J]. Netinfo Security, 2017, 17(7): 25-31.
[9]	Yujing ZHOU, Jiahui SHEN, Haitao QIU, Daren ZHA. Complex Network Based Visualization System of Social Media Analysis Content Security [J]. Netinfo Security, 2016, 16(9): 158-162.
[10]	Junwei WEN. Research on Twitter Oriented Analysis System [J]. Netinfo Security, 2016, 16(9): 234-239.
[11]	Wei XU, Bo-gang LIN, Si-juan LIN, Yang YANG. Research on Community Detection Method for Social Networks Based on User Interaction and Similarity [J]. Netinfo Security, 2015, 15(7): 77-83.
[12]	Fu-zhen CHEN, Jiu-jun CHENG, Jing-xue LIAO, Jian-yu SHAO. Research on Homomorphic HASH System for Anti-Pollution-Attack Based on Network Coding [J]. Netinfo Security, 2015, 15(6): 33-40.
[13]	YAN Ling, LI Yi-qun. Research on Identification of Micro-blog Hyper Accounts in Internet Public Opinion Events [J]. 信息网络安全, 2014, 14(9): 26-29.
[14]	ZHOU Yong-jin, MA Chun-guang, MIAO Jun-feng, QI Feng. Mobility Model for Opportunistic Network based on Community Tier [J]. 信息网络安全, 2014, 14(8): 45-49.
[15]	. Finding Community Structures of Users’ Relationships in Twitter [J]. , 2014, 14(5): 32-.