By Topic

Distributed database management and join of multiple data streams in wireless sensor network using querying techniques

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Vaidehi, V. ; Department of Information Technology, Madras Institute of Technology, Chennai, India ; Devi, D. Sharmila

Sensor networks are multi hop wireless networks formed by a large number of resource-constrained sensor nodes. The events detected by the sensor generate a stream of data. Centralized join query processing algorithm incur more communication overhead due to frequent exchange of data between the sink and the sensor nodes. To query or access data generated by the sensor nodes, the sensor network can be viewed as a distributed database. Communication-efficient implementation for join of multiple data streams in a sensor network is particularly challenging due to unique characteristics of the sensor networks such as limited memory and battery energy on individual nodes. Hence the design of Distributed Nested Loop Join Processing (DNLJP) algorithm has been proposed in this paper. The proposed scheme groups sensors based on geographic locations to form a cluster and perform the query processing in a distributed manner over the data collected across different regions. DNLJP also optimizes the query based on the desired optimization criteria like query cost, query execution time etc., and applies the corresponding query processing technique to achieve the desired result. Analysis shows that the communication overhead of the proposed distributed algorithm is reasonably low and the efficiency of the query processing is considerably improved over a wide range of query.

Published in:

Recent Trends in Information Technology (ICRTIT), 2011 International Conference on

Date of Conference:

3-5 June 2011