为保证wsN的服务质量(QoS),需精确求解其性能上界。对进入WSN节点的数据流进行漏桶管制,节点为数据流提供基于速率.延迟模型的服务保障,在已有簇状拓扑WSN性能模型研究基础上,利用确定性网络演算理论推导簇树WSN节点的有效带宽、缓冲区队列长度上界和数据流端到端延迟上界。
In order to guarantee the Quality of Service (QoS) of Wireless Sensor Network (WSN), the QoS deter- ministic 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.