Finite horizon scheduling in wireless ad hoc networks

A cooperative ratio-based scheduling scheme with minimal signaling to enhance network throughput and fairness in wireless ad hoc network is presented in this paper. Throughput and fairness maximization problem in a finite horizon (short term) is formulated as a novel multi-window optimization problem. Through analysis users´ thresholds are shown to be time variant to achieve throughput maximization with fairness in each window. Simulation results clearly show that compared with non decision-based strategy, ratio-based scheme achieves within 1.6% of the maximum throughput value and is scalable in terms of the number of nodes. Fairness performance is marginally better than non decision-based strategy.