A distributed spatial index for error-prone wireless data broadcast

Zheng, Baihua; Lee, Wang-Chien; Lee, Ken C.; Lee, Dik Lun; Shao, Min

doi:10.1007/s00778-009-0137-2

Cited by 51 publications

(41 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This method has not only reduced the modulation time but also shortened the access time. Zheng et al [22] proposed a distributed spatial index structure (DSI) to support location-based data access under wireless broadcast environment. DSI is a linear and fully distributed structure, and different query paths can share the same index link, so it is efficient.…”

Section: Relevant Workmentioning

confidence: 99%

Keyword K-Nearest Neighbor Query of Road Network under Wireless Broadcast Environment

Chen¹

2016

IJFGCN

View full text Add to dashboard Cite

show abstract

Section: Relevant Workmentioning

confidence: 99%

Keyword K-Nearest Neighbor Query of Road Network under Wireless Broadcast Environment

Chen¹

2016

IJFGCN

View full text Add to dashboard Cite

show abstract

“…[16,17] address range and nearest neighbor queries on spatial data (in Euclidean space), based on spacefilling curves. [12] addresses the same queries, relying on an implicit grid partitioning.…”

Section: Wireless Broadcasting and Air Indexesmentioning

confidence: 99%

“…The distributed spatial index (DSI) [17] aims at minimizing the access latency of HCI at the cost of longer tuning time. The objects are sorted on their Hilbert values and placed into equi-sized frames.…”

Section: Appendix A: Spatial Air Indexesmentioning

confidence: 99%

“…To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Articles from this volume were presented at The 36th International Conference on Very Large Data Bases, September [13][14][15][16][17]2010, Singapore. is already facing scalability limitations, a situation expected to worsen in the near future.…”

Section: Introductionmentioning

confidence: 99%

“…Wireless broadcasting has been considered for spatial processing in Euclidean space (e.g., [12,16,17]). However, there is currently no work on road networks.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Shortest path computation on air indexes

Kellaris

Mouratidis

2010

Proc. VLDB Endow.

View full text Add to dashboard Cite

Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobile network industry, we propose adopting the wireless broadcast model for such location-dependent applications. In this model the data are continuously transmitted on the air, while clients listen to the broadcast and process their queries locally. Although spatial problems have been considered in this environment, there exists no study on shortest path queries in road networks. We develop the first framework to compute shortest paths on the air, and demonstrate the practicality and efficiency of our techniques through experiments with real road networks and actual device specifications.

show abstract

A novel distributed air index for efficient spatial query processing in road sensor networks on the air

Shu

Zhu

et al. 2016

Int J Communication

View full text Add to dashboard Cite

Recent development of wireless technology and smart mobile devices has spurred intense research efforts to address spatial queries. In particular, an increasing interest for tackling spatial query processing in broadcast environments has been observed. To the best of our knowledge, most of the existing work on this problem has assumed an Euclidean space. However, for real applications, query clients move within a road sensor network, where the distance between a data object and a query is determined by the connectivity of the road sensor network. This paper explores the problem of spatial query processing in road sensor networks by means of wireless data broadcast. We present an efficient method to partition the recordkeeping information about the underlying road sensor network and its associated objects, by which we develop a fully distributed air index, called integrated exponential index, based on an extended version of the Hilbert curve. We also propose efficient client-side algorithms to facilitate the processing of several kinds of spatial queries, including kNN query, CkNN query, and range query. Finally, extensive simulation experiments have been conducted to demonstrate the strengths of our proposed techniques. access for relatively heavily loaded systems. A year and a half ago, soccer fans from around the world arrived in Brasilia to watch the 2014 FIFA World Cup. After a game, many people would like to locate good nearby restaurants. Because there could be tons of people doing the search at the same time, an ideal solution in this case would be to provide spatial query processing using data broadcast.Earlier approaches to designing broadcast-based spatial query processing methods [2-7] had assumed that MCs and searched objects were located in an Euclidean space. In real-life situations, however, MCs normally move along a road sensor network, and the Euclidean distance may not properly reflect real road sensor network distance [8]. Thus, the existing spatial query processing methods proposed for Euclidean space are inapplicable to process spatial queries in road sensor networks. Recently, researchers have begun to zero in on the problem. Li et al. [9] addressed the issue of processing CNN queries in road networks on the air and proposed an network Voronoi diagrams (NVDs)-based distributed air index to support query processing. One key limitation of the proposed method is that it processes CkNN queries with k D 1. Sun et al. [10] presented an air index called network partition index (NPI) to support spatial query processing in road networks on the air and proposed efficient algorithms to process different spatial queries such as kNN query, range query, and CNN query. NPI is, however, not a fully distributed structure, and thus, each query client will have to wait for the arrival of the index part followed by the whole index before starting its query processing, which could lead to long access latency and tuning time. In this paper, we aim to overcome these limitations and propose a fully distributed air ...

show abstract

A distributed spatial index for error-prone wireless data broadcast

Cited by 51 publications

References 32 publications

Keyword K-Nearest Neighbor Query of Road Network under Wireless Broadcast Environment

Keyword K-Nearest Neighbor Query of Road Network under Wireless Broadcast Environment

Shortest path computation on air indexes

A novel distributed air index for efficient spatial query processing in road sensor networks on the air

Contact Info

Product

Resources

About