{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:36:19Z","timestamp":1760243779477,"version":"build-2065373602"},"reference-count":15,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2011,1,28]],"date-time":"2011-01-28T00:00:00Z","timestamp":1296172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/s110201682","type":"journal-article","created":{"date-parts":[[2011,1,31]],"date-time":"2011-01-31T11:44:06Z","timestamp":1296474246000},"page":"1682-1692","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["IJA: An Efficient Algorithm for Query Processing in Sensor Networks"],"prefix":"10.3390","volume":"11","author":[{"given":"Hyun Chang","family":"Lee","sequence":"first","affiliation":[{"name":"Division of Information and e-Commerce, Wonkwang University, Iksan, Korea"}]},{"given":"Young Jae","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Multimedia, Jeonju University, Jeonju, Korea"}]},{"given":"Ji Hyang","family":"Lim","sequence":"additional","affiliation":[{"name":"Department of Art Therapy, Daegu Cyber University, Daegu, Korea"}]},{"given":"Dong Hwa","family":"Kim","sequence":"additional","affiliation":[{"name":"Control Instrumentation Engineering Major, Hanbat National University, Daejeon, Korea"}]}],"member":"1968","published-online":{"date-parts":[[2011,1,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Coman, A., and Nascimento, M.A. (2007., January July). A distributed Algorithm for Joins in Sensor Networks. Banff, AB, Canada.","DOI":"10.1109\/SSDBM.2007.26"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Mainaring, A., Culler, D., Plastre, J., Szewczyk, R., and Anderson, J. (2002, January September). Wireless Sensor Networks for Habitat Monitoring. Atlanta, GA, USA.","DOI":"10.1145\/570738.570751"},{"key":"ref_3","unstructured":"Estrin, D., Govindan, R., Heidemann, J.S., and Kumar, S. (, January August). Next Century Challenges: Scalable Coordination in Sensor Networks. Seattle, WA, USA."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/332833.332836","article-title":"Embedding the internet: Introduction","volume":"43","author":"Estrin","year":"2000","journal-title":"Commun. ACM"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Bonnet, P., Gehrke, J., and Seshadri, P. (2001, January January). Towards Sensor Database Systems. Hong Kong, China. Volume 1987.","DOI":"10.1007\/3-540-44498-X_1"},{"key":"ref_6","unstructured":"Madden, S., Franklin, M.J., Hellerstein, J.M., and Hong, W. (2002, January December). TAG: A Tiny AGregation Service for ad-hoc Sensor Networks. Boston, MA, USA."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Yu, H., Lim, E., and Zhang, J. (2006, January January). In-network Join Processing for Sensor Networks. Harbin, China.","DOI":"10.1007\/11610113_24"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/MPRV.2004.1269131","article-title":"Query processing in sensor networks","volume":"3","author":"Gehrke","year":"2004","journal-title":"Pervasive Comput"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Coman, A., Nascimento, M., and Sander, J. (2007, January May). On Join Location in Sensor Networks. Mannheim, Germany.","DOI":"10.1109\/MDM.2007.35"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/601858.601861","article-title":"The cougar approach to in-network query processing in sensor networks","volume":"31","author":"Yao","year":"2002","journal-title":"SIGMOD Record"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Chowdhary, V., and Gupta, H. (2005, January April). Communication-Efficient Implementation of Join in Sensor Network. Beijing, China.","DOI":"10.1007\/11408079_40"},{"key":"ref_12","unstructured":"Yao, Y, and Gehrke, J. Query Processing for Sensor Networks. Monterey, CA, USA. Volume 3."},{"key":"ref_13","unstructured":"Karp, B, and Kung, M.J. (, January August). GPSR: Greedy Perimeter Statelss Routing for Wireless Networks. Boston, MA, USA."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Sun, J.Z. (2008, January June). An Energy-Efficient Query Processing Algorithm for Wireless Sensor Networks. Oslo, Norway.","DOI":"10.4304\/jcp.3.11.32-41"},{"key":"ref_15","unstructured":"Zhang, Z., Gao, X.F., Zhang, X.F., Wu, W.L., and Xiong, H. (4,, January August). Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System. Linz, Austria."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/11\/2\/1682\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:55:06Z","timestamp":1760219706000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/11\/2\/1682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,28]]},"references-count":15,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2011,2]]}},"alternative-id":["s110201682"],"URL":"https:\/\/doi.org\/10.3390\/s110201682","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2011,1,28]]}}}