Node mobility model based on user interest similarity

doi:10.11772/j.issn.1001-9081.2015.09.2457

Journal of Computer Applications ›› 2015, Vol. 35 ›› Issue (9): 2457-2460.DOI: 10.11772/j.issn.1001-9081.2015.09.2457

Previous Articles Next Articles

Node mobility model based on user interest similarity

GAO Yuan, WANG Shumin, SUN Jianfei

School of Computer and Control Engineering, North University of China, Taiyuan Shanxi 030051, China

Received:2015-04-09 Revised:2015-05-27 Online:2015-09-10 Published:2015-09-17

基于用户兴趣相似性的节点移动模型

高媛, 王淑敏, 孙建飞

中北大学计算机与控制工程学院, 太原 030051

通讯作者: 高媛(1972-),女,山西太原人,副教授,硕士,主要研究方向:无线传感器网络、机会网络、人工智能,caiyecao505@163.com
作者简介:王淑敏(1988-),女,河北沙河人,硕士研究生,主要研究方向:机会网络、社会网络;孙建飞(1988-),男,山西吕梁人,硕士研究生,主要研究方向:机会网络、网络编码。

Abstract

Abstract: According to the driving effect of people's social relations and interests on the social activities of nodes,a mobility model based on user interest similarity was presented.The interest degree of node to the activities was described with a interest probability matrix,and Pearson correlation coefficient was used to calculate the similar interest groups of nodes.Simulation results show that,the complementary cumulative density function of inter-contact time and contact duration in a certain time approximately follows power-law distribution,which is more consistent with the curve obtained from statistical results of real data set.Additionally, strong space-time regularity is observed when nodes are involved in the activities in the evening.

Key words: social relation, interest, pearson correlation coefficient, mobility model

摘要： 针对现实生活中人们的社交关系和兴趣爱好对节点进行社会活动的驱动作用,提出了一种基于用户兴趣相似性的节点移动模型。该模型将节点对活动的感兴趣程度抽象为一个兴趣概率矩阵,利用皮尔逊相关系数计算节点的兴趣相似群体。仿真实验表明,该模型在一定时间范围内节点的相遇时间间隔和相遇持续时间的互补累积分布函数近似服从幂律分布,更加接近真实数据集统计结果得到的曲线,同时也表明了节点在进行夜间活动时,具有很强的时空规律性。

关键词: 社交关系, 兴趣, 皮尔逊相关系数, 移动模型

CLC Number:

TP393.0

GAO Yuan, WANG Shumin, SUN Jianfei. Node mobility model based on user interest similarity[J]. Journal of Computer Applications, 2015, 35(9): 2457-2460.

高媛, 王淑敏, 孙建飞. 基于用户兴趣相似性的节点移动模型[J]. 计算机应用, 2015, 35(9): 2457-2460.

References

[1] LIU Y, GAO Y, QIAO J, et al. Community-based message transmission scheme in opportunistic social networks [J]. Journal of Computer Applications, 2013,33(5):1212-1216.(刘亚翃,高媛,乔晋龙,等.机会社会网络中基于社区的消息传输算法[J].计算机应用,2013,33(5):1212-1216.)
[2] MUSOLESI M, MASCOLO C. A community based mobility model for Ad Hoc network research [C]//Proceedings of Second International Workshop on Multi-hop Ad Hoc NetWorks: from Theory to Reality. New York: ACM,2006:31-38.
[3] BOLDRINI C, PASSARELLA A. HCMM: modeling spatial and temporal properties of human mobility driven by users' social relationships [J]. Computer Communications, 2010,33(9):1056-1074.
[4] BORREL V, LEGENDRE F, dias de AMORIM M, et al. SIMPS: using sociology for personal mobility [J]. IEEE/ACM Transactions on Networking ,2009,17(3):831-842.
[5] EKMAN F, KERÄNEN A, KARVO J, et al. Working day movement model [C]//Proceedings of the 1st ACM SIGMOBILE Workshop on Mobility Models. New York: ACM, 2008:33-40.
[6] TOIVONEN R, ONNELA J, SARAMAKI J, et al. A model for social networks [J]. Physica A: Statistical Mechanics and its Applications, 2006,371(2): 851-860.
[7] YANG G. User mobility models for opportunistic networks [D]. Xiangtan: Hunan University of Science and Technology, 2011:20-22.(杨光.机会网络中的用户移动模型[D]. 湘潭:湖南科技大学,2011:20-22.)
[8] LI Y, WU C, LAI C. A social recommender mechanism for e-commerce: combining similarity, trust and relationship [J]. Decision Support Systems, 2013,55(3):740-752.
[9] ZIGNANI M, PAPANDREA M, GAITO S, et al. On the key features in human mobility: relevance, time and distance [C]//Proceedings of the 2014 IEEE International Conference on Pervasive Computing and Communication Workshops. Piscataway: IEEE, 2014:260-265.
[10] KERÄNEN A, OTT L, KÄRKKÄINEN T. The ONE simulator for DTN protocol evaluation [EB/OL]. [2015-01-11]. http://www.floating-content.net/~jo/papers/2009-03-simutools-one.pdf.
[11] PAN H, SCOTT J, CHAINTREAU A. CRAWDAD datasets and tools by release date: the cambridge/haggle dataset/imote/infocom trace [EB/OL].[2006-01-31]. http://crawdad.org/cambridge/haggle/.
[12] KARAGINNIS T, BOUDEC J Y L, VOJNOVIC M. Power law and exponential decay of inter contact times between mobile devices [C]//Proceedings of the 13th Annual ACM International Conference on Mobile Computing and Networking. New York: ACM, 2007:183-194.
[13] HSU W, HELMY A. On modeling user associations in wireless LAN traces on university campuses [C]//Proceedings of the 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. Piscataway: IEEE, 2006:1-9.

