توضیحات
ABSTRACT
With the popularity of mobile social network, proximity detection has become a fundamental service. For the traditional proximity detection methods, users need to upload their locations to a location server so that they can find their neighbors by calculating relative distances among them. It will cause significant privacy concerns when the location server is an untrusted one. To solve this problem, we propose a proximity detection method which is based on the transfer of neighbor relation. Specifically, each request user in our paper only needs to submit a nearby reference list to the social network server (SNS). After that, the SNS searches the neighbors of the request user by judging whether their nearby reference lists have a common item. Moreover, we present two mechanisms to determine the ways of transmitting signals of beacon nodes, i.e., Beacon Node Rotating Mechanism and Beacon Node Competition Mechanism, respectively. Besides, we experimentally demonstrate the effectiveness and .feasibility of the proposed method
INTRODUCTION
Driven by the rapid development of mobile Internet and social networks, the representatives of the social network siteslike Facebook and Twitter 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.
Year: ۲۰۱۸
Publisher : ELSEVIER
By : Ayong Ye , Qiuling Chen, Li Xu, Wei Wu
File Information: English Language/ 13 Page / size: 1.29 MB
سال : ۱۳۹۶
ناشر : ELSEVIER
کاری از : Ayong Ye، Qiuling Chen، Li Xu، Wei Wu
اطلاعات فایل : زبان انگلیسی / 13 صفحه / حجم : MB 1.29
نقد و بررسیها
هنوز بررسیای ثبت نشده است.