مقاله انگلیسی رایگان در مورد شناسایی نزدیکی انعطاف پذیر و حفظ حریم خصوصی در شبکه اجتماعی سیار – الزویر 2018

Driven by the rapid development of mobile Internet and social networks [1], the representatives of the social network sites like Facebook [2] and Twitter [3,4] grow fast. And the number of users is growing at an alarming rate. Nowadays, more and more users use the proximity detection service such as ‘‘people in the vicinity’’, ‘‘nearby restaurants’’, which make the proximity detection becomes a basic service in mobile social network. The traditional proximity detection methods require users to submit their location information to the location server in order to find their neighbors. This approach is unsafe when the location server is an untrusted one. For instance, if the location server has security vulnerability or the insider abuses users’ location information, the location privacy of users will be disclosed. In order to solve the problems of traditional proximity detection methods, we propose a novel privacy-preserving proximity detection method. Specifically, instead of using users’ locations to find their neighbors, the proposed method takes beacon signals as a reference of neighbor discovery. More specifically, users can find their neighbors by determining whether users’ nearby reference lists have a common item. In addition, we also present two distributed mechanisms – Beacon Node Rotating Mechanism and Beacon Node Competition Mechanism – to determine the ways of transmitting signals of beacon nodes. Specifically, in the presented mechanisms, each mobile user upgrades and services as a beacon node. For facilitating other users to find their neighbors, these beacon nodes send beacon signals (i.e., the references) periodically.