中国电子科技2008，Vol.6Issue(3)：274-278,5.
A Tree-Based Data Collecting Network Structure for Wireless Sensor Networks
A Tree-Based Data Collecting Network Structure for Wireless Sensor Networks
摘要
Abstract
In a sensor network with a large number of densely populated sensor nodes, a single target of interest may be detected by multiple sensor nodes simultaneously. Data collected from the sensor nodes are usually highly correlated, and hence energy saving using in-network data fusion becomes possible. A traditional data fusion scheme starts with dividing the network into clusters, followed by electing a sensor node as cluster head in each cluster. A cluster head is responsible for collecting data from all its cluster members, performing data fusion on these data and transmitting the fused data to the base station. Assuming that a sensor node is only capable of handling a single node-to-node transmission at a time and each transmission takes T time-slots, a cluster head with n cluster members will take at least Nt time-slots to collect data from all its cluster members. In this paper, a tree-based network structure and its formation algorithms are proposed. Simulation results show that the proposed network structure can greatly reduce the delay in data collection.关键词
Cluster/data transmission/network structure/sensor network/treesKey words
Cluster/data transmission/network structure/sensor network/trees分类
信息技术与安全科学引用本文复制引用
Chi-Tsun Cheng,Chi K. Tse,Francis C. M. Lau..A Tree-Based Data Collecting Network Structure for Wireless Sensor Networks[J].中国电子科技,2008,6(3):274-278,5.基金项目
This work is supported by The Hong Kong Polytechnic University under internal Crant No. G-YF51. （）
