Social Selfishness-based Routing Algorithm on Opportunistic Networks

doi:10.3969/j.issn.1006-2475.2016.08.019

Abstract

Abstract: In the existing selfishness-based routing algorithms of opportunistic networks, most of them assume that selfishness exists in just a part of the nodes. However, most people have different degrees of selfishness in the real world. Therefore, a social selfishness-based routing algorithm is proposed. In this algorithm, node’s selfishness is reflected in the pursuit of the maximum forwarding revenue, which is related to both the social relationship intensity between the pair nodes and the priorities of the messages. With a stronger social tie and a higher message priority, the forwarding willingness becomes stronger. Meanwhile, nodes firstly forward messages with the highest forwarding revenue, and select the relay node which has a stronger social tie with the destination node and a higher delivery ratio as well as a stronger forwarding willingness for the sender. Finally, the feasibility and efficiency of the proposed algorithm is proved by the simulation experiments.

Key words: opportunistic networks, social selfishness, routing algorithm, social routing, simulation

CLC Number:

TP393

LIU Xi-xun. Social Selfishness-based Routing Algorithm on Opportunistic Networks[J]. Computer and Modernization, doi: 10.3969/j.issn.1006-2475.2016.08.019.

References

[1] Conti M, Giordano S. Mobile ad hoc networking: Milestones, challenges, and new research directions[J]. IEEE Communications Magazine, 2014,52(1):85-96.

[2] 熊永平,孙利民,牛建伟,等. 机会网络[J]. 软件学报, 2009,20(1):124-137.

[3] Huang C-M, Lan K-C, Tsai C-Z. A survey of opportunistic networks[C]// Proceedings of the 22nd International Conference on Advanced Information Networking and Applications Workshops. 2008:1672-1677.

[4] Allen S M, Chorley M J, Colombo G B, et al. Exploiting user interest similarity and social links for micro-blog forwarding in mobile opportunistic networks[J]. Pervasive and Mobile Computing, 2014,11:106-131.

[5] Mtibaa A, May M, Ammar M. Social forwarding in mobile opportunistic networks: A case of PeopleRank[M]// Handbook of Optimization in Complex Networks. Springer New York, 2012:387-425.

[6] Li Fan, Zhao Lunan, Zhang Chao, et al. Routing with multi-level cross-community social groups in mobile opportunistic networks[J]. Personal and Ubiquitous Computing, 2014,18(2):385-396.

[7] Sermpezis P, Spyropoulos T. Understanding the effects of social selfishness on the performance of heterogeneous opportunistic networks[J]. Computer Communications, 2014,48:71-83.

[8] Ciobanu R-I, Dobre C, Dascălu M, et al. SENSE: A collaborative selfish node detection and incentive mechanism for opportunistic networks[J]. Journal of Network and Computer Applications, 2014,41:240-249.

[9] Pan Daru, Zhang Hui, Chen Weijing, et al. Transmission of multimedia contents in opportunistic networks with social selfish nodes[J]. Multimedia Systems, 2015,21(3):277-288.

[10]赵广松,陈鸣. 自私性机会网络中激励感知的内容分发的研究[J]. 通信学报, 2013,34(2):73-84.

[11]林鑫. 基于0-1背包问题的讨论[J]. 微机发展, 2005,15(10):41-43.

[12] Keranen A. Opportunistic Network Environment Simulator[R]. Helsinki University of Technology, 2008.

[13] Eagle N, Pentland A. Reality mining: Sensing complex social systems[J]. Personal and Ubiquitous Computing, 2006,10(4):255-268.

[14] Leguay J, Hui Pan, Crowcroft J, et al. CRAWDAD Dataset[EB/OL]. http://crawdad.org/upmc/content/20061117/, 2006-11-17.

[15] 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.

[16] 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. 2007:32-40.

[17] Lee C-H, Eun D Y. On the forwarding performance under heterogeneous contact dynamics in mobile opportunistic networks[J]. IEEE Transactions on Mobile Computing, 2013,12(6):1107-1119.