高速无线网络中延时约束下最优的数据包聚合机制
Delay-Constrained Optimized Packet Aggregation in High-Speed Wireless Networks
-
摘要: 为了满足日益增长的高吞吐量和多媒体应用需求,IEEE提出了一些基于802.11的高速无线网络(比如802.11n)。考虑到IEEE802.11的介质访问控制协议(MAC)的效率随着物理速率的提高而下降,相关工作首先将许多数据包聚合为一个大的数据帧,然后采用整体发送该数据帧的方法来降低协MAC协议的负载,提高它的效率。但是,发送这些大尺寸的数据帧将会显著影响其它节点的延时和抖动。因此,对于一些在延时方面有特殊需求的多媒体应用来说,如何确定最大聚合帧的尺寸边界是至关重要的。本文提出了一种最优的数据包聚合机制OPA。OPA基于受限的凸优化方法来获得每个节点关于其它节点延时约束的最优的数据包聚合数目。在满足延时约束的同时,OPA可以实现信道的公平共享。此外,OPA以较低的复杂度保证数据包的聚合可以达到一个最优的聚合点。仿真结果显示OPA能够成功地对延时进行约束从而满足不同的应用需求,同时,由于限定了数据包的聚合规模,即使在动态环境下,OPA对数据吞吐率的影响也非常小。Abstract: High-speed wireless networks such as IEEE 802.11n have been introduced based on IEEE 802.11 to meet the growing demand for high-throughput and multimedia applications. It is known that the medium access control (MAC) efficiency of IEEE 802.11 decreases with increasing the physical rate. To improve efficiency, few solutions have been proposed such as Aggregation to concatenate a number of packets into a larger frame and send it at once to reduce the protocol overhead. Since transmitting larger frames eventuates to dramatic delay and jitter increase in other nodes, bounding the maximum aggregated frame size is important to satisfy delay requirements of especially multimedia applications. In this paper, we propose a scheme called Optimized Packet Aggregation (OPA) which models the network by constrained convex optimization to obtain the optimal aggregation size of each node regarding to delay constraints of other nodes. OPA attains proportionally fair sharing of the channel while satisfying delay constrains. Furthermore, reaching the optimal point is guaranteed in OPA with low complexity. Simulation results show that OPA can successfully bound delay and meet the requirements of nodes with only an insignificant throughput penalty due to limiting the aggregation size even in dynamic conditions.
下载: