Skip to Main Content
The dynamic throughput optimal policy that supports all incoming traffic while minimizing outage probability for cooperative ad-hoc network is consider in this paper. The algorithm operates without knowledge of traffic rates or the memory historical channel states. Using the technique of Lyapunov optimization, we present a framework that can tradeoff between the capacity region the total outage probability of network. Distance this minimum outage probability is controlled by a parameter V effecting an explicit tradeoff in average queue length. We also use simulation to compare the performance of our policy with two-hop relay policy as well as non-cooperative policy.