一种工业无线网络中的数据聚合路由机制

A Routing Mechanism for Data Aggregation in Industrial Wireless Network

首先介绍了工业无线网络的分层拓扑结构和数据聚合方式,给出一种最小聚合树的生成方法用于解决工业无线网络中的簇间数据聚合问题,该方法融合了Dijkstra最短路算法和Prim算法的设计思想,并扩展了WIA-PA的标准流程,且描述了其系统实现过程.仿真实验结果表明使用簇间数据聚合路由机制的工业无线网络能降低整个网络的通信代价,证明本文所设计的机制是有效的.

It introduces the layered topology structure and data aggregation methods in Indus- trial Wireless Network （IWN）, and gives a routing mechanism of clusters for data between in IWN. It presents a detailed method to generate the minimum aggregation tree, which combines the Dijkstra＇s shortest path algorithm and the Prim＇s algorithm＇s thought. It expansions WIA-PA standard for the system implementation, and describes the implementation process. The simulation results show that the use of the mechanism reduced the total network＇s cost; this paper proves the mecha- nism designed is effective.