计算机与现代化

• 网络与通信 • 上一篇    下一篇

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

  

  1. (广西大学计算机与电子信息学院,广西 南宁 530004)
  • 收稿日期:2014-04-08 出版日期:2014-07-16 发布日期:2014-07-17
  • 作者简介:陈越洋(1989-),男,广西平果人,广西大学计算机与电子信息学院硕士研究生,研究方向:网络演算,网络分析; 顾平,女,教授,博士,研究方向:数据库理论与应用; 张超,男,硕士研究生,研究方向:MDA,网络与并行计算。

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

  1. (School of Computer, Electronics and Information, Guangxi University, Nanning 530004, China)
  • Received:2014-04-08 Online:2014-07-16 Published:2014-07-17

摘要: 为了改善无线传感网络在最坏条件下的网络服务质量(Quality of Service, QoS),本文将严格优先级(Strict Priority, SP)队列调度引入簇树型无线传感网络中,分析SP队列调度对网络中数据流获得的保证服务的影响,并利用网络演算推导簇树网络中各深度路由节点的时延上界、缓存上界及网络的端到端时延上界。通过实例分析,表明SP队列调度能够有效减小网络的最大端到端时延。

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

Abstract: 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 expressions of calculating the worst-case end-to-end delay and queue length are derived based on DNS (deterministic network calculus). Finally, we illustrate that the scheduling strategy can improve the maximum end-to-end delay, while increase buffer requirements of sensor nodes, with numerical analysis.

Key words: WSN, QoS, SP scheduling, end-to-end delay

中图分类号: