A Routing Mechanism of Adjacent Clusters for Data Aggregation in WIA-PA

摘要：

The paper introduces the layered network topology structure and data aggregation in WIA - PA. In order to solve data aggregation problem of adjacent clusters in WIA-PA network, this paper presents a detailed method to generate the minimum converge tree, this method has the most short Dijkstras algorithm and the Prims algorithms thought. Based on the minimum converge tree, a novel suitable WIA - PA network routing mechanism of adjacent clusters for data aggregation (RMACD) was proposed. The paper expansion WIA-PA standard for the system implementation, and describes the implementation process. The simulation results show that the use of RMACD reduced the total networks cost; this paper proves the mechanism designed is effective.

关键词： WIA-PA Data Aggregation Adjacent Clusters Minimum Converge Tree

作者: YI Xiushuang ZHANG Dengke WANG Xingwei

作者单位: Network Center Northeastern University Shenyang Liaoning Province 110819 China

会议类型: 国际会议

会议名称: 2010 4th International Conference on Intelligent Information Techonlogy Application(第四届智能信息技术应用国际学术研讨会 IITA 2010)

会议地点: 秦皇岛

会议语种:英文

页码: 369-371

在线出版日期: 2010-11-05（万方平台首次上网日期，不代表论文的发表时间）