机会社交网络中基于时变兴趣社区的查询消息路由算法

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

Abstract

Abstract:

To solve the problem that the successful rate of resource query is low in opportunity social network,a query message routing algorithm based on time-variant interest community was proposed.Two well-known mobile social datasets were firstly analyzed,and then the temporal and spatial correlations of users were found.The time-variant interest communities based on temporal and spatial correlations of users were constructed.Next,a dynamic query routing on the constructed time-variant interest communities was proposed.Theoretical analysis shows that the proposed routing can run in O (nlog n) time.The comparisons between the proposed routing and state-of-the-art message delivery algorithms show that the proposed routing can keep high query success rate,reduce the average query latency and the hop count of a query and maintain low system overhead.

Key words: opportunistic social network, query routing, mobile social data analysis, time-variant interest community

CLC Number:

TP393

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.

Figures/Tables 14

References 17

[1]	PIETIL?NEN A K , DIOT C . Dissemination in opportunistic social networks:the role of temporal communities[C]// The 13th ACM International Symposium on Mobile Ad Hoc Networking and Computing. ACM, 2012: 165-174.
[2]	李超, 殷丽华, 耿魁 ,等. 面向移动社交网络内容分享的位置隐私保护方法[J]. 通信学报, 2016,37(11): 31-41.
	LI C , YIN L H , GENG K ,et al. Location privacy preservation Approach towards to content sharing on mobile online social network:survey and perspectives[J]. Journal on Communications, 2016,37(11): 31-41.
[3]	VAHDAT A , BECKER D . Epidemic routing for partially connected ad Hoc networks:technical report：CS-200006[R]. North Carolina:Duke University, 2000.
[4]	SPYROPOULOS T , PSOUNIS K , RAGHAVENDRA C S . Spray and wait:an efficient routing scheme for intermittently connected mobile networks[C]// The 21th ACM SIGCOMM Workshop on Delay-Tolerant Networking. ACM, 2005: 252-259.
[5]	LINDGREN A , DORIA A , DAVIES E ,et al. Probabilistic routing protocol for intermittently connected networks:RFC 6693[Z]. IETF Datatracker, 2012.
[6]	DALY E M , HAAHR M . Social network analysis for routing in disconnected delay-tolerant manets[C]// The 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing. ACM, 2007: 32-40.
[7]	LIU Q , HU C , LI Y , ZHAO W ,et al. An interest community routing scheme for opportunistic networks[C]// The 54th IEEE Globecom Workshops. IEEE, 2013: 4366-4371.
[8]	ZHENG Z J , WANG T Y , SONG L Y ,et al. Social-aware multi-file dissemination in device-to-device overlay networks[C]// The 33rd IEEE International Conference on INFOCOM. IEEE, 2014: 219-220.
[9]	LI Y , LI Q , JIN D P ,et al. Contact duration aware evaluation for content dissemination delay in mobile social network[J]. Wireless Communications ＆ Mobile Computing, 2015,15(3): 527-537.
[10]	MANSILLA A T , ESTEVA J L . Question waves:a multicast query routing algorithm for social search[J]. Information Sciences, 2013,253(1): 1-25.
[11]	YOU L , LI J B , WEI C J . MPAR:a movement pattern-aware optimal routing for social delay tolerant networks[J]. Ad Hoc Networks, 2015,24(3): 228-249.
[12]	PAGANI E , VALERIO L , ROSSI G P . Weak social ties improve content delivery in behavior-aware opportunistic networks[J]. Ad Hoc Networks, 2015,25(7): 314-329.
[13]	LI Y , WU D , XUA J ,et al. Spatial-aware interest group queries in location-based social networks[J]. Data ＆ Knowledge Engineering, 2014,92(1): 20-38.
[14]	FIRDOSE S , LOPES L , MOREIRA W ,et al. The copelabs/usense dataset:Crawdad[J].(2017-01-27)[2018-12-16].
[15]	CIOBANU R I , DOBRE C . The upb/hyccups dataset:Crawdad[J].(2016-10-17)[2018-12-16].
[16]	徐健锐, 詹永照 . 基于 Spark 的改进 K-means 快速聚类算法[J]. .江苏大学学报 (自然科学版) , 2018,39(3): 316-323.
	U J R , ZHAN Y Z . Improved K-means fast clustering algorithm based on Spark[J]. Journal of Jiangsu University (Natural Science Ditions), 2018,39(3): 316-323.
[17]	PEDREGOSA F , VAROQUAUX G , GRAMFORT A ,et al. Scikit-learn:machine learning in Python[J]. Journal of machine learning research, 2011,32(1): 2825-2830.

