Next Article in Journal
The Effect of Tensile Hysteresis and Contact Resistance on the Performance of Strain-Resistant Elastic-Conductive Webbing
Next Article in Special Issue
A Target Coverage Scheduling Scheme Based on Genetic Algorithms in Directional Sensor Networks
Previous Article in Journal
The Properties of Terrestrial Laser System Intensity for Measuring Leaf Geometries: A Case Study with Conference Pear Trees (Pyrus Communis)
Previous Article in Special Issue
Secure Chaotic Map Based Block Cryptosystem with Application to Camera Sensor Networks
Article Menu

Export Article

Open AccessArticle
Sensors 2011, 11(2), 1682-1692;

IJA: An Efficient Algorithm for Query Processing in Sensor Networks

Division of Information and e-Commerce, Wonkwang University, Iksan, Korea
Department of Multimedia, Jeonju University, Jeonju, Korea
Department of Art Therapy, Daegu Cyber University, Daegu, Korea
Control Instrumentation Engineering Major, Hanbat National University, Daejeon, Korea
Author to whom correspondence should be addressed.
Received: 29 November 2010 / Revised: 10 January 2011 / Accepted: 12 January 2011 / Published: 28 January 2011
Full-Text   |   PDF [364 KB, uploaded 21 June 2014]


One of main features in sensor networks is the function that processes real time state information after gathering needed data from many domains. The component technologies consisting of each node called a sensor node that are including physical sensors, processors, actuators and power have advanced significantly over the last decade. Thanks to the advanced technology, over time sensor networks have been adopted in an all-round industry sensing physical phenomenon. However, sensor nodes in sensor networks are considerably constrained because with their energy and memory resources they have a very limited ability to process any information compared to conventional computer systems. Thus query processing over the nodes should be constrained because of their limitations. Due to the problems, the join operations in sensor networks are typically processed in a distributed manner over a set of nodes and have been studied. By way of example while simple queries, such as select and aggregate queries, in sensor networks have been addressed in the literature, the processing of join queries in sensor networks remains to be investigated. Therefore, in this paper, we propose and describe an Incremental Join Algorithm (IJA) in Sensor Networks to reduce the overhead caused by moving a join pair to the final join node or to minimize the communication cost that is the main consumer of the battery when processing the distributed queries in sensor networks environments. At the same time, the simulation result shows that the proposed IJA algorithm significantly reduces the number of bytes to be moved to join nodes compared to the popular synopsis join algorithm. View Full-Text
Keywords: sensor network communication cost; incremental algorithm; in-network query processing; wireless sensor networks sensor network communication cost; incremental algorithm; in-network query processing; wireless sensor networks
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

Lee, H.C.; Lee, Y.J.; Lim, J.H.; Kim, D.H. IJA: An Efficient Algorithm for Query Processing in Sensor Networks. Sensors 2011, 11, 1682-1692.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top