A tree-based data collecting network structure for wireless sensor networks

C.T. Cheng, Chi Kong Tse, Chung Ming Lau

Research output: Journal article publicationJournal articleAcademic research


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.
Original languageEnglish
Pages (from-to)274-278
Number of pages5
JournalJournal of electronic science and technology of China
Issue number3
Publication statusPublished - 2008


  • Cluster
  • Data transmission
  • Network structure
  • Sensor network
  • Trees


Dive into the research topics of 'A tree-based data collecting network structure for wireless sensor networks'. Together they form a unique fingerprint.

Cite this