By Topic

Data collection algorithm for clustered large-scale wireless sensor networks using virtual nodes

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)
Jianquan Guo ; Dept. of Electr. Eng., Tsinghua Univ., Beijing, China ; Zhao, Wei ; Songling Huang

For densely deployed wireless sensor networks, there is a high correlation between multiple sensors in close proximity. In this paper, a data collection algorithm for clustered large-scale wireless sensor networks is proposed. The cluster heads fuse the data of cluster members by polynomial fitting, and transfer the fitting coefficients to base station or other cluster heads. Based on the locations of cluster heads and there fitting coefficients, base station and other cluster heads can construct in their memory numbers of so called “virtual nodes”, by which, the data status of the whole network can be recurred by base station, or in-line data fusion can be implemented by other cluster heads. In this paper, we give the method how to polynomial fit the data in a cluster, how to construct “virtual nodes”, and how to reshow the original data and implement in-line data fusion by “virtual nodes”.

Published in:

Instrumentation and Measurement Technology Conference (I2MTC), 2010 IEEE

Date of Conference:

3-6 May 2010