• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

On Efficient Processing of Continuous Reverse Skyline Queries in Wireless Sensor Networks

Vol. 11, No.4, April 30, 2017
10.3837/tiis.2017.04.006, Download Paper (Free):

Abstract

The reverse skyline query plays an important role in information searching applications. This paper deals with continuous reverse skyline queries in sensor networks, which retrieves reverse skylines as well as the set of nodes that reported them for continuous sampling epochs. Designing an energy-efficient approach to answer continuous reverse skyline queries is non-trivial because the reverse skyline query is not decomposable and a huge number of unqualified nodes need to report their sensor readings. In this paper, we develop a new algorithm that avoids transmission of updates from nodes that cannot influence the reverse skyline. We propose a data mapping scheme to estimate sensor readings and determine their dominance relationships without having to know the true values. We also theoretically analyze the properties for reverse skyline computation, and propose efficient pruning techniques while guaranteeing the correctness of the answer. An extensive experimental evaluation demonstrates the efficiency of our approach.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Bo Yin, Siwang Zhou, Shiwen Zhang, Ke Gu and Fei Yu, "On Efficient Processing of Continuous Reverse Skyline Queries in Wireless Sensor Networks," KSII Transactions on Internet and Information Systems, vol. 11, no. 4, pp. 1931-1953, 2017. DOI: 10.3837/tiis.2017.04.006

[ACM Style]
Yin, B., Zhou, S., Zhang, S., Gu, K., and Yu, F. 2017. On Efficient Processing of Continuous Reverse Skyline Queries in Wireless Sensor Networks. KSII Transactions on Internet and Information Systems, 11, 4, (2017), 1931-1953. DOI: 10.3837/tiis.2017.04.006