Cart (Loading....) | Create Account
Close category search window
 

A data-related cluster architecture based pruning strategy

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

3 Author(s)
Linghong Lv ; Dept. of Inf.,Sci. & Eng., Ningbo Univ., Ningbo, China ; Zhijun Xie ; Guang Jin

In this paper we proposed a skyline query algorithm-DRCSky in wireless sensor networks. According to the history data's correlation the WSNs constructs multi-layer cluster architecture. The cluster heads collect statistic information of its member nodes, using the MIN-MAX algorithm to find the global pruning value-MINMAX-value, and then the cluster heads can determine whether to send the sensor data to its lower layer member nodes according to the MINMAX-value and the member nodes' uploaded statistic information, and finally achieve cluster-level pruning. The performance study indicates that DRCSky algorithm effectively reduce the communication cost of the network prolong the lifetime of WSNs significantly.

Published in:

Electronics, Communications and Control (ICECC), 2011 International Conference on

Date of Conference:

9-11 Sept. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.