Proactive neighbor localization based on distributed geographic table

Real-time tracking of massive numbers of mobile devices, either carried by humans or embedded into vehicles, is a challenging problem whose solution may pave the way for a large set of valuable applications, ranging from social networking to ambient intelligence. A centralized approach, i.e. a server collects position data and provides it to interested consumers, is highly questionable, as performance can hardly scale up to the needs several million concurrent users. On other hand, a decentralized peer-to-peer approach, for which positioning data would flow directly among mobile devices may be very appealing, provided that messages to be routed are not too frequent and too expensive in terms of bandwidth usage. In this context we propose a peer-to-peer overlay scheme called Distributed Geographic Table (DGT), where each participant can efficiently retrieve node or resource information (data or services) located near any chosen geographic position. In particular, we describe a DGT-based localization protocol, that allows each peer for proactively discovering and tracking all the peers that are geographically near to itself. We provide a performance analysis of our protocol, referring to a simulated (although realistic) scenario where several hundred vehicles move on a real map. Our results show that the solution is efficient, scalable and highly adaptable to different application scenarios.

[1]  Duc A. Tran,et al.  Hierarchical multidimensional search in peer-to-peer networks , 2008, Comput. Commun..

[2]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[3]  Gregor von Bochmann,et al.  GeoP2P: An adaptive peer-to-peer overlay for efficient search and update of spatial information , 2009, ArXiv.

[4]  Anand Sivasubramaniam,et al.  DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[5]  Aaron Harwood,et al.  Hashing Spatial Content over Peer-to-Peer Networks , 2003 .

[6]  Karl Aberer,et al.  The essence of P2P: a reference architecture for overlay networks , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[7]  Ralf Steinmetz,et al.  Globase.KOM - A P2P Overlay for Fully Retrievable Location-based Search , 2007, Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007).

[8]  Hanan Samet,et al.  Using a distributed quadtree index in peer-to-peer networks , 2007, The VLDB Journal.

[9]  Alan Sussman,et al.  DiST: fully decentralized indexing for querying distributed multidimensional datasets , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[10]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[11]  Michele Amoretti,et al.  DEUS: a discrete event universal simulator , 2009, SimuTools.

[12]  Bin Liu,et al.  Supporting Complex Multi-Dimensional Queries in P2P Systems , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[13]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.