Metrics

Recommended 0

No Suggested Reading articles found!

参数	描述	默认值
world size	仿真实验场景面积	100 m × _{200 m}
EndTime/天	仿真时间	7
NrofHosts	用户节点个数	200
NrofHostGroups	分组数	4
Interface.type	通信接口类型	SimpleBroadcast
transmit speed/(Mbit·s^-1)	传输带宽	2
transmit range/m	传输距离	10～20
MovementModel	组内节点移动模型	ShortestPathMap
		BasedMovement
mobility speed/(m·s^-1)	节点的移动速度	0.5～1.5
Message.Size/KB	消息的大小	500～1024
Message.Interval/s	消息产生的间隔	1～2
Message.TTL/min	消息的生存周期	300
L	消息副本数	6

Time-variant interest community based query message routing algorithm in opportunity social network

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 14

References 17

Related Articles 15

Metrics

Recommended 0

[1]	Jingbo LI, Li MA, Yang LI, Yingxun FU, Dongchao MA. Optimized design of sensing transmission and computing collaborative industrial Internet [J]. Journal on Communications, 2023, 44(6): 12-22.
[2]	Shiqi ZHAO, Xiaohong HUANG, Zhigang ZHONG. Research and implementation of reputation-based inter-domain routing selection mechanism [J]. Journal on Communications, 2023, 44(6): 47-56.
[3]	Zhen CHEN, Wenhui CHEN, Xiaowei LIU, Dianlong YOU, Linlin LIU, Limin SHEN. Functional complementarity relationship enhanced cloud API recommendation method [J]. Journal on Communications, 2023, 44(6): 125-137.
[4]	Debin WEI, Chengsheng PAN, Li YANG, Zuoren YAN. Adaptive random early detection algorithm based on network traffic level grade prediction [J]. Journal on Communications, 2023, 44(6): 154-166.
[5]	Yuancheng LI, Yongtai QIN. Deep reinforcement learning based algorithm for real-time QoS optimization of software-defined security middle platform [J]. Journal on Communications, 2023, 44(5): 181-192.
[6]	Yingjie XIA, Siyu ZHU, Xuejiao LIU. Research on efficient cross trust-domain group authentication with conditional privacy of vehicle platoon under blockchian architecture [J]. Journal on Communications, 2023, 44(4): 111-123.
[7]	Renchao XIE, Wen WEN, Qinqin TANG, Yunlong LIU, Gaochang XIE, Tao HUANG. Survey on rail transit mobile edge computing network security [J]. Journal on Communications, 2023, 44(4): 201-215.
[8]	Zhiyong LUO, Yu ZHANG, Qing WANG, Weiwei SONG. Study of SDN intrusion intent identification algorithm based on Bayesian attack graph [J]. Journal on Communications, 2023, 44(4): 216-225.
[9]	Yifeng WANG, Yuanbo GUO, Qingli CHEN, Chen FANG, Renhao LIN, Yongliang ZHOU, Jiali MA. Method based on contrastive incremental learning for fine-grained malicious traffic classification [J]. Journal on Communications, 2023, 44(3): 1-11.
[10]	Jin ZHANG, Qiang GE, Weihai XU, Yiming JIANG, Hailong MA, Hongtao YU. Design, implementation and formal verification of BGP proxy for mimic router [J]. Journal on Communications, 2023, 44(3): 33-44.
[11]	Pujie JING, Liangmin WANG, Xuewen DONG, Yushu ZHANG, Qian WANG, Sohail Muhammad. CHA: cross-chain based hierarchical architecture for practicable blockchain regulatory [J]. Journal on Communications, 2023, 44(3): 93-104.
[12]	Jian SHU, Jiawei SHI, Linlan LIU, Al-Kali Manar. Topology prediction for opportunistic network based on spatiotemporal convolution [J]. Journal on Communications, 2023, 44(3): 145-156.
[13]	Dongbin WANG, Dongzhe WU, Hui ZHI, Kun GUO, Xu ZHANG, Jinqiao SHI, Yu ZHANG, Yueming LU. Preventing flow table overflow against denial of service attack in software defined network [J]. Journal on Communications, 2023, 44(2): 1-11.
[14]	Haiyan KANG, Molan LONG. Research on network attack analysis method based on attack graph of absorbing Markov chain [J]. Journal on Communications, 2023, 44(2): 122-135.
[15]	Yuntao ZHANG, Binxing FANG, Chunlai DU, Zhongru WANG, Zhijian CUI, Shouyou SONG. Container escape detection method based on heterogeneous observation chain [J]. Journal on Communications, 2023, 44(1): 49-63.