摘要： 为提高无线传感网数据聚合调度算法基于最短路径思想进行聚合树构造时的时延性能,基于连通支撑集理论,提出一种改进的调度算法CGTA。该算法将网络中的节点划分为骨干节点和普通节点,在进行时隙分配时,结合节点在树中的层数,采用贪心策略依次针对不同角色的发送节点集合构造可行调度子集。实验结果表明,与SPTS,MWFS等算法相比,CGTA算法能够将聚合时延降低15%以上。

关键词: 无线传感网, 数据聚合, 调度, 时延, 连通支撑集

Abstract: Data aggregation scheduling aims to find a feasible and efficient data aggregation scheme for Wireless Sensor Network (WSN).Previous algorithms on this problem usually construct data aggregation routing based on shortest-path-trees,which results in data aggregation plans with unacceptable latency.This paper presents a novel scheduling algorithm CGTA based on the Connected Dominating Set(CDS) theory.Through CDS,it divides the nodes into backbone nodes and ordinary nodes.Moreover,it uses the greedy strategy to construct maximal link transmission subsets while making scheduling decisions.Experimental results show that compared with SPTS and MWFS,CGTA algorithm can reduce the network latency by 15% under various scenarios.

Key words: Wireless Sensor Network (WSN), data aggregation, scheduling, latency, connected dominating set

中图分类号: 

• TP391