TY - JOUR

T1 - Efficient Proximity Detection among Mobile Users via SelfTuning Policies

A1 - Yiu,Man Lung

A1 - Hou U,Leong

A1 - Saltenis,Simonas

A1 - Tzoumas,Kostas

AU - Yiu,Man Lung

AU - Hou U,Leong

AU - Saltenis,Simonas

AU - Tzoumas,Kostas

PB - VLDB Endowment

PY - 2010/9

Y1 - 2010/9

N2 - Given a set of users, their friend relationships, and a distance<br/>threshold per friend pair, the proximity detection problem is to<br/>find each pair of friends such that the Euclidean distance between<br/>them is within the given threshold. This problem plays an essential<br/>role in friend-locator applications and massively multiplayer online<br/>games. Existing proximity detection solutions either incur substantial<br/>location update costs or their performance does not scale well to<br/>a large number of users. Motivated by this, we present a centralized<br/>proximity detection solution that assigns each mobile client with a<br/>mobile region. We then design a self-tuning policy to adjust the<br/>radius of the region automatically, in order to minimize communication<br/>cost. In addition, we analyze the communication cost of our<br/>solutions, and provide valuable insights on their behaviors. Extensive<br/>experiments suggest that our proposed solution is efficient and<br/>robust with respect to various parameters.

AB - Given a set of users, their friend relationships, and a distance<br/>threshold per friend pair, the proximity detection problem is to<br/>find each pair of friends such that the Euclidean distance between<br/>them is within the given threshold. This problem plays an essential<br/>role in friend-locator applications and massively multiplayer online<br/>games. Existing proximity detection solutions either incur substantial<br/>location update costs or their performance does not scale well to<br/>a large number of users. Motivated by this, we present a centralized<br/>proximity detection solution that assigns each mobile client with a<br/>mobile region. We then design a self-tuning policy to adjust the<br/>radius of the region automatically, in order to minimize communication<br/>cost. In addition, we analyze the communication cost of our<br/>solutions, and provide valuable insights on their behaviors. Extensive<br/>experiments suggest that our proposed solution is efficient and<br/>robust with respect to various parameters.

UR - http://portal.acm.org/citation.cfm?id=1920966

JO - Proceedings of the VLDB Endowment

JF - Proceedings of the VLDB Endowment

SN - 2150-8097

IS - 1-2

VL - 3

SP - 985

EP - 996

ER -