摘要
为了快速收集传感器节点数据,研究了最短时间聚集汇播的传输调度问题.针对聚集调度中的传输链路选择问题,提出了对数聚集树构造方法,仿照理想情况下的最优聚集树结构对传输链路进行了优化选择;针对聚集调度中的时间片分配问题,提出了基于链路效用的时间片分配方法,以发送节点对其竞争节点的影响作为链路效用,优先为效用值较大的链路分配时间片,增加并行传输.对比实验结果显示,该算法得到的数据收集时延在多数网络部署场景下比现有算法降低10%以上,且在网络密度较大、半径较小的场景中具有更好的相对性能.实验结果表明,新提出的算法是一种有效的快速聚集汇播调度算法.
Aggregation convergecast is an effective data collection pattern of wireless sensor networks. In order to collect sensor data fast,a shortest time aggregation convergecast scheduling problem was investigated. Following the structure of ideal optimal aggregation tree,a logarithmic aggregation tree construction 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 intree links with 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,which verifies the validity of the approach.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2016年第4期87-91,共5页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金项目(61174179
60874079)
铁路总公司科技研究开发计划项目(2015Z005-D)
关键词
无线传感器网络
数据收集
汇播传输
聚集调度
wireless sensor network
data collection
convergecast
aggregation scheduling
