An Incremental Join Algorithm in Sensor Network

Given their autonomy, flexibility and large range of functionality, wireless sensor networks can be used as an effective and discrete means for monitoring data in many domains needed to gather and process real-time state information which is one of the sensor network features. But sensor nodes are generally very constrained, in particular regarding their energy and memory resources. While simple queries such as select and aggregate queries in wireless sensor networks have been addressed in the literature, the processing of join queries in sensor networks remain to be investigated. Previous approaches have either assumed that the join processing nodes have sufficient memory to buffer the subset of the join relations assigned to them, or that the amount of available memory at nodes is known in advance. Therefore, in this paper including these assumptions, we describes an Incremental Join Algorithm(IJA) in Sensor Networks to reduce the overhead of moving a join tuple to the final join node or minimize the communication cost that is the main consumer of the battery when processing the distributed queries in sensor networks environments. 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.