Throughput-Optimal Random Access With Order-Optimal Delay
2011 PROCEEDINGS IEEE INFOCOM(2011)
摘要
In this paper, we consider CSMA policies for scheduling packet transmissions in multihop wireless networks with one-hop traffic. The main contribution of the paper is to propose a novel CSMA policy, called Unlocking CSMA (UCSMA), that enables to obtain both high throughput and low packet delays in large wireless networks. More precisely, we show that for torus interference graph topologies with one-hop traffic, U-CSMA is throughput optimal and achieves order-optimal delay. For one-hop traffic, the delay performance is defined to be order-optimal if the delay stays bounded as the network-size increases. Simulations that we conducted suggest that (a) UCSMA is throughput-optimal and achieves order-optimal delay for general geometric interference graphs and (b) that U-CSMA can be combined with congestion control algorithms to maximize the network-wide utility and obtain order-optimal delay. To the best of our knowledge, this is the first time that a simple distributed scheduling policy has been proposed that is both throughput/utility optimal and achieves order-optimal delay.
更多查看译文
关键词
high throughput,random access,wireless networks,scheduling,interference,wireless network,schedules,geometry,lattices,congestion control,throughput
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络