Recommending Friends Instantly in Location-based Mobile Social Networks

Differently from the general online social network(OSN),locationbased mobile social network(LMSN),which seamlessly integrates mobile computing and social computing technologies,has unique characteristics of temporal,spatial and social correlation.Recommending friends instantly based on current location of users in the real world has become increasingly popular in LMSN.However,the existing friend recommendation methods based on topological structures of a social network or non-topological information such as similar user profiles cannot well address the instant making friends in the real world.In this article,we analyze users' check-in behavior in a real LMSN site named Gowalla.According to this analysis,we present an approach of recommending friends instantly for LMSN users by considering the real-time physical location proximity,offline behavior similarity and friendship network information in the virtual community simultaneously.This approach effectively bridges the gap between the offline behavior of users in the real world and online friendship network information in the virtual community.Finally,we use the real user check-in dataset of Gowalla to verify the effectiveness of our approach.

Community Discovery with Location-Interaction Disparity in Mobile Social Networks

With the fast-growth of mobile social network, people＇ s interactions are frequently marked with location information, such as longitude and latitude of visited base station. This boom of data has led to considerable interest in research fields such as user behavior mining, trajectory discovery and social demographics. However, there is little research on community discovery in mobile social networks, and this is the problem this work tackles with. In this work, we take advantage of one simple property that people in different locations often belong to different social circles in order to discover communities in these networks. Based on this property, which we referred to as Location-lnteraction Disparity （LID）, we proposed a state network and then define a quality function evaluating community detection results. We also propose a hybrid community- detection algorithm using LID tor discovering location-based communities effectively and efficiently. Experiments on synthesis networks show that this algorithm can run effectively in time and discover communities with high precision. In realworld networks, the method reveals people＇s different social circles in different places with high efficiency.

Fractal Analysis of Mobile Social Networks

Fractal and self similarity of complex networks have attracted much attention in recent years. The fractal dimension is a useful method to describe the fractal property of networks. However, the fractal features of mobile social networks （MSNs） are inadequately investigated. In this work, a box-covering method based on the ratio of excluded mass to closeness centrality is presented to investigate the fractal feature of MSNs. Using this method, we find that some MSNs are fractal at different time intervals. Our simulation results indicate that the proposed method is available for analyzing the fractal property of MSNs.

APPOW:An Advanced Routing Protocol Based on Parameters Optimization in the Weighted Mobile Social Network

Due to the increasing number of wireless mobile devices,the possibility of mobile communications without infrastructure becomes a reality.The Decentralized Mobile Social Network(DMSN) is a paradigm where nodes can move freely and organize themselves arbitrarily.Routing in these environments is difficult for the reason of the rapid changes of the social relationship graph's topology.Meanwhile,the social ties among nodes change overtime.Therefore,an efficient data forwarding mechanism should be considered over the temporal weighted relationship graph.In this paper,an Advanced routing Protocol based on Parameters Optimization in the Weighted mobile social network(APPOW) is proposed to improve the delivery success ratio and reduce the cost of exchanging information.APPOW combines the normalized relative weights of three local social metrics,i.e.,LinkRank,similarity and contact strength,to select the next relay node.The weights of the three metrics are derived by pair-wise learning algorithm.The result shows that APPOW outperforms the state-ofthe-art SimBet Routing in delivering message and significantly reduces the average hops.Additionally,the delivery performance of APPOW is close to Epidemic Routing but without message duplications.

Research on the Association of Mobile Social Network Users Privacy Information Based on Big Data Analysis

The issue of privacy protection for mobile social networks is a frontier topic in the field of social network applications.The existing researches on user privacy protection in mobile social network mainly focus on privacy preserving data publishing and access control.There is little research on the association of user privacy information,so it is not easy to design personalized privacy protection strategy,but also increase the complexity of user privacy settings.Therefore,this paper concentrates on the association of user privacy information taking big data analysis tools,so as to provide data support for personalized privacy protection strategy design.

