## Buddy Tracking -- Efficient Proximity Detection Among Mobile Friends (2004)

Citations: | 16 - 1 self |

### BibTeX

@MISC{Amir04buddytracking,

author = {Arnon Amir and Alon Efrat and Jussi Myllymaki and Kevin Wampler and et al.},

title = {Buddy Tracking -- Efficient Proximity Detection Among Mobile Friends},

year = {2004}

}

### OpenURL

### 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.

### Citations

1183 |
The Design and Analysis of Spatial Data Structures
- Samet
- 1990
(Show Context)
Citation Context ...ains ≤ 1 users, or its edge-length is ≤ R, stop. Otherwise, replace c with 4 equal-size squares R1, R2, R3, R4, representing its four quadrants. This division imposes a quadtree data structure T (see =-=[25, 26]-=-), with the property that every leaf-region whose size is larger than R contains at most one user. We call a region containing more than a single user a live region. Hence live regions are always of s... |

981 |
Computational Geometry: Algorithms and Applications
- BERG, KREVELD, et al.
- 1997
(Show Context)
Citation Context ...e show how to update S(a, bi) in D(a) in time O(log 2 n). Here n is the number of friends of a. The data structure is based on the standard dual transformation, defined in Computational Geometry (see =-=[5]-=-). It transforms a point p = (a, b) in the primal plane to the line p∗ = ax + b in the dual plane, and the line ℓ : y = mx + n in the primal plane to the into two sets: U, point ℓ∗ = (m, −n) in the du... |

725 |
Wireless Integrated Network Sensors
- Pottie, Kaiser
- 2000
(Show Context)
Citation Context ...ishes to. Energy efficiency. In general, battery drainage of small mobile devices resulting from communications is far more significant than the energy needed for computing. For example, it was shown =-=[19]-=- that under Rayleigh fading and fourth power distance loss, the energy cost of transmitting 1 KB a distance of 100 m is approximately the same as executing three million instructions on a 100 MIPS/W p... |

257 | Modeling and querying moving objects
- Sistla, Wolfson, et al.
- 1997
(Show Context)
Citation Context ...dex. This however requires continuous updating of the locations of all users, which would necessitate a huge number of location messages. Trajectory-based algorithms are becoming increasingly popular =-=[20, 21]-=-. Storing and indexing trajectories facilitates not only efficient spatial range queries, but also time-and-space range queries [2]. See also [1, 22]. The paper [23] discusses time-parameterized bound... |

232 | Data structures for mobile data
- Basch, Guibas, et al.
- 1999
(Show Context)
Citation Context ...em, the vicinity radius R and the desired tolerance ε, but also on the nature of their motion trajectories and relations between them. In the computational geometry literature, the kinetic model (see =-=[9, 13]-=-) is a common paradigm for evaluating the efficiency of algorithms for maintaining dynamic structures. In this paradigm, the role of the evaluated algorithm is to maintain some geometric properties fo... |

170 | Indexing Moving Points
- Agarwal, Arge, et al.
- 2000
(Show Context)
Citation Context .... Trajectory-based algorithms are becoming increasingly popular [20, 21]. Storing and indexing trajectories facilitates not only efficient spatial range queries, but also time-and-space range queries =-=[2]-=-. See also [1, 22]. The paper [23] discusses time-parameterized bounding rectangles and extends trajectory information with expiration information. There is a large body of literature on maintaining a... |

159 | Updating and querying databases that track mobile units,” Distributed and Parallel Databases
- Wolfson, Sistla, et al.
- 1999
(Show Context)
Citation Context ...jects is discussed in [3], and the maintenance of the dynamic Voronoi diagram of a set of moving points in a plane is presented in [14]. For maintaining and querying a database of moving objects, see =-=[28]-=-. The paper [18] suggested the method of safety zones, in a method similar to the one suggested in our paper. The idea is to divide the plane into regions with the property that as long as point do no... |

150 | The buffer tree: A new technique for optimal i/o-algorithms - Arge - 1995 |

