GeoGrid: A Scalable Location Service Network

Zhang, Jianjun; Zhang, Gong; Liu, Ling

doi:10.1109/icdcs.2007.113

Cited by 14 publications

(11 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…LMS, like the large-scale location services presented in [6] and [17], enable scalable management of MOs' current positions [13]. Similar to our approach, LMS use spatial partitioning for distributing the position data among a set of servers.…”

Section: Related Workmentioning

confidence: 92%

See 1 more Smart Citation

Scalable processing of trajectory-based queries in space-partitioned moving objects databases

Lange

Dürr

Rothermel

2008

Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

View full text Add to dashboard Cite

Space-partitioned Moving Objects Databases (SP-MODs) allow for the scalable, distributed management of large sets of mobile objects' trajectories by partitioning the trajectory data to a network of database servers.Processing a spatio-temporal query q therefore requires efficiently routing q to the servers storing the affected trajectory segments. With a coordinate-based query -like a spatio-temporal range query -the relevant servers are directly determined by the queried range. However, with trajectory-based queries -like retrieving the distance covered by a certain object during a given time interval -the relevant servers depend on actual movement of the queried object. Therefore, efficient routing mechanisms for trajectorybased queries are an important challenge in SP-MODs.In this paper, we present the Distributed Trajectory Index (DTI) that allows for such efficient query routing by creating an overlay network for each trajectory. We further present an enhanced index called DTI+S. It accelerates the processing of queries on aggregates of dynamic attributes, like the maximum speed during a time interval, by augmenting DTI with summaries of trajectory segments. Our simulations with a network of 1000 database servers show that DTI+S can reduce the overall processing time by more than 98%.

show abstract

Section: Related Workmentioning

confidence: 92%

“…This may reduce the overhead for position updates substantially [6,13]. Therefore, spatial partitioning and distribution also is widely used in scalable location management systems [6,13,17].…”

Section: Introductionmentioning

confidence: 98%

Scalable processing of trajectory-based queries in space-partitioned moving objects databases

Lange

Dürr

Rothermel

2008

Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

View full text Add to dashboard Cite

show abstract

“…GeoCast is a geographical overlay system built on top of GeoGrid [14] for providing group communication services. It is composed of two-tier substrates: overlay network management and end system node multicast management.…”

Section: Basic Geocast Systemmentioning

confidence: 99%

“…A new node can join GeoCast by initiating a joining request with its own geographical coordinates to an entry node obtained from a bootstrapping server [14]. The joining request is then routed towards the region that covers the coordinates of the new node.…”

Section: ) Membership Protocolmentioning

confidence: 99%

An utility-driven routing scheme for scaling multicast applications

Wang

Liu

et al. 2010

Proceedings of the 6th International ICST Conference on Collaborative Computing: Networking, Applications, Worksharing

Self Cite

View full text Add to dashboard Cite

Abstract-Multicast is a common platform for supporting group communication applications, such as IPTV, multimedia content delivery, and location-based advertisements. Distributed hash table (DHT) based overlay networks such as Chord and CAN presents a popular distributed computing architecture for multicast applications. However, existing research efforts have been mostly dedicated to efficient message delivery techniques to alleviate the influence of network dynamics on geo-distance based routing, such as reducing the delivery path length or optimizing routing path by utilizing network locality.In this paper, we argue that the geo-distance based routing protocols used in existing overlay networks are inefficient in terms of both resource use and environmental accommodation for multicast applications. We devise a utility driven routing scheme to improve the routing efficiency with three unique features. First, our utility function is defined based on a careful combination of hop counts and routing path latency. Second, we use CAN-like routing as an example and extend it by utilizing shortcuts to reduce the routing path length and by introducing a utility function to combine path latency with geo-distance based metric in determining the near-optimal route for each routing request. Third and most importantly, our utility function is designed by using a tunable influence parameter to allow nodes to adaptively making the most promising routing decision according to their specific network state and circumstances, such as overlay connectivity and next hop latency. Our experimental evaluation shows that the utility-driven routing scheme is highly scalable and efficient compared to existing geo-distance routing protocols and demonstrates that by combining shortcuts, path latency with geodistance can effectively enhance the multicast delivery efficiency for large scale group communication applications.

show abstract

“…To the best of our knowledge, Geogrid [12] is a prior effort that is very related to our proposal. Geogrid is a decentralized and geographic-location-aware overlay network that divides two-dimensional extends into a number of rectangular regions.…”

Section: Related Workmentioning

confidence: 99%

A geography-aware service overlay network for managing moving objects

Chondrogiannis

Delis

2012

Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access

View full text Add to dashboard Cite

As the proliferation of mobile devices and positioning systems continues unabated, the need to provide more robust location-based services becomes more pressing. In this context, we examine the problem of efficiently handling queries over moving objects and propose a location-aware overlay network that helps monitoring such objects while traversing contained geographic extends. We use a triangulation structure to divide a geographic area using fixed service nodes as anchors based on their geographic position. Triangulation inherently contains each moving object within an area designated by three service nodes. We introduce a method for monitoring moving objects and we present an algorithm for processing nearest-neighbor queries while restricting the amount of resources and, subsequently, the volume of transmitted messages. Through simulation, we evaluate the suggested approach and show that our nearest-neighbor query processing method provides always accurate results while it uses invariantly a constant number of service nodes. We finally show that the average physical distance between service and roaming nodes remains limited; this yields a significant number of physical connections that avoid conventional Internet routing altogether.

show abstract

GeoGrid: A Scalable Location Service Network

Abstract: Abstract

Cited by 14 publications

References 14 publications

Scalable processing of trajectory-based queries in space-partitioned moving objects databases

Scalable processing of trajectory-based queries in space-partitioned moving objects databases

An utility-driven routing scheme for scaling multicast applications

A geography-aware service overlay network for managing moving objects

Contact Info

Product

Resources

About