Personalized Privacy Protecting Model in Mobile Social Network

With the rapid development of the new generation of information technology,the analysis of mobile social network big data is getting deeper and deeper.At the same time,the risk of privacy disclosure in social network is also very obvious.In this paper,we summarize the main access control model in mobile social network,analyze their contribution and point out their disadvantages.On this basis,a practical privacy policy is defined through authorization model supporting personalized privacy preferences.Experiments have been conducted on synthetic data sets.The result shows that the proposed privacy protecting model could improve the security of the mobile social network while keeping high execution efficiency.

Mobile Social Net work——Research and Implementation of Mobile Twitter System

This paper researched and analyzedweb2.0 technology and mobile social network.Then researched and implemented the mobile twitter system.This paper introduces the function and modules of mobile client and PC server respectively.We also had the user experience and system test which are wrote in this paper.

User Profile System Based on Sentiment Analysis for Mobile Edge Computing

Emotions of users do not converge in a single application but are scattered across diverse applications.Mobile devices are the closest media for handling user data and these devices have the advantage of integrating private user information and emotions spread over different applications.In this paper,we first analyze user profile on a mobile device by describing the problem of the user sentiment profile system in terms of data granularity,media diversity,and server-side solution.Fine-grained data requires additional data and structural analysis in mobile devices.Media diversity requires standard parameters to integrate user data from various applications.A server-side solution presents a potential risk when handling individual privacy information.Therefore,in order to overcome these problems,we propose a general-purposed user profile system based on sentiment analysis that extracts individual emotional preferences by comparing the difference between public and individual data based on particular features.The proposed system is built based on a sentiment hierarchy,which is created by using unstructured data on mobile devices.It can compensate for the concentration of single media,and analyze individual private data without the invasion of privacy on mobile devices.

Security Threat and Data Consumption as Mojor Nuisance of Social Media on Wi-Fi Network

This research is about the nuisances of social media applications on a Wi-Fi network at a university campus in Ghana. The aim was to access the security risk on the network, the speed of the network, and the data consumption of those platforms on the network. Network Mapper (Nmap Zenmap) Graphical User Interface 7.80 application was used to scan the various social media platforms to identify the protocols, ports, services, etc. to enable in accessing the vulnerability of the network. Data consumption of users’ mobile devices was collected and analyzed. Device Accounting (DA) based on the various social media applications was used. The results of the analysis revealed that the network is prone to attacks due to the nature of the protocols, ports, and services on social media applications. The numerous users with average monthly data consumption per user of 4 gigabytes, 300 megabytes on social media alone are a clear indication of high traffic as well as the cost of maintaining the network. A URL filtering of the social media websites was proposed on Rockus Outdoor AP to help curb the nuisance.

Mobile Applications Provisioning Using Bluetooth Wireless Technology

In this paper, we propose a cheap means for propagating mobile application using Bluetooth, a convenient short range wireless technology. Today, one of the main problems about mobile technology is about implementing automatically the software in the multiple and various type of phones devices, irrespective of the phone model (Nokia, Samsung, iPhone, etc.). There are many ways of doing OTA like by SMS. This approach allows providing an http download link by SMS but, we are limited by the maximum size one can have to build an application and send it trough this means. This approach is also expensive because data sources are expensive. Within the context of mobile social networking and proximity marketing, we come up with an original way of provisioning mobile applications using Bluetooth. We use anybody who is already a subscriber of an application to become an ambassador of it. The application is self-replicating and distributing in itself and sending back results. It ethically acts like a virus or a disease. A prototype is built to validate the proposed methodology.

Discovering Typed Communities in Mobile Social Networks

