Advertisement

Improved Multi-dimensional Top-k Query Processing Based on Data Prediction in Wireless Sensor Networks

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 260)

Abstract

Since the scale of wireless sensor networks is expanding and one single node can sense a variety of data, selecting the data of interest to users from a tremendous data stream has become an important topic. With further development in the field of WSN query, extensive research is being conducted to solve different kinds of query issues. Skyline is a typical query for multi-criteria decision making, and many applications have been developed for it. Studies of multi-dimensional top-k query processing have proven it to be more efficient than traditional centralized scheme. In some cases, variations of observed conditions, such as temperature and humidity, are related to time. Thus, we used a data- prediction method to establish the bi-boundary filter rule, which helps filter the data that may be dropped by the final result set. The bi-boundary filter rules determine whether the received or generated data will be transmitted. We analyzed the simulation results and concluded that the bi-boundary filter rules can be more energy-efficient in situations in which temporal correlation exists.

Keywords

WSNs Top-k Data filter 

References

  1. 1.
    Jiang H, Cheng J, Wang D, Wang C, Tan G (2011) Continuous multi-dimensional top-k query processing in sensor networks. In: Proceedings of IEEE INFOCOMGoogle Scholar
  2. 2.
    Zou L, Chen L (2008) Dominant graph: an efficient indexing structure to answer top-k queries. In: Proceedings of IEEE ICDEGoogle Scholar
  3. 3.
    Madden S, Franklin MJ (2002) Fjording the stream: an architecture for queries over streaming sensor data. In: Proceedings of IEEE ICDEGoogle Scholar
  4. 4.
    Kim YS, Jung HR, Sung MK, Chung YD (2011) On processing scored k-dominant skyline queries. In: Proceedings of IEEE conferenceGoogle Scholar
  5. 5.
    Peralta J, Gutierrez G, Sanchis A (2009) Shuffle design to improve time series forecasting accuracy. In: IEEE congress on digital object identifier, pp 741–748Google Scholar
  6. 6.
    Huang Y, Wang H, McClean S (2009) Neighborhood counting for financial time series forecasting. Evolutionary computation. CEC ‘09. IEEE Congress, pp 815–821. doi:  10.1109/CEC.2009.4983029
  7. 7.
    Wang JJ, Wang JZ, Zhang ZG, Guo SP (2012) Stock index forecasting based on a hybrid model. Omega Int J Manage Sci 40:758–766Google Scholar
  8. 8.
    Sun YQ, Li Q, Chen ZY (2009) The top-k skyline query in pervasive computing environments. Pervasive Computing (JCPC), 335–338Google Scholar
  9. 9.
    Weiser M (2002) The computer for the 21st century. Pervasive Computing, IEEEGoogle Scholar
  10. 10.
    Madden SR, Franklin MJ, Hellerstein JM, Hong W (2005) TinyDB: an acquisitional query processing system for sensor networks. ACM Trans Database Syst 30(1):122–173CrossRefGoogle Scholar
  11. 11.
    Wu M, Xu J, Tang X, Lee W-C (2007) Top-k monitoring in wireless sensor networks. IEEE Trans Knowl Data Eng 19(7):962–976Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.Department of Electronic and Information EngineeringKey Laboratory of Communication and Information Systems, Beijing Jiaotong UniversityBeijingChina

Personalised recommendations