校园无线网用户群体的移动行为聚集分析

doi:10.3969/j.issn.1000-436x.2013.Z2.022

Abstract

Abstract:

Choosing a better and easily computed similarity metric is a challenge task,and the problem how the formedmodularity can help network operation attracts less attention.By introducing sparse linked interval(SLI) to represent wireless nodes' mobile trajectory,mobile nodes' modularity relations via social network analysis methods were effectively revealed.Using real operational datasets of Peking University campus wireless network and public dataset as validation,three common motifs in modularity level,and their formation reasonsand relations to network managements were demonstrated.

Key words: wireless network, mobile trajectory, sparse linked interval, social network analysis, similarity

Chang-ling ZHOU,Qun QIAN,Yi-qiu ZHAO,Qun SHANG. Modularity analysisof users’mobile behavior in campus wireless network[J]. Journal on Communications, 2013, 34(Z2): 111-116.

Figures/Tables 7

References 20

[1]	MATHEWS J B . Why are wireless services important to state and education leaders:southern regional education board[EB/OL]. .
[2]	BALACHANDRAN A , VOELKER G M , VENKATRANGAN P ,et al. Characterizing user behavior and network performance in a public wireless LAN[A]. Proc of ACMIGMETRICS’02[C]. 2002. 195-205.
[3]	KOTZ D , ESSIEN K . Analysis of a campus-wide wireless network:wireless networks11[A]. ACM MobiCom 2002[C]. 2002. 115-133.
[4]	KIM M , KOTZ D , KIM S . Extracting a mobility model from real user traces[A]. INFOCOM[C]. 2006. 1-13.
[5]	YU Z , XING X . Enable smart location-based services by mining user trajectories[J]. Communications of the CCF (in Chinese), 2010,6(6): 23-29.
[6]	GHOSH J , BEAL M J , NGO H Q ,et al. On Profiling Mobility and Predicting Locations of Campus-Wide Wireless Network Users[R]. State University of New York at Buffalo, 2005.
[7]	LIN M , HSU W J . Mining GPS data for mobility patterns:a survey[EB/OL]. .
[8]	HSU W , DUTTA D , HELMY A . Structural analysis of user association patterns in university campus wireless LANs[J]. IEEE Transactions on Mobile Computing (TMC), 2012,11(11): 1734-1748.
[9]	HSU W , DUTTA D , HELMY A . Mining behavioral groups in large wireless LANs[A]. Proceedings of the 13th Annual ACM International Conference on Mobile Computing and Networking-MobiCom’07[C]. 2007. 338-341.
[10]	HSU W , HELMY A . On nodal encounter patterns in wireless LAN traces[J]. IEEE Transactions on Mobile Computing, 2010,9(11): 1563-1577.
[11]	NEWMAN M , GIRVAN M . Finding and evaluating community structure in networks[J]. Physical Review E, 2004,69(2):26113.
[12]	KAIRAM S , MACLEAN D , SAVVA M ,et al. GraphPrism[A]. Proceedings of the International Working Conference on Advanced Visual Interfaces-AVI 12[C]. 2012.498.
[13]	THAKUR G S , HELMY A , HSU W J . Similarity analysis and modeling in mobile societies:the missing link[A]. Proceedings of the 5th ACM Workshop on Challenged networks-CHANTS 10[C]. 2010.13.
[14]	MOON S , HELMY A . Understanding periodicity and regularity of nodal encounters in mobile networks:a spectral analysis[A]. Global Telecommunications Conference (GLOBECOM 2010)[C]. 2010. 1-5.
[15]	JAIN A , REDDY B . Node centrality in wireless sensor networks:Importance,applications and advances[A]. Advance Computing Conference (IACC)[C]. 2013. 127-131.
[16]	HENDERSON T , KOTZ D , ABYZOV I . The changing usage of a mature campus-wide wireless network[J]. Computer Networks, 2008,52(14): 2690-2712.
[17]	PAPADOPOULI M , SHEN H . Characterizing the duration and association patterns of wireless access in a campus[A]. Wireless Conference 2005-Next Generation Wireless and Mobile Communications and Services(European Wireless)[C]. 2005. 1-7.
[18]	KOTZ D , HENDERSON T . CRAWDAD:a community resource for archiving wireless data at dartmouth[J]. IEEE Pervasive Computing, 2005,4(4): 12-14.
[19]	Community resource for archiving wireless data at dartmouth[EB/OL]. .
[20]	MATHIEU B , HEYMANN S , JACOMY M . Gephi:an open source software for exploring and manipulating networks[A]. ICWSM[C]. 2009.

Metrics

Recommended 0

No Suggested Reading articles found!

指标名称	涵义	用途
频度中心(degree centrality)	连接数最多的节点	识别内部相连资源数
间接中心(betweenness centrality)	链接不相通的群组	减少不相通群组之间的活动
亲近中心(closeness centrality)	对于所有其他节点都很接近的节点	迅速获取或发布信息

数据集	AP数量	区域数	MAC总数	强关联节点数	强关联边数	聚集系数	采集时间
北京大学PKU1	1 388	—	52 297	4 060	83 350	0.225	2012.6.1～2012.6.30
北京大学PKU2	1 134	—	37 776	2 072	29 601	0.218	2013.7.15～2013.7.31
南加州大学USC^[19]	—	137	25 381	20 484	362 368	0.260	2006.1.25～2006.4.28

