论文部分内容阅读
首先介绍了工业无线网络的分层拓扑结构和数据聚合方式,给出一种最小聚合树的生成方法用于解决工业无线网络中的簇间数据聚合问题,该方法融合了Dijkstra最短路算法和Prim算法的设计思想,并扩展了WIA-PA的标准流程,且描述了其系统实现过程.仿真实验结果表明使用簇间数据聚合路由机制的工业无线网络能降低整个网络的通信代价,证明本文所设计的机制是有效的.
Firstly, the hierarchical topology and data aggregation of industrial wireless networks are introduced. A method of generating the minimum aggregation tree is proposed to solve the problem of data aggregation between clusters in industrial wireless networks. This method combines Dijkstra shortest path algorithm with Prim Algorithm, and extends WIA-PA’s standard process and describes its system implementation process.The simulation results show that the industrial wireless network using inter-cluster data aggregation routing mechanism can reduce the communication costs of the entire network, proving that the design of this paper The mechanism is effective.