Mobile social networks, which consist of mobile users who communicate with each other using cell phones are reflections of people＇s interactions in social lives. Discovering typed communities （e.g., family communities or corporate communities） in mobile social networks is a very promising problem. For example, it can help mobile operators to determine the target users for precision marketing. In this paper we propose discovering typed communities in mobile social networks by utilizing the labels of relationships between users. We use the user logs stored by mobile operators, including communication and user movement records, to collectively label all the relationships in a network, by employing an undirected probabilistic graphical model, i.e., conditional random fields. Then we use two methods to discover typed communities based on the results of relationship labeling： one is simply retaining or cutting relationships according to their labels, and the other is using sophisticated weighted community detection algorithms. The experimental results show that our proposed framework performs well in terms of the accuracy of typed community detection in mobile social networks.

Energy Efficient Social Routing Framework for Mobile Social Sensing Networks

Mobile social sensing network is one kind of emerging networks in which sensing tasks are performed by mobile users and sensing data are shared and collected by leveraging the intermittent inter-contacts among mobile users. Traditional ad hoc routing protocols are inapplicable or perform poorly for data collection or data sharing in such mobile social networks because nodes are seldom fully connected. In recent years, many routing protocols （especially social-based routing） are proposed to improve the delivery ratio in mobile social networks, but most of them do not consider the load of nodes thus may lead to unbalanced energy consumption among nodes. In this paper, we propose a simple Energy Efficient framework for Social-based Routing （EE-SR） in mobile social sensing networks to balance the load of nodes while maintaining the delivery ratio within an acceptable range by limiting the chances of forwarding in traditional social-based routing. Furthermore, we also propose an improved version of EE-SR to dynamically adjust the controlling parameter. Simulation results on real-life mobile traces demonstrate the efficiency of our proposed framework.

Cellular traffic offloading utilizing set-cover based caching in mobile social networks

To cope with the explosive data demands, offloading cellular traffic through mobile social networks（MSNs） has become a promising approach to alleviate traffic load. Indeed, the repeated data transmission results in a great deal of unnecessary traffic. Existing solutions generally adopt proactive caching and achieve traffic shifting by exploiting opportunistic contacts. The key challenge to maximize the offloading utility needs leveraging the trade-off between the offloaded traffic and the users＇ delay requirement. Since current caching scheme rarely address this challenge, in this paper, we first quantitatively interpret the offloading revenues on the cellular operator side associated with the scale of caching users, then develop a centralized caching protocol to maximize the offloading revenues, which includes the selective algorithm of caching location based on set-cover, the cached-data dissemination strategy based on multi-path routing and the cache replacement policy based on data popularity. The experimental results on real-world mobility traces show that the proposed caching protocol outperforms existing schemes in offloading scenario.

Trust-Based Context-Aware Mobile Social Network Service Recommendation

The service recommendation mechanism as a key enabling technology that provides users with more proactive and personalized service is one of the important research topics in mobile social network （MSN）. Meanwhile, MSN is susceptible to various types of anonymous information or hacker actions. Trust can reduce the risk of interaction with unknown entities and prevent malicious attacks. In our paper, we present a trust-based service recommendation algorithm in MSN that considers users＇ similarity and friends＇ familiarity when computing trustworthy neighbors of target users. Firstly, we use the context information and the number of co-rated items to define users＇ similarity. Then, motivated by the theory of six degrees of space, the friend familiarity is derived by graph-based method. Thus the proposed methods are further enhanced by considering users＇ context in the recommendation phase. Finally, a set of simulations are conducted to evaluate the accuracy of the algorithm. The results show that the friend familiarity and user similarity can effectively improve the recommendation performance, and the friend familiarity contributes more than the user similarity.

TCP performance evaluation over AODV and DSDV in RW and SN mobility models

This paper presents evaluation and comparison of the TCP performance in different mobile scenarios generated by Random Waypoint (RW) and Social Network (SN) mobility models. To our knowledge, TCP performance in SN mobility is discussed for the first time. The impact of AODV and DSDV routing protocols on the TCP goodput, delay and drop rate per- formance is also discussed. Extensive simulation results and analysis showed that TCP has better performance over AODV than over DSDV and has more stable performance in SN mobility than in RW mobility. We suggest using more mobility models, in particular, such as SN, in the evaluations of the transport layer or routing layer protocols because the mobility patterns have impacts on the protocol performance.

