Distributed Scheduling in Wireless Multiple Decode-and-forward Relay Networks

In this paper, we study the distributed DOS problem in wireless multiple relays networks. By formulating cooperative scheduling as an extended multi-stage stopping problem, an optimal strategy is proposed achieving the maximal average network throughput for distributed channel access. The strategy is in a tri-level threshold structure, and the optimality is rigorously proved. Close-form expression of the maximal average throughput is also derived, and easy implementation is presented with low complexity facilitating network operation. Furthermore, numerical results are provided verifying the strategy’s effectiveness.