91 | Kinetic data structures — a state of the art report
- Guibas
- 1998
(Show Context)
Citation Context ...em, the vicinity radius R and the desired tolerance ε, but also on the nature of their motion trajectories and relations between them. In the computational geometry literature, the kinetic model (see =-=[9, 13]-=-) is a common paradigm for evaluating the efficiency of algorithms for maintaining dynamic structures. In this paradigm, the role of the evaluated algorithm is to maintain some geometric properties fo... |

90 | BIndexing of moving objects for location-based services
- Saltenis, Jensen
- 2002
(Show Context)
Citation Context ... becoming increasingly popular [20, 21]. Storing and indexing trajectories facilitates not only efficient spatial range queries, but also time-and-space range queries [2]. See also [1, 22]. The paper =-=[23]-=- discusses time-parameterized bounding rectangles and extends trajectory information with expiration information. There is a large body of literature on maintaining a specific property of moving objec... |

52 | Dynamic planar convex hull
- Brodal, Jacob
- 2002
(Show Context)
Citation Context ... ∗ in a dynamic way, so that their intersection with a query line, as well as deleting and inserting points from and to the convex hulls, can be accomplished efficiently. We use the data structure of =-=[11]-=-, where an update can be handled in (amortized) O(log n) time and a query can be done in O(log n) time. Once two friends entered the vicinity of each other, the algorithm needs to detect when they get... |

50 | Proximity problems on moving points - Basch, Guibas, et al. - 1997 |

44 | On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane
- DP, Kedem, et al.
- 1992
(Show Context)
Citation Context ...zed algorithm for maintaining the binary space partition of moving objects is discussed in [3], and the maintenance of the dynamic Voronoi diagram of a set of moving points in a plane is presented in =-=[14]-=-. For maintaining and querying a database of moving objects, see [28]. The paper [18] suggested the method of safety zones, in a method similar to the one suggested in our paper. The idea is to divide... |

40 |
A Quadtree Based Dynamic Attribute Indexing Method. The Computer Journal
- Tayeb, Ulusoy, et al.
- 1997
(Show Context)
Citation Context ...int do not enter safety zone, no message need to be exchanged between the points. Various algorithms have been provided for indexing moving points. A quadtree based algorithm for indexing is given by =-=[27]-=-. Their main idea is to use a linear function of time for each of the dynamic attributes of the object, and to provide methods to regenerate the quadtree. An R ∗ -tree based algorithm is given by [24]... |

35 |
STAR-Tree: An efficient self-adjusting index for moving objects
- Procopiuc, Agarwal, et al.
(Show Context)
Citation Context ...ased algorithms are becoming increasingly popular [20, 21]. Storing and indexing trajectories facilitates not only efficient spatial range queries, but also time-and-space range queries [2]. See also =-=[1, 22]-=-. The paper [23] discusses time-parameterized bounding rectangles and extends trajectory information with expiration information. There is a large body of literature on maintaining a specific property... |

34 | Dynamic planar convex hull operations in near-logarithmic amortized time
- Chan
- 1999
(Show Context)
Citation Context ... a dynamic way, so that their intersection with a query line, as well as deleting and inserting points from and to the convex hulls, can be accomplished efficiently. We use the data structure of Chan =-=[6]-=-, where an update can be handled in (amortized time) O(log 1+δ n) time and a query can be done in O(log n) time. Here δ is a arbitrary fixed small positive constant. 2.2 What to do when they meet ? On... |

23 | Querying the trajectories of on-line mobile objects
- Pfoser, Jensen
- 2001
(Show Context)
Citation Context ...dex. This however requires continuous updating of the locations of all users, which would necessitate a huge number of location messages. Trajectory-based algorithms are becoming increasingly popular =-=[20, 21]-=-. Storing and indexing trajectories facilitates not only efficient spatial range queries, but also time-and-space range queries [2]. See also [1, 22]. The paper [23] discusses time-parameterized bound... |

20 | Kinetic binary space partitions for intersecting segments and disjoint triangles
- Agarwal, Erickson, et al.
- 1998
(Show Context)
Citation Context ...re is a large body of literature on maintaining a specific property of moving objects. For example, a randomized algorithm for maintaining the binary space partition of moving objects is discussed in =-=[3]-=-, and the maintenance of the dynamic Voronoi diagram of a set of moving points in a plane is presented in [14]. For maintaining and querying a database of moving objects, see [28]. The paper [18] sugg... |

13 |
Advances in Indexing for Mobile Objects
- Agarwal, Procopiuc
(Show Context)
Citation Context ...ased algorithms are becoming increasingly popular [20, 21]. Storing and indexing trajectories facilitates not only efficient spatial range queries, but also time-and-space range queries [2]. See also =-=[1, 22]-=-. The paper [23] discusses time-parameterized bounding rectangles and extends trajectory information with expiration information. There is a large body of literature on maintaining a specific property... |

12 | Abbadi. Range and knn query processing for moving objects in grid model
- Chon, Agrawal, et al.
(Show Context)
Citation Context ...he quadtree. An R ∗ -tree based algorithm is given by [24]. Their algorithm provides indexing of objects moving in 1, 2 or 3 dimensions. For other work in query processing for moving points, see e.g. =-=[12]-=-, which proposes algorithms for range query and k nearest neighbors. While the dynamic data structures or databases mentioned above may be efficient for other types of queries, the task in hand is not... |

11 |
Efficient algorithms and regular data structures for dilation, location and proximity problems
- Amir, Efrat, et al.
(Show Context)
Citation Context ...of Buddy Tracking July 5, 2006sCentralized algorithms for social networks 23 length ≤ h from the root of T and to the leaf associated with c. Alternatively, we can use the point location technique of =-=[5]-=- that requires only O(log log h) time. However, in many cases, we can do better; Note that the size of all live regions containing two or more users is exactly R. The coordinates of the left lower cor... |

11 |
Star-tree: An efficent self-adjusting index for moving points
- Procopiuc, Agarwal, et al.
- 2002
(Show Context)
Citation Context ...ectory-based solutions are becoming increasingly popular [11, 8]. Storing and indexing trajectories facilitates not only efficient spatial range queries but time-and-space range queries [3]. See also =-=[12, 1]-=-. [15] discusses time-parameterized bounding rectangles and extends trajectory information with expiration information. Our work is complementary to the problem of finding people whose personal profil... |

7 |
Geometric algorithms for message filtering in decentralized virtual environments
- Makbily, Gotsman, et al.
- 1999
(Show Context)
Citation Context ...ed in [3], and the maintenance of the dynamic Voronoi diagram of a set of moving points in a plane is presented in [14]. For maintaining and querying a database of moving objects, see [28]. The paper =-=[18]-=- suggested the method of safety zones, in a method similar to the one suggested in our paper. The idea is to divide the plane into regions with the property that as long as point do not enter safety z... |

1 |
City Simulator,”, IBM AlphaWorks developer web site. http://www.alphaworks.ibm.com/tech/citysimulator
- Kaufman, Myllymaki, et al.
- 2001
(Show Context)
Citation Context ...Experimental Results We conducted simulation experiments with the Strips algorithm and the quadtree methods on synthetic dynamic location data. Location trace data was created with the City Simulator =-=[17]-=-, a toolkit that simulates an arbitrary number of mobile users moving in a city, driving on streets or walking on sidewalks and entering buildings. Several aspects of the toolkit and trace can be cont... |

1 |
Leutenegger and M.A.Lopez, “Indexing positions of continuously moving objects
- Saltenis, Jensen, et al.
(Show Context)
Citation Context ...[27]. Their main idea is to use a linear function of time for each of the dynamic attributes of the object, and to provide methods to regenerate the quadtree. An R ∗ -tree based algorithm is given by =-=[24]-=-. Their algorithm provides indexing of objects moving in 1, 2 or 3 dimensions. For other work in query processing for moving points, see e.g. [12], which proposes algorithms for range query and k near... |