摘要： 针对传感器网络的特点，提出了一种最小传输成本生成树的数据汇聚机制。具体实现方法是首先将传感区域内部的所有传感器节点采集的数据都传送给传感区域内离汇聚点最近的节点，经过数据汇聚后，将汇聚的数据通过最短路径传递给汇聚点。仿真结果显示最小传输代价生成树的数据汇聚能够减少数据传输量50%～80%，并具有较小的传输时延。

关键词: 无线传感器网络；数据汇聚；以数据为中心路由；最小传输代价生成树

Abstract: Based on the characteristics of the wireless sensor networks, a data aggregation scheme of minimum transmission cost spanning tree is designed. In this scheme, the node in sensing region which is nearest the sink acts as the aggregation point. All other nodes in sensing region send their data to this aggregation node, then sends the aggregation information to the sink along the shortest path. Experimental results show that the data aggregation scheme can cause roughly 50%～80% fewer transmissions and a bit shorter transmission delay.

Key words: Wireless sensor networks; Data aggregation; Data-centric routing; Minimum transmission cost spanning tree