基于网络演算的无线自组网QoS性能确定上界研究

Deterministic upper bounds on QoS performance about wireless ad hoc network based on network calculus

为保证无线自组网的服务质量(QoS),需精确求解其性能确定上界。对进入无线自组网节点的数据流进行漏桶管制,节点为数据流提供基于速率—延迟(rate-latency)模型的服务保障,在已有无线自组网链路吞吐量模型的基础上利用网络演算理论推导了无线自组网节点的积压数据上界、端到端数据流的延迟上界以及端到端数据流的延迟抖动上界模型。对网格形式拓扑的无线自组网,不同数据流的仿真结果都在数值计算的上界范围之内,表明基于网络演算理论的无线自组网的QoS性能上界模型具有较好的性能。

In order to guarantee the QoS for wireless ad hoc network, the QoS deterministic upper bounds need to be accurately calculated. The data flow entering the node was regulated by leaky bucket, and the node provided rate-latency service for the flow. The node＇s backlog upper bound,the end-to-end upper delay bound and the end-to-end upper delay jitter bound had been derived for wireless ad hoc network based on the existing link throughput model using network calculus theory. For grid topology wireless ad hoc network, all simulated results for different data flows were bounded by theoretical results. These show the QoS performance upper bounds model perform well.