Socialization, Traffic Distribution and E-Commerce Trends:An Interpretation of the “Pinduoduo” Phenomenon

The article takes China’s e-commerce as the research object.Starting from the macro level of e-commerce development and taking the rapid rise of“Pinduoduo”as an example,it discusses the“traffic dilemma”and its influence in the traditional e-commerce platform.This discovers the internal mechanism of mobile e-commerce to solve the problem of traffic distribution mechanism by socialization.After that,this study compares the difference between traditional e-commerce and social-commerce systematically,and concludes that traditional e-commerce platform is a necessary process of the development of social-commerce.Socialization is an important trend of the development of traditional e-commerce and social-commerce will promote the realization of C2B model.

Seed Selection for Data Offloading Based on Social and Interest Graphs

The explosive growth of mobile data demand is becoming an increasing burden on current cellular network.To address this issue,we propose a solution of opportunistic data offloading for alleviating overloaded cellular traffic.The principle behind it is to select a few important users as seeds for data sharing.The three critical steps are detailed as follows.We first explore individual interests of users by the construction of user profiles,on which an interest graph is built by Gaussian graphical modeling.We then apply the extreme value theory to threshold the encounter duration of user pairs.So,a contact graph is generated to indicate the social relationships of users.Moreover,a contact-interest graph is developed on the basis of the social ties and individual interests of users.Corresponding on different graphs,three strategies are finally proposed for seed selection in an aim to maximize overloaded cellular data.We evaluate the performance of our algorithms by the trace data of real-word mobility.It demonstrates the effectiveness of the strategy of taking social relationships and individual interests into account.

基于区块链的用户自定义位置共享方案

针对移动社交网络位置共享服务存在的隐私泄漏问题,提出基于区块链的用户自定义位置共享(BUDLS)方案.基于区块链实现位置信息分布式管理,防止中央服务器收集大量用户隐私,增强用户位置信息的可控性.设计基于公钥数字签名和同态加密相结合的加密机制,防止位置信息被攻击者非法获取.定义灵活的访问控制策略,根据用户需要提供可靠的服务.安全分析验证结果显示,BUDLS方案满足隐私安全目标.仿真实验结果表明,相比传统方案,BUDLS方案降低了时间成本,提高了位置查询的准确性,有效保护了移动社交网络平台用户的位置隐私.

中国与OECD国家留学生流动网络的空间格局与影响机制

构建和推动高质量人才环流是中国国际人才培养和人才磁石型国家建设的重要途径。本文基于2019年中国与38个经济合作与发展组织(OECD)成员国之间高等学校留学生流动数据,构建有向加权的国际人才流动网络,并运用社会网络分析探讨国际人才流动的空间格局与影响机制。结果显示:① 39个国家之间留学生交流密切,区域组团明显,形成北美亚太组团、南美欧洲组团、北欧波罗的海组团、捷克斯洛伐克组团。中国和美国是国际人才交流的中心,同时中国、英国、德国、美国、法国也是人才流动的门户与枢纽。②各国家在输出和接收留学生上存在非对称性。中国留学生流出量占总网络的近50%,而OECD各国输出量相对均衡。美国、英国、澳大利亚成为留学生流入量排名前3,中国以7.17%的占比居第四。③国家的开放程度、教育质量、经济水平对留学生流动的影响均存在发送者效应和接收者效应,地理、语言文化、贸易方面的邻近可促进留学生流动。结构依赖是留学生流动的重要驱动力,其中互惠效应、择优依附效应与传递闭合效应最为显著,对于外生动力具有一定的替代性。中国与OECD国家间的人才联系仍有较大的提升空间,需从个体属性、多维邻近性和结构内生性方面进行优化,促进区域内人才更加扁平化多元化交流发展。