TRack others if you can: localized proximity detection for mobile networks

For a set of mobile users with designated friendship relations, it is a recurring issue to keep track of whether some friends appear in the vicinity of a given user. While both distributed and centralized solutions for proximity detection have been proposed, the cost metrics for evaluating these pro...

Full description

Saved in:
Bibliographic Details
Published in:Wireless networks Vol. 20; no. 6; pp. 1477 - 1494
Main Authors: Zhang, Chi, Luo, Jun
Format: Journal Article
Language:English
Published: Boston Springer US 01.08.2014
Springer
Springer Nature B.V
Subjects:
Algorithms
Analysis
Applied sciences
Communication
Communications Engineering
Computer Communication Networks
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Electrical Engineering
Energy consumption
Energy efficiency
Engineering
Equipments and installations
Exact sciences and technology
Exchange
Friendship
Information retrieval. Graph
IT in Business
Mathematical analysis
Message passing
Messages
Mobile radiocommunication systems
Networks
Proposals
Proximity
Radiocommunications
Sensors
Social networks
Software
Studies
Telecommunications
Telecommunications and information theory
Tessellation
Theoretical computing
Wireless networks
Proximity detection
Mobile networks
Energy efficiency
Spatial tessellation
Energy consumption
Proximity
Updating
Distributed system
Energy savings
Friendship
Message passing
Graph connectivity
Efficiency
Wireless network
Metric
Tiling
Graph method
Counting
Mobile computing
ISSN:1022-0038, 1572-8196
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For a set of mobile users with designated friendship relations, it is a recurring issue to keep track of whether some friends appear in the vicinity of a given user. While both distributed and centralized solutions for proximity detection have been proposed, the cost metrics for evaluating these proposals are always based on counting the number of message (e.g., query or update) exchanges. However, as mobile users often rely on wireless networks to maintain their connectivity, the cost incurred by any message passing is strongly affected by the distance between the sender and receiver. In this paper, we propose TRack Others if You can (TROY) as a novel distributed solution for proximity detection. Extending the principle of spatial tessellations, TROY incurs only localized message exchanges and is thus superior to existing proposals in terms of more realistic cost metrics that take into account the actual energy consumption of message passing. Moreover, our spatial tessellations inspired analytical framework allows for a meaningful comparison with an existing work. Finally, we use extensive experiments to validate the efficiency of TROY.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1022-0038
1572-8196
DOI:10.1007/s11276-014-0690-5