A Tree-Based Data Collecting Network Structure for Wireless Sensor Networks

作     者：Chi-Tsun Cheng Chi K. Tse Francis C. M. Lau 

作者机构：the Department of Electronic and Information Engineering The Hong Kong Polytechnic University Kowloon Hong Kong 

出 版 物：《Journal of Electronic Science and Technology of China》 (中国电子科技（英文版）)

年 卷 期：2008年第6卷第3期

页      面：274-278页

学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 080202[工学-机械电子工程] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 0802[工学-机械工程] 081001[工学-通信与信息系统] 

基　　金：The Hong Kong Polytechnic University under internal Grant No. G-YF51 

主　　题：Cluster data transmission network structure sensor network trees 

摘      要：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.