Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (19): 48-53.

Previous Articles     Next Articles

Network calculus based performance upper bounds analysis of cluster-tree wireless sensor network

HONG Yanbing, WANG Yijun, LIU Guibo, XI Bin   

  1. School of Information Science and Engineering, Central South University, Changsha 410083, China
  • Online:2012-07-01 Published:2012-06-27

基于网络演算的簇树WSN性能上界分析

洪雁兵,王一军,刘桂波,席  斌   

  1. 中南大学 信息科学与工程学院,长沙 410083

Abstract: In order to guarantee the Quality of Service(QoS) of Wireless Sensor Network(WSN), the QoS deterministic upper bounds need to be accurately calculated. The data flow entering the node is regulated by leaky bucket, and the node provides rate-latency service for the flow. The node’s bandwidth requirements, queue length upper bound of buffer and the end-to-end upper delay bound have been derived for cluster-tree WSN based on the existing cluster-based WSN performance model using deterministic network calculus theory.

Key words: Wireless Sensor Network(WSN), Quality of Service(QoS), deterministic network calculus, cluster-tree, performance upper bounds

摘要: 为保证WSN的服务质量(QoS),需精确求解其性能上界。对进入WSN节点的数据流进行漏桶管制,节点为数据流提供基于速率-延迟模型的服务保障,在已有簇状拓扑WSN性能模型研究基础上,利用确定性网络演算理论推导簇树WSN节点的有效带宽、缓冲区队列长度上界和数据流端到端延迟上界。

关键词: 无线传感器网络, 服务质量, 确定网络演算, 簇树, 性能上界