基于Markov模型低时延数据融合树算法  

Low-delay data aggregation tree algorithm based on Markov model

作　　者：葛磊[1] 何洪辉 胡杰[3] GE Lei;HE Honghui;HU Jie(College of Information Engineering,Kaifeng University,Kaifeng 475004,China;College of Software,Henan University,Kaifeng 475004,China;School of Automotive Engineering,Wuhan University of Technology,Wuhan 430070,China)

机构地区：[1]开封大学信息工程学院,河南开封475004 [2]河南大学软件学院,河南开封475004 [3]武汉理工大学汽车工程学院,湖北武汉430070

出　　处：《现代电子技术》2018年第21期88-91,共4页Modern Electronics Technique

基　　金：国家自然科学基金项目(51406140)~~

摘　　要：数据融合技术可节省无线传感网络的资源,但也会增加额外的时延。为此,针对数据传输必须在指定时延约束下完成的特殊场景,提出基于Markov模型低时延数据融合树算法(MLDGT)。给出在时延约束下的构建数据融合树问题的形式化表述,此问题已证实为NP问题。引用Markov近似模型寻找次优解,进而获取低时延的数据融合树。通过仿真和比较分析MLDGT算法的有效性。实验结果表明,MLDGT算法能够降低数据融合时延。The data aggregation technology can save the resources of wireless sensor networks(WSNs),and also increase the extra delay.Therefore,a Markov model-based low-delay data aggregation tree(MLDGT)algorithm is proposed under specified delay constraint scenario for data transmission.The formalized expression of the data aggregation tree problem is constructed under delay constraint.The data aggregation tree problem is proved to be NP.The Markov approximate model is introduced to find the close-to-optimal solution,so as to get the low-delay data integration tree.The effectiveness of the MLDGT algorithm is validated with simulation and comparison.The experimental results show that the MLDGT algorithm can reduce the data aggregation delay.

关 键 词：无线传感网络 时延约束 数据融合 融合时延 MARKOV模型 能耗 

分 类 号：TN711-34[电子电信—电路与系统] TP393[自动化与计算机技术—计算机应用技术]