[1]	ZHANG Xiaofei, YANG Yang, HUANG Jiajin, ZHONG Ning. Degree centrality based method for cognitive feature selection [J]. Journal of Computer Applications, 2021, 41(9): 2767-2772.
[2]	MA Jialiang, CHEN Bin, SUN Xiaofei. General object detection framework based on improved Faster R-CNN [J]. Journal of Computer Applications, 2021, 41(9): 2712-2719.
[3]	ZHU Cheng, ZHAO Xiaoqi, ZHAO Liping, JIAO Yuhong, ZHU Yafei, CHENG Jianying, ZHOU Wei, TAN Ying. Classification of functional magnetic resonance imaging data based on semi-supervised feature selection by spectral clustering [J]. Journal of Computer Applications, 2021, 41(8): 2288-2293.
[4]	BAO Xuan, CHEN Hongmei, XIAO Qing. Time-incorporated point-of-interest collaborative recommendation algorithm [J]. Journal of Computer Applications, 2021, 41(8): 2406-2411.
[5]	LIU Huan, LI Xiaoge, HU Likun, HU Feixiong, WANG Penghua. Knowledge graph driven recommendation model of graph neural network [J]. Journal of Computer Applications, 2021, 41(7): 1865-1870.
[6]	DONG Wentao, LI Zhuo, CHEN Xin. Online short video content distribution strategy based on federated learning [J]. Journal of Computer Applications, 2021, 41(6): 1551-1556.
[7]	YANG Li, WANG Shihui, ZHU Bo. Point-of-interest recommendation algorithm combing dynamic and static preferences [J]. Journal of Computer Applications, 2021, 41(2): 398-406.
[8]	CHEN Kai, YU Yanwei, ZHAO Jindong, SONG Peng. Work location inference method with big data of urban traffic surveillance [J]. Journal of Computer Applications, 2021, 41(1): 177-184.
[9]	LIU Nanbo, XIAO Fen, ZHANG Wenlei, LI Wangxin, WENG Zun. Group scanpath generation based on fixation regions of interest clustering and transferring [J]. Journal of Computer Applications, 2021, 41(1): 150-156.
[10]	LI Hanlu, XIE Qing, TANG Lingli, LIU Yongjian. POI recommendation algorithm combining spatiotemporal information and POI importance [J]. Journal of Computer Applications, 2020, 40(9): 2600-2605.
[11]	LUO Huiwen, LONG Shigong. Location perturbation algorithm based on geo-indistinguishability of user’s region of interest [J]. Journal of Computer Applications, 2020, 40(3): 760-764.
[12]	HE Huaiqing, ZHENG Liyuan, LIU Haohan, ZHANG Yumin. Visual analysis method for pilot eye movement data based on user-defined interest area [J]. Journal of Computer Applications, 2019, 39(9): 2683-2688.
[13]	SHAO Changcheng, CHEN Pinghua. Point-of-interest recommendation integrating social networks and image contents [J]. Journal of Computer Applications, 2019, 39(5): 1261-1268.
[14]	JI Lina, CHEN Kai, YU Yanwei, SONG Peng, WANG Shuying, WANG Chenrui. Vehicle type mining and application analysis based on urban traffic big data [J]. Journal of Computer Applications, 2019, 39(5): 1343-1350.
[15]	YANG Zhen, WANG Hongjun. Location prediction method of mobile user based on Adaboost-Markov model [J]. Journal of Computer Applications, 2019, 39(3): 675-680.

Node mobility model based on user interest similarity

基于用户兴趣相似性的节点移动模型

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics