Please use this identifier to cite or link to this item:
Title: On efficient and scalable support of continuous queries in mobile peer-to-peer environments
Authors: Chow, CY
Mokbel, MF
Leong, HV 
Keywords: continuous query processing
Mobile computing
peer-to-peer computing
spatio-temporal databases
Issue Date: 2011
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on mobile computing, 2011, v. 10, no. 10, 5770262, p. 1473-1487 How to cite?
Journal: IEEE transactions on mobile computing 
Abstract: In this paper, we propose an efficient and scalable query processing framework for continuous spatial queries (range and k-nearest-neighbor queries) in mobile peer-to-peer (P2P) environments, where no fixed communication infrastructure or centralized/distributed servers are available. Due to the limitations in mobile P2P environments, for example, user mobility, limited battery power, limited communication range, and scarce communication bandwidth, it is costly to maintain the exact answer of continuous spatial queries. To this end, our framework enables the user to find an approximate answer with quality guarantees. In particular, we design two key features to adapt continuous spatial query processing to mobile P2P environments. 1) Each mobile user can specify his or her desired quality of services (QoS) for a query answer in a personalized QoS profile. The QoS profile consists of two parameters, namely, coverage and accuracy. The coverage parameter indicates the desired level of completeness of the available information for computing an approximate answer, and the accuracy parameter indicates the desired level of accuracy of the approximate answer. 2) We design a continuous answer maintenance scheme to enable the user to collaborate with other peers to continuously maintain a query answer. With these two features in our framework, the user can obtain a query answer from a local cache if the answer satisfies his or her QoS requirements. Otherwise, the user enlists neighbors for help to share their cached information to refine the answer. If the refined answer still cannot satisfy the QoS requirements, the user broadcasts the query to the peers residing within the required search area of the query to find the most accurate answer. Experiment results show that our framework is efficient and scalable and provides an effective trade-off between the communication overhead and the quality of query answers.
ISSN: 1536-1233
EISSN: 1558-0660
DOI: 10.1109/TMC.2011.104
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Feb 22, 2019


Last Week
Last month
Citations as of Feb 16, 2019

Page view(s)

Last Week
Last month
Citations as of Feb 18, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.