Skip to main content

Advertisement

Log in

PEJA: Progressive Energy-Efficient Join Processing for Sensor Networks

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Sensor networks are widely used in many applications to collaboratively collect information from the physical environment. In these applications, the exploration of the relationship and linkage of sensing data within multiple regions can be naturally expressed by joining tuples in these regions. However, the highly distributed and resource-constraint nature of the network makes join a challenging query. In this paper, we address the problem of processing join query among diffeerent regions progressively and energy-efficiently in sensor networks. The proposed algorithm PEJA (Progressive Energy-efficient Join Algorithm) adopts an event-driven strategy to output the joining results as soon as possible, and alleviates the storage shortage problem in the in-network nodes. It also installs filters in the joining regions to prune unmatchable tuples in the early processing phase, saving lots of unnecessary transmissions. Extensive experiments on both synthetic and real world data sets indicate that the PEJA scheme outperforms other join algorithms, and it is effective in reducing the number of transmissions and the delay of query results during the join processing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Cruller D, Estrin D, Srivastava M. Overview of sensor networks. Computer, Long Beach, CA, 2004, 37(8): 41–49.

    Article  Google Scholar 

  2. Madden S, Franklin M, Hellerstein J, Hong W. TAG: A Tiny AGgregation service for ad-hoc sensor networks. In Proc. OSDI, Boston, Massachusetts, USA, 2002, pp.131–146.

  3. Goldin D. Faster in-network evaluation of spatial aggregation in sensor networks. In Proc. ICDE, Atlanta, GA, USA, 2006, p.148.

  4. Wu M, Xu J, Tang X. Processing precision-constrained approximate queries in wireless sensor networks. In Proc. MDM, Nara, Japan, 2006, p.31.

  5. Govindan R, Hellerstein J et al. The sensor network as a database. Tech. Rep. 02–771, University of Southern California, 2002.

  6. Xu M, Tong K, Kong H, Tang X, Lee W. Monitoring top-k query in wireless sensor networks. In Proc. ICDE, Atlanta, GA, USA, 2006, pp.962–976.

  7. Deshpande A, Guestrin C, Madden S, Hellerstein J, Hong W. Model-driven data acquisition in sensor networks. In Proc. VLDB, Toronto, Canada, 2004, pp.588–599.

  8. Yu H, Lim E, Zhang J. On in-network synopsis join processing for sensor networks. In Proc. MDM, Nara, Japan, 2006, p.32.

  9. Chowdhary V, Gupta G. Communication-efficient implementation of join in sensor networks. In Proc. DASFAA, Beijing, China, 2005, pp.447–460.

  10. Pandit A, Gupta H. Communication efficient implementation of range-joins in sensor networks. In Proc. DASFAA, Singapore, 2006, pp.859–869.

  11. Abadi D, Madden S, Lindner W. REED: Robust, efficient filtering and event detection in sensor networks. In Proc. VLDB, Trondheim, Norway, 2005, pp.769–780.

  12. Yang X, Lim H, Ozsu T, Tan K. In-network execution of monitoring queries in sensor networks. In Proc. SIGMOD, Beijing, China, 2007, pp.521–532.

  13. Ahmad Y, Cetintemel U, Jannotti J, Zgolinski A. Locality aware networked join evaluation. In Proc. NetDB, Tokyo, Japan, 2005, p.1183.

  14. Kossmann D. The state of the art in distributed query processing. ACM Computing Surveys (CSUR), 2000, 32(4): 422–469.

    Article  Google Scholar 

  15. Golab L, Özsu M. Issues in data stream management. ACM SIGMOD Record, 2003, 32(2): 5–14.

    Article  Google Scholar 

  16. Golab L, Özsu M. Processing sliding window multi-joins in continuous queries over data streams. In Proc. VLDB, Berlin, Germany, 2003, pp.500–511.

  17. Scheufele W, Moerkotte G. On the complexity of generating optimal plans with cross products. In Proc. PODS, Tucson, Arizona, United States, 1997, pp.238–248.

  18. Karp B, Kung H. GPSR: Greedy perimeter stateless routing for wireless networks. In Proc. MobiCom, Boston, Massachusetts, USA, 2000, pp.243–254.

  19. Lai Y, Chen H, Wang Y. Dynamic balanced storage in wireless sensor network. In Proc. DMSN, Vienna, Austria, 2007, pp.7–12.

  20. Varga A. The omnet++ discrete event simulation system. In Proc. ESM, Prague, Czech, 2001, pp.319–324.

  21. Intel Lab Data. http://db.csail.mit.edu/labdata/labdata.html.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yong-Xuan Lai.

Additional information

This work is partly supported by the National High Technology Research and Development 863 Program of China under Grant No. 2008AA01Z133, the National Natural Science Foundation of China under Grant Nos. 60673138, 60603046, the Science Technology Research Program of MOE under Grant No. 106006, and the Program for New Century Excellent Talents in University.

Electronic supplementary material

Below is the link to the electronic supplementary material.

(PDF 69.7 kb).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lai, YX., Chen, YL. & Chen, H. PEJA: Progressive Energy-Efficient Join Processing for Sensor Networks. J. Comput. Sci. Technol. 23, 957–972 (2008). https://doi.org/10.1007/s11390-008-9191-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-008-9191-2

Keywords

Navigation