Buddy tracking - Efficient proximity detection among mobile friends

Arnon Amir, Alon Efrat, Jussi Myllymaki, Lingeshwaran Palaniappan, Kevin Wampler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

26 Citations (Scopus)

Abstract

Global positioning systems (GPS) and mobile phone networks are making it possible to track individual users with an increasing accuracy. It is natural to ask whether one can use this information to maintain social networks. Here each user wishes to be informed whenever one of a list of other users, called the user's friends, appears in the user's vicinity. In contrast to more traditional positioning based algorithms, the computation here depends not only on the user's own position on a static map, but also on the dynamic position of the user's friends. Hence it requires both communication and computation resources. The computation can be carried out either between the individual users in a peer-to-peer fashion or by centralized servers where computation and data can be collected at one central location. In the peer-to-peer model, a novel algorithm for minimizing the number of location update messages between pairs of friends is presented. We also present an efficient algorithm for the centralized model, based on region hierarchy and quadtrees. The paper provides an analysis of the two algorithms, compares them with a naive approach, and evaluates them using the IBM City Simulator system.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages298-309
Number of pages12
Volume1
StatePublished - 2004
EventIEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies - Hongkong, China
Duration: Mar 7 2004Mar 11 2004

Other

OtherIEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
CountryChina
CityHongkong
Period3/7/043/11/04

Fingerprint

Information use
Mobile phones
Global positioning system
Servers
Simulators
Communication

Keywords

  • Dynamic nearest neighbors
  • Global positioning systems
  • Location based services
  • Social networks
  • Strips algorithm

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Amir, A., Efrat, A., Myllymaki, J., Palaniappan, L., & Wampler, K. (2004). Buddy tracking - Efficient proximity detection among mobile friends. In Proceedings - IEEE INFOCOM (Vol. 1, pp. 298-309)

Buddy tracking - Efficient proximity detection among mobile friends. / Amir, Arnon; Efrat, Alon; Myllymaki, Jussi; Palaniappan, Lingeshwaran; Wampler, Kevin.

Proceedings - IEEE INFOCOM. Vol. 1 2004. p. 298-309.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Amir, A, Efrat, A, Myllymaki, J, Palaniappan, L & Wampler, K 2004, Buddy tracking - Efficient proximity detection among mobile friends. in Proceedings - IEEE INFOCOM. vol. 1, pp. 298-309, IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies, Hongkong, China, 3/7/04.
Amir A, Efrat A, Myllymaki J, Palaniappan L, Wampler K. Buddy tracking - Efficient proximity detection among mobile friends. In Proceedings - IEEE INFOCOM. Vol. 1. 2004. p. 298-309
Amir, Arnon ; Efrat, Alon ; Myllymaki, Jussi ; Palaniappan, Lingeshwaran ; Wampler, Kevin. / Buddy tracking - Efficient proximity detection among mobile friends. Proceedings - IEEE INFOCOM. Vol. 1 2004. pp. 298-309
@inproceedings{67226d4eabef426ab3d4d5fadc9967d6,
title = "Buddy tracking - Efficient proximity detection among mobile friends",
abstract = "Global positioning systems (GPS) and mobile phone networks are making it possible to track individual users with an increasing accuracy. It is natural to ask whether one can use this information to maintain social networks. Here each user wishes to be informed whenever one of a list of other users, called the user's friends, appears in the user's vicinity. In contrast to more traditional positioning based algorithms, the computation here depends not only on the user's own position on a static map, but also on the dynamic position of the user's friends. Hence it requires both communication and computation resources. The computation can be carried out either between the individual users in a peer-to-peer fashion or by centralized servers where computation and data can be collected at one central location. In the peer-to-peer model, a novel algorithm for minimizing the number of location update messages between pairs of friends is presented. We also present an efficient algorithm for the centralized model, based on region hierarchy and quadtrees. The paper provides an analysis of the two algorithms, compares them with a naive approach, and evaluates them using the IBM City Simulator system.",
keywords = "Dynamic nearest neighbors, Global positioning systems, Location based services, Social networks, Strips algorithm",
author = "Arnon Amir and Alon Efrat and Jussi Myllymaki and Lingeshwaran Palaniappan and Kevin Wampler",
year = "2004",
language = "English (US)",
volume = "1",
pages = "298--309",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Buddy tracking - Efficient proximity detection among mobile friends

AU - Amir, Arnon

AU - Efrat, Alon

AU - Myllymaki, Jussi

AU - Palaniappan, Lingeshwaran

AU - Wampler, Kevin

PY - 2004

Y1 - 2004

N2 - Global positioning systems (GPS) and mobile phone networks are making it possible to track individual users with an increasing accuracy. It is natural to ask whether one can use this information to maintain social networks. Here each user wishes to be informed whenever one of a list of other users, called the user's friends, appears in the user's vicinity. In contrast to more traditional positioning based algorithms, the computation here depends not only on the user's own position on a static map, but also on the dynamic position of the user's friends. Hence it requires both communication and computation resources. The computation can be carried out either between the individual users in a peer-to-peer fashion or by centralized servers where computation and data can be collected at one central location. In the peer-to-peer model, a novel algorithm for minimizing the number of location update messages between pairs of friends is presented. We also present an efficient algorithm for the centralized model, based on region hierarchy and quadtrees. The paper provides an analysis of the two algorithms, compares them with a naive approach, and evaluates them using the IBM City Simulator system.

AB - Global positioning systems (GPS) and mobile phone networks are making it possible to track individual users with an increasing accuracy. It is natural to ask whether one can use this information to maintain social networks. Here each user wishes to be informed whenever one of a list of other users, called the user's friends, appears in the user's vicinity. In contrast to more traditional positioning based algorithms, the computation here depends not only on the user's own position on a static map, but also on the dynamic position of the user's friends. Hence it requires both communication and computation resources. The computation can be carried out either between the individual users in a peer-to-peer fashion or by centralized servers where computation and data can be collected at one central location. In the peer-to-peer model, a novel algorithm for minimizing the number of location update messages between pairs of friends is presented. We also present an efficient algorithm for the centralized model, based on region hierarchy and quadtrees. The paper provides an analysis of the two algorithms, compares them with a naive approach, and evaluates them using the IBM City Simulator system.

KW - Dynamic nearest neighbors

KW - Global positioning systems

KW - Location based services

KW - Social networks

KW - Strips algorithm

UR - http://www.scopus.com/inward/record.url?scp=8344271254&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=8344271254&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:8344271254

VL - 1

SP - 298

EP - 309

BT - Proceedings - IEEE INFOCOM

ER -