基于SP调度策略的簇树型无线传感网络QoS上界研究  

Upper Bounds of Cluster-tree Wireless Sensor Network QoS Based on Strict Priority Scheduling Strategy

作　　者：陈越洋[1] 顾平[1] 张超[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《计算机与现代化》2014年第7期117-120,共4页Computer and Modernization

摘　　要：为了改善无线传感网络在最坏条件下的网络服务质量(Quality of Service,QoS),本文将严格优先级(Strict Priority,SP)队列调度引入簇树型无线传感网络中,分析SP队列调度对网络中数据流获得的保证服务的影响,并利用网络演算推导簇树网络中各深度路由节点的时延上界、缓存上界及网络的端到端时延上界。通过实例分析,表明SP队列调度能够有效减小网络的最大端到端时延。In order to improve QoS （ quality of service ） of WSN （ wireless sensor network ） under the worst-case condition , which is particularly relevant for those time-sensitive WSN application, this paper applies the SP （strict priority） scheduling strategy to the cluster-tree WSN and analyzes how the strategy will impact the service guaranteed to data flows .The closed-recurrent expres-sions of calculating the worst-case end-to-end delay and queue length are derived based on DNS （ deterministic network calcu-lus）.Finally, we illustrate that the scheduling strategy can improve the maximum end-to-end delay, while increase buffer re-quirements of sensor nodes , with numerical analysis .

关 键 词：无线传感网络 服务质量 严格优先级队列调度 端到端时延 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]