Peer-to-Peer Computing, IEEE International Conference on (2007)
Sept. 2, 2007 to Sept. 5, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/P2P.2007.18
Nicolas Liebau , Technische Universitat Darmstadt, Germany
Ralf Steinmetz , Technische Universitat Darmstadt, Germany
Aleksandra Kovacevic , Technische Universitat Darmstadt, Germany
Location based services are becoming increasingly pop- ular as devices that determine geographical position be- come more available to end users. The main problem of existing solutions to location-based search is keeping infor- mation updated requires centralized maintenance at spe- cific times. Therefore, retrieved results do not include all objects that exist in reality. A peer-to-peer (P2P) approach can easily overcome this issue as peers are responsible for the information users are searching for. Unfortunately, cur- rent state-of-the-art overlays cannot fulfill the requirements for efficient and fully retrievable location-based search. In this paper we present Globase.KOM, a hierarchical tree- based P2P overlay that enables fully retrievable location- based overlay operations which proved to be highly efficient and logarithmically scalable.
Nicolas Liebau, Ralf Steinmetz, Aleksandra Kovacevic, "Globase.KOM - A P2P Overlay for Fully Retrievable Location-based Search", Peer-to-Peer Computing, IEEE International Conference on, vol. 00, no. , pp. 87-96, 2007, doi:10.1109/P2P.2007.18