Computer and Modernization ›› 2014, Vol. 0 ›› Issue (7): 117-120.doi: 10.3969/j.issn.1006-2475.2014.07.026

Previous Articles     Next Articles

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

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

CLC Number: