UR-tree: an efficient index for uncertain data in ubiquitous sensor networks

  • Authors:
  • Dong-Oh Kim;Dong-Suk Hong;Hong-Koo Kang;Ki-Joon Han

  • Affiliations:
  • School of Computer Science & Engineering, Konkuk University, Seoul, Korea;School of Computer Science & Engineering, Konkuk University, Seoul, Korea;School of Computer Science & Engineering, Konkuk University, Seoul, Korea;School of Computer Science & Engineering, Konkuk University, Seoul, Korea

  • Venue:
  • GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the rapid development of technologies related to Ubiquitous Sensor Network (USN), sensors are being utilized in various application areas. In general, a sensor has a low computing capacity and power and keeps sending data to the central server. In this environment, uncertain data can be stored in the central server due to delayed transmission or other reasons and make query processing produce wrong results. Thus, this paper examines how to process uncertain data in ubiquitous sensor networks and suggests an efficient index, called UR-tree, for uncertain data. The index reduces the cost of update by delaying update in uncertainty areas. In addition, it solves the problem of low accuracy in search resulting from update delay by delaying update only for specific update areas. Lastly, we analyze the performance of UR-tree and prove the superiority of its performance by comparing its performance with that of R-Tree and PTI using various datasets.