无线传感器网络快速数据收集的聚集调度方法 - 北京邮电大学学报.pdf

2016年8月 北 京 邮 电 大 学 学 报 Aug.2016 第39卷 第4期 Journal of Beijing University of Posts and Telecommunications Vol.39 No.4 摇 摇 文章编号:1007鄄5321(2016)04鄄0087鄄05 DOI:10.13190/ j.jbupt.2016.04.017 无线传感器网络快速数据收集的聚集调度方法 潘摇 成,摇 张和生 (北京交通大学 电气工程学院,北京 100044) 摘要:为了快速收集传感器节点数据,研究了最短时间聚集汇播的传输调度问题. 针对聚集调度中的传输链路选 择问题,提出了对数聚集树构造方法,仿照理想情况下的最优聚集树结构对传输链路进行了优化选择;针对聚集调 度中的时间片分配问题,提出了基于链路效用的时间片分配方法,以发送节点对其竞争节点的影响作为链路效用, 优先为效用值较大的链路分配时间片,增加并行传输. 对比实验结果显示,该算法得到的数据收集时延在多数网络 部署场景下比现有算法降低10%以上,且在网络密度较大、半径较小的场景中具有更好的相对性能. 实验结果表 明,新提出的算法是一种有效的快速聚集汇播调度算法. 关摇 键摇 词:无线传感器网络;数据收集;汇播传输;聚集调度 中图分类号:TP212郾9;TP393摇 摇 摇 摇 文献标志码:A Fast Data Collection of Wireless Sensor Networks by Aggregation Scheduling PAN Cheng,摇 ZHANG He鄄sheng (School of Electrical Engineering,BeijingJiaotong University,Beijing 100044,China) Abstract:Aggregation convergecast isan effective data collection pattern of wireless sensor networks. In order to collect sensor datafast,a shortest time aggregation convergecast schedulingproblemwasinvesti鄄 gated. Following the structure of ideal optimal aggregation tree,a logarithmic aggregation tree construc鄄 tion algorithm was proposed for convergecast transmission link selection. For time slot allocation,a link effectiveness based algorithm was presented. In the algorithm,the effectiveness of a link was defined by the influence of the sender to its competitor nodes and time slot was preferentially allocated to those in鄄 tree linkswith higher value of effectiveness,so as to increase the number of parallel transmission links. Experiments show that the proposed approach can reduce the data collection delay by more than 10% in most scenarios