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 ...
