By Topic

Energy Efficient Spatial Query Processing in Wireless Sensor Networks

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
$33 $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

3 Author(s)
Kyungseo Park ; University of Texas at Arlington, USA ; Byoungyong Lee ; Ramez Elmasri

Because a sensor network depends on limited battery power, energy saving is important to increase the sensor network lifespan. We propose semi-distributed spatial query indexing structure that disseminates a query into the network and retrieves data energy efficiently using a localized tree building algorithm. We also propose a sectioned tree index, which divides the network area into several squares and each square has a local index subtree organized within that square. Local trees are interconnected to form one big tree in the network. Local trees are also built based on any algorithm that is energy consumption aware at each sub-root node in a locally centralized way. We use an existing two dimensional indexing technique for energy efficient query dissemination. We show that our proposed scheme is energy efficient for query and data processing heuristically. Our proposed scheme, sectioned tree, is finally simulated in sparse and dense networks to show the energy saving for query and data processing in the sensor network.

Published in:

Advanced Information Networking and Applications Workshops, 2007, AINAW '07. 21st International Conference on  (Volume:2 )

Date of Conference:

21-23 May 2007