基于社会属性的PSN消息路由算法

doi:10.11959/j.issn.1000-436x.2015105

Abstract

Abstract:

In pocket switched network,how to make effective balance between the message delivery ratio and transmis-sion delay is a problem to be solved.A community-based PSN routing algorithm,named BridgingCom,is proposed.It uses local community detection method with aging mechanism and introduces the bridging centrality as the basis of for-warding decisions.The algorithm combines the analysis of node centrality with the structure of social mobile network,makes full use of the community relationship and activeness of nodes in PSN.Simulation results show that BridgingCom routing algorithm has better performance in the message delivery ratio and message average delay compared to a number of previously proposed algorithms.

Key words: PSN, DTN, routing algorithm, community, centrality

AOJiu-xin C,HENGao-jun C,ANGJing Y,HUZi-qing Z,IUBo L. Social-based routing in pocket switched networks[J]. Journal on Communications, 2015, 36(5): 13-22.

Figures/Tables 9

References 27

[1]	HUI P , CHAINTREAU A , et al. Pocket switched networks and human mobility in conference environments[A]. Proc of the 2005 ACM SIG-COMM Workshop on Delay-tolerant Networking[C]. ACM, 2005. 244-251.
[2]	DALY E , HAAHR M . Social network analysis for routing in discon-nected delay-tolerant manets[A]. Proc of ACM MobiHoc[C]. ACM, 2007. 32-40.
[3]	HUI P , CROWCROFT J , YONEKI E . Bubble rap:social-based for-warding in delay-tolerant networks[J]. Mobile Computing,IEEE Transactions, 2011,10(11):1576-1589.
[4]	ZHU Y , XU B , SHI X , et al. A survey of social-based routing in delay tolerant networks:positive and negative social effects[J]. IEEE Com-munications Surveys ＆ Tutorials, 2012,15(1):387-401.
[5]	EAGLE N , PENTLAND A . Reality mining:sensing complex social systems[J]. Personal and Ubiquitous Computing, 2006,10(4):255-268.
[6]	DIOT C , et al. Haggle project[EB/OL]. , 2004.
[7]	苏金树，胡乔林，赵宝康，彭伟．容延容断网络路由技术[J]．软件学报， 2010,21(1):119-132. SU J S , HU Q L , ZHAO B K , PENG W . Routing techniques on de-lay/disruption tolerant networks[J]. Journal of Software, 2010,21(1):119-132.
[8]	VAHDAT A , BECKER D . Epidemic routing for partially connected ad hoc networks[R]. Technical Report, 2000
[9]	ANDERS L , AVRI D , OLOV S . Probabilistic routing in intermittently connected networks[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2003,7(3):19-20.
[10]	MILGRAM S . The small world problem[J]. Psychology Today, 1967,2:60-67.
[11]	FREEMAN L C . Centrality in social networks conceptual clarification[J]. Social networks, 1979,1(3):215-239.
[12]	DALY E M , HAAHR M . Social network analysis for information flow in disconnected delay-tolerant MANETs[J]. IEEE Transactions on Mobile Computing, 2009,8(5):606-621.
[13]	SARAFIJANOVIC-DJUKIC M P N , GROSSGLAUSER M . Island hopping:efficient mobility-assisted forwarding in partitioned networks[A]. Proc of Sensor and Ad Hoc Communications and Networks[C]. IEEE, 2006.226-235.
[14]	HU T , HONG F , ZHANG X Q . BiBUBBLE:social-based forwarding in pocket switched networks[A]. Proc of UIC/ATC[C]. IEEE, 2010.195-199.
[15]	MTIBAA A , HARRAS K A . Social forwarding in large scale networks:insights based on real trace analysis[A]. Proc of Computer Communi-cations and Networks[C]. IEEE, 2011.1-8.
[16]	MEI A , MORABITO G , SANTI P , et al. Social forwarding in large scale networks:insights based on real trace analysis[A]. Proc of IEEE INFOCOM[C]. IEEE, 2011.251-255.
[17]	GAO W , CAO G . User-centric data dissemination in disruption toler-ant networks[A]. Proc of IEEE INFOCOM[C]. IEEE, 2011.3119-3127.
[18]	ORLINSKI M , FILER N . Quality distributed community formation for data delivery in pocket switched networks[A]. Proc of SIM-PLEX[C]. ACM, 2012.31-36.
[19]	LI Z , LI Q M , ZHANG H , et al. Closely social circuit based routing in social delay tolerant networks[J]. Journal of Computer Research and Development, 2012,49(6): 1185-1195.
[20]	程学旗，沈华伟．复杂网络的社区结构[J]．复杂系统与复杂性科学， 2011(8):57-70. CHENG X Q , SHEN H W . Community structure of complex net-works[J]. Complex Systems and Complexity Science, 2011(8):57-70.
[21]	MARSDEN P V . Egocentric and sociocentric measures of network centrality[J]. Social Networks, 2002(24): 407-422.
[22]	HWANG W , CHO Y , ZHANG A , et al. Bridging centrality:identifying bridging nodes in scale-free networks[A]. Proc of ACM SIGKDD[C]. ACM, 2006. 20-23.
[23]	FREEMAN L C . Centrality in social networks conceptual clarifi-cation[J]. Social networks, 1979,1(3): 215-239.
[24]	PAN H , EIKO Y , SHU Y C , JON C . Distributed community detection in delay tolerant networks[A]. Proc of 2nd ACM/IEEE International Workshop on Mobility in the Evolving Internet Architecture[C]. 2007. 27-30.
[25]	ONE:Opportunistic Network Environment[EB/OL]. , 2009.
[26]	EAGLE N , PENTLAND A . Reality mining:sensing complex social systems[J]. Personal and Ubiquitous Computing, 2006,10(4): 255-268.
[27]	DIOT C , et al. Haggle project[EB/OL]. , 2004.

Metrics

Recommended 0

No Suggested Reading articles found!

参数	Reality	Infocom2006
设备	Phone	iMote
网络类型	Bluetooth	Bluetooth
持续周期/天	246	3
连接间隔/s	300	120
实验设备数目	97	98
连接事件	54 667	191 336
平均每天每2个节点间连接事件数目	0.024	6.7

参数	Reality	Infocom2006
连接时间阈值F_i/s	21 600	10 800
并入阈值v_j	0.6	0.6
合并阈值F_i	0.6	0.6
连接老化阈值窗口G_t(V,E)/s	21 600	10 800

Social-based routing in pocket switched networks

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 9

References 27

Related Articles 15

Metrics

Recommended 0

[1]	Yang GAO, Hongli ZHANG. Survey on community detection method based on random walk [J]. Journal on Communications, 2023, 44(6): 198-210.
[2]	Jiagao WU, Yahang GUO, Shenlei CAI, Linfeng LIU. Vehicular delay tolerant network routing algorithm based on optimized multi-period Bayesian network [J]. Journal on Communications, 2021, 42(12): 109-120.
[3]	Hongyan LI,Tao ZHANG,Jingqian ZHANG,Keyi SHI,Pengcheng ZENG. Time deterministic routing algorithm and protocol based on time-varying graph over the space-ground integrated network [J]. Journal on Communications, 2020, 41(10): 116-129.
[4]	Junlei BI,Zhiyuan LI. Time-variant interest community based query message routing algorithm in opportunity social network [J]. Journal on Communications, 2019, 40(9): 86-94.
[5]	WANG Li’na,GUO Xiaodong,WANG Run. Automated crowdturfing attack in Chinese user reviews [J]. Journal on Communications, 2019, 40(6): 1-13.
[6]	Hao LONG, Shukui ZHANG, Yang ZHANG, Li ZHANG. Task distribution algorithm based on community in mobile crowd sensing [J]. Journal on Communications, 2019, 40(10): 42-54.
[7]	Yancui SHI,Yuan WANG,Qing ZHAO,Xiankun ZHANG. Research status of community detection based on local expansion [J]. Journal on Communications, 2019, 40(1): 149-162.
[8]	Qiang LIU,Yan JIA,Binxing FANG,Bin ZHOU,Yue HU,Jiuming HUANG. Research on the scalability of parallel community detection algorithms [J]. Journal on Communications, 2018, 39(4): 13-20.
[9]	Zhigang CHEN,NBin'an YI,Jia WU. Energy balanced routing algorithm for opportunistic network based on message importance [J]. Journal on Communications, 2018, 39(12): 91-101.
[10]	Peng WANG,Hong-yan LI,Tao ZHANG,Peng-yun LI. Minimum delay algorithm based on time aggregated graph in DTN network [J]. Journal on Communications, 2017, 38(Z1): 1-8.
[11]	Ya-hui WANG,Hong-feng KUANG,Li-dong ZHU. Capacity analysis of the MEO satellite constellation [J]. Journal on Communications, 2017, 38(Z1): 193-199.
[12]	Yue-ping CAI,Jun LIU,Xin-wei FAN. Node centrality metric based caching mechanism in content-centric network [J]. Journal on Communications, 2017, 38(6): 10-18.
[13]	Ying PENG,Nao WANG,Gao-cai WANG. Optimal energy efficiency routing strategy based on community in mobile social network [J]. Journal on Communications, 2017, 38(5): 128-144.
[14]	Jing CHEN,Yun WAN. Research on label propagation algorithm based on modularity maximization in the social network [J]. Journal on Communications, 2017, 38(2): 25-33.
[15]	Kun DENG,Wen-ping LI,Fa-hong YU,Jian-pei ZHANG. Overlapping community detection in complex networks based on multi kernel label propagation [J]. Journal on Communications, 2017, 38(2): 53-66.