Cooperative Access in Wireless Networks: Stable Throughput and Delay

Abstract

We investigate the impact of a protocol-level cooperation idea in a wireless multiple-access system. By dynamically and opportunistically exploiting spatial diversity among the <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$N$</tex></formula> source users, a packet is delivered to the common destination through either a direct link or through cooperative relaying by intermediate source nodes that have a statistically better channel to the destination. The traffic burstiness at the source is taken into account, and the performance metrics of the stable throughput region and delay are evaluated for the case of packet-erasure channels. We consider conflict-free, work-conserving transmission policies as well as plain time-division multiple-access policy. We establish that the stable throughput regions under both classes of cooperative policies are the same, which strictly contain the stable throughput regions achieved without cooperation. Moreover, the optimal policy for minimizing the average delay among the class of all cooperative work-conserving policies is determined. Then, in the case of two users, the closed-form delay expressions are explicitly derived as well. Our results indicate that cooperation can significantly reduce delay for both users.