A topology-independent fair queueing model in ad hoc wireless networks

@inproceedings{citeulike:809154, abstract = {Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network remains largely unaddressed because of the unique design issues such as location-dependent contention, spatial channel reuse, conflicts between ensuring fairness and maximizing channel utilization, and distributed fair scheduling. In this paper we propose a new topology-independent fair queueing model for a shared-medium ad hoc network. Our model ensures coordinated fair channel access among spatially contending flows while seeking to maximize spatial channel reuse. We describe packetized algorithms that realize the fluid fairness model with analytically provable performance bounds. We further design distributed implementations that approximate the ideal centralized algorithm. We evaluate our design through both simulations and analysis}, author = {Luo, Haiyun and Lu, Songwu }, citeulike-article-id = {809154}, journal = {Network Protocols, 2000. Proceedings. 2000 International Conference on}, keywords = {fair, manet, qos, queueing}, pages = {325--335}, posted-at = {2006-08-21 13:23:09}, priority = {2}, title = {A topology-independent fair queueing model in ad hoc wireless networks}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=896316}, year = {2000} }

TY - CONF ID - citeulike:809154 L3 - citeulike-article-id:809154 TI - A topology-independent fair queueing model in ad hoc wireless networks JF - Network Protocols, 2000. Proceedings. 2000 International Conference on SP - 325 EP - 335 N2 - Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network remains largely unaddressed because of the unique design issues such as location-dependent contention, spatial channel reuse, conflicts between ensuring fairness and maximizing channel utilization, and distributed fair scheduling. In this paper we propose a new topology-independent fair queueing model for a shared-medium ad hoc network. Our model ensures coordinated fair channel access among spatially contending flows while seeking to maximize spatial channel reuse. We describe packetized algorithms that realize the fluid fairness model with analytically provable performance bounds. We further design distributed implementations that approximate the ideal centralized algorithm. We evaluate our design through both simulations and analysis KW - fair KW - manet KW - qos KW - queueing AU - Luo, Haiyun AU - Lu, Songwu PY - 2000/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=896316 ER -