Share Email Print

Proceedings Paper

A dynamic clustering algorithm in wireless sensor networks
Author(s): Rui Wang; Yan Liang; Quan Pan; Quan Wang; Yongmei Cheng
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

It is essential to prolong the lifetime of wireless sensor networks (WSN) via effective cooperation of its sensor nodes. Here, a dynamic clustering algorithm, named DCA, is presented to optimally and dynamically select the micro-sensor nodes to construct a dynamic sensor cluster at each time based on the integrated performance index including information acquirement and energy consumption. In distributed target tracking with WSN, the DCA can avoid the problem of "too frequent cluster head (CH) switches", save more than 80% energy and remain almost same tracking accuracy, compared with the information-driven sensor querying (IDSQ).

Paper Details

Date Published: 4 January 2006
PDF: 5 pages
Proc. SPIE 5985, International Conference on Space Information Technology, 59850M (4 January 2006); doi: 10.1117/12.655814
Show Author Affiliations
Rui Wang, Northwestern Polytechnical Univ. (China)
Yan Liang, Northwestern Polytechnical Univ. (China)
Quan Pan, Northwestern Polytechnical Univ. (China)
Quan Wang, Northwestern Polytechnical Univ. (China)
Yongmei Cheng, Northwestern Polytechnical Univ. (China)

Published in SPIE Proceedings Vol. 5985:
International Conference on Space Information Technology
Cheng Wang; Shan Zhong; Xiulin Hu, Editor(s)

© SPIE. Terms of Use
Back to Top