|
Title:
|
VORODSPT: A VORONOI BASED OVERLAY FOR SPATIAL OBJECTS |
|
Author(s):
|
Dominic Heutelbeck , Christina Sergel , Matthias Hemmje |
|
ISBN:
|
978-972-8924-62-1 |
|
Editors:
|
Jörg Roth and Jairo Gutiérrez |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
Spatial indexes, Peer-to-Peer, Overlay, Location-based services, Voronoi-Diagram, DSPT |
|
Type:
|
Full Paper |
|
First Page:
|
3 |
|
Last Page:
|
10 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Recent announcements of distributed space partitioning trees (DPSTs) (Heutelbeck and Hemmje (2006)), describe a
distributed spatial index for storage and access of the so-called location knowledge. Location knowledge is acquired in a
complex distributed process through positioning, tracking, and program logic to support location-based services which
are based upon knowledge about the physical location, shape, and size of real and virtual entities, such as persons,
vehicles, cities or other location-based services. Location knowledge is needed at diverse applications in geographical
information systems (GIS), virtual collaboration systems and mobility management. The previous implementation of a
DSPT, RectNet (Heutelbeck and Hemmje, 2006), was built on an adaptive binary tree shaped network topology. The use
of a recursive space partitioning can be useful for load balancing. However, previous implementation requires complex
operations to restructure the network. These operations cause significant bursts in network traffic. In this paper we
present VoroDSPT, a new DSPT implementation, by using the well-known geometric structure Voronoi Diagram as a
new topology that provides both greedy-routing for supporting efficient spatial queries and information sharing,
providing the base for implementing future efficient heuristics of load balancing. |
|
|
|
|
|
|
