By Topic

A multi-dimensional data storage algorithm 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
$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)
Wen-Hwa Liao ; Dept. of Inf. Manage., Tatung Univ., Taipei, Taiwan ; Chun-Chu Chen

Data-centric storage is an effective and important technique in wireless sensor networks. There are many attributes with range values in an event, so the sensor will need to use multi-dimensional range queries to retrieve data. In this paper, we propose a data storage and range query method for multi-dimensional attributes in wireless sensor networks. The main idea is to map multi-dimensional events to their corresponding range spaces and build an in-network distributed data structure to efficiently gather the data of multi-dimensional range queries. Our performance evaluation shows that our proposed scheme can reduce message cost and hotspot problems to achieve load balancing even when a vast number of the events and sensor nodes are present in a sensor network.

Published in:

Network Operations and Management Symposium (NOMS), 2010 IEEE

Date of Conference:

19-23 April 2010