类别	均衡分散型	关系密集型	中心散射型
子图形状	10.3969/j.issn.1000-436x.2013.Z2.022.F001	10.3969/j.issn.1000-436x.2013.Z2.022.F001	10.3969/j.issn.1000-436x.2013.Z2.022.F001
代表性的子图	10.3969/j.issn.1000-436x.2013.Z2.022.F001	10.3969/j.issn.1000-436x.2013.Z2.022.F001	10.3969/j.issn.1000-436x.2013.Z2.022.F001
特征	节点数很多，节点的平均度数不大，3种不同的中心度量指标差异较大。节点的聚集指数较小	节点数比较多，节点平均度数大，两两节点间几乎都互连，3 种中心度量指标值几乎相同。节点的聚集指数较大	节点数比较多，节点的度数不均衡，有明显的频度中心节点。中心节点度数最大，平均聚集指数较小
聚集产生的原因	用户节点有明显的移动行为，节点通常出现在多个位置，没有驻留位置或各个节点驻留位置不同。没有固定的出现区域，通常出现在教学区	用户节点倾向于较少的移动，选择了共同的驻留位置。终端用户通常是同一个实验室的或在学生宿舍区邻近的位置	中心节点与其他节点行为模式有差别，中心节点在线时间长，井且有驻留位置。而其他节点移动性较大。常出现在图书馆和大的自习室
对无线网络管理和规划的启示	用户之间关联度相对较弱，位于间接中心的节点往往对多个区域的网络都有体验，无线规划时可以考虑参考它的意见	用户关联度高，建议网管系统做节点故障诊断时把相关节点也列出。规划时应有针对性地对此类用户的需求进行优化	频度中心用户是代表性用户，排查故障和做规划应了解此节点的信息和此终端用户的需求

Modularity analysisof users’mobile behavior in campus wireless network

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 7

References 20

Related Articles 15

Metrics

Recommended 0

[1]	Cheng ZHONG, Hui SUN. Parallel algorithm for sensitive sequence recognition from long-read genome data with high error rate [J]. Journal on Communications, 2023, 44(2): 160-171.
[2]	Xianchao ZHANG, Yao ZHAO, Haijun YE, Rui FAN. Intelligent transmit power control algorithm for the multi-user interference of wireless network [J]. Journal on Communications, 2022, 43(2): 15-21.
[3]	Haining YU, Hongli ZHANG, Xiangzhan YU, Jiaxing QU, Mengmeng GE. Privacy-preserving trajectory similarity computation method [J]. Journal on Communications, 2022, 43(11): 1-13.
[4]	Ye ZHU, Yilin YU, Yingchun GUO. HRDA-Net: image multiple manipulation detection and location algorithm in real scene [J]. Journal on Communications, 2022, 43(1): 217-226.
[5]	Qiuyang GU, Bao WU, Renyong CHI. Link prediction method based on the similarity of high path [J]. Journal on Communications, 2021, 42(7): 61-69.
[6]	Yongming HUANG, Chong ZHENG, Zhengming ZHANG, Xiaohu YOU. Research on mobile edge computing and caching in massive wireless communication network [J]. Journal on Communications, 2021, 42(4): 44-61.
[7]	Suxia ZHU, Shulun LIU, Guanglu SUN. Shape similarity differential privacy trajectory protection mechanism based on relative entropy and K-means [J]. Journal on Communications, 2021, 42(2): 113-123.
[8]	Xiaoli DAI, Shifeng LIU, Daqing GONG. Text similarity detection method based on NLP [J]. Journal on Communications, 2021, 42(10): 173-181.
[9]	Xiaorong ZHU,Peipei ZHANG. Fault detection and diagnosis method for heterogeneous wireless network based on GAN [J]. Journal on Communications, 2020, 41(8): 110-119.
[10]	Jiazhi REN,Hui TIAN,Shaoshuai FAN,Yuanzhuo LIN,Gaofeng NIE,Jilong LI. UAV deployment and caching scheme based on user preference prediction [J]. Journal on Communications, 2020, 41(6): 1-13.
[11]	Debin WEI,Ting SHEN,Li YANG,Yaowen QI. Network queue scheduling algorithm based on self-similar traffic level grading prediction [J]. Journal on Communications, 2020, 41(4): 182-189.
[12]	Liming PU,Shuxin LIU,Ruihao DING,Kai WANG. Heterogeneous executor scheduling algorithm for mimic cloud service [J]. Journal on Communications, 2020, 41(3): 17-24.
[13]	Zhihong QIAN, Yinuo FENG, Jiani SUN, Xue WANG. Access selection algorithm for heterogeneous wireless network based on DA optimized fuzzy neural network [J]. Journal on Communications, 2020, 41(12): 118-127.
[14]	Zhiguo SUN, Xinyue REN, Zengmao CHEN, Ming DIAO. Cooperative spectrum sensing method and performance analysis based on similarity between evidences [J]. Journal on Communications, 2020, 41(12): 139-147.
[15]	Bonan YIN,Mugen PENG,Chenxi LIU. Analysis of UAV wireless network coverage and handover performance [J]. Journal on Communications, 2020, 41(11): 22-29.