论文部分内容阅读
为了快速收集传感器节点数据,研究了最短时间聚集汇播的传输调度问题.针对聚集调度中的传输链路选择问题,提出了对数聚集树构造方法,仿照理想情况下的最优聚集树结构对传输链路进行了优化选择;针对聚集调度中的时间片分配问题,提出了基于链路效用的时间片分配方法,以发送节点对其竞争节点的影响作为链路效用,优先为效用值较大的链路分配时间片,增加并行传输.对比实验结果显示,该算法得到的数据收集时延在多数网络部署场景下比现有算法降低10%以上,且在网络密度较大、半径较小的场景中具有更好的相对性能.实验结果表明,新提出的算法是一种有效的快速聚集汇播调度算法.
In order to collect sensor node data quickly, the transmission scheduling problem of the shortest aggregatedcasting and broadcasting is studied. For the transmission link selection problem in aggregate scheduling, a method of constructing a logarithmic aggregated tree is proposed, which is modeled as the optimal clustering tree structure In order to solve the problem of time slice allocation in aggregation scheduling, a link allocation based on link utility is proposed. The effect of sending nodes on their competitors is regarded as the link utility, Of the link to allocate the time slice and increase the parallel transmission.Comparison experiment results show that the data collection delay obtained by this algorithm is more than 10% lower than the existing algorithms in most network deployment scenarios, and in the network density is larger and the radius is smaller The scene has better relative performance.The experimental results show that the proposed algorithm is an effective fast aggregate scheduling algorithm.