南京邮电大学学报（自然科学版）2012，Vol.32Issue(1)：6-11,6.
一种基于多叶节点生成树的低延时数据融合调度算法
A Low-delay Data Aggregation Scheduling Algorithm Based on Leafy Spanning Tree
摘要
Abstract
Wireless sensor networks is the basis for information collection of the Internet of things. In wireless sensor networks, data aggregation can save network resources, meanwhile, cause a larger delay. In real-time application scenarios, it is critical to research the minimum latency aggregation schedule problem. Firstly,the minimum latency aggregation schedule problem is formally formulated. Based on the idea that the leafy spanning tree will help to increase the number of nodes transmitting simultaneously, a Low-delay Data Aggregation Scheduling algorithm ( LDAS) based on leafy spanning tree is proposed, which includes two phases,I. E. The phase of constructing the leafy data aggregation tree and the phase of aggregation scheduling. Finally, through the simulation and comparison, the effectiveness of the algorithm is validated.关键词
物联网/无线传感器网络/数据融合调度/低延时/生成树Key words
IoT/ WSN/ data aggregation scheduling/ low-delay/ spanning tree分类
信息技术与安全科学引用本文复制引用
陈正宇,杨庚,许建,王海勇,朱薇..一种基于多叶节点生成树的低延时数据融合调度算法[J].南京邮电大学学报（自然科学版）,2012,32(1):6-11,6.基金项目
国家重点基础研究发展规划(973计划)(2011CB302903)、江苏省高校自然科学研究重大项目(11KJA520002)、江苏省教育厅高校自然科学研究项目(11KJD510002,09KJD510008)、安徽高校省级自然科学研究项目(KJ2011B115)、江苏省普通高校研究生科研创新计划(CXZZ11_0402,CXLX11 0415,CXLX11_0416)资助项目 （973计划）
