Distributed Algorithms for Resource Allocation in Multi-Hop Random Access Wireless Networks

108 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009.We then present a distributed flow-based access scheme for slotted-time protocols that provides proportional fairness with respect to flow-throughput under constraints on the buffer overflow probabilities at each node. We model the end-to-end flows in an ad hoc wireless network using a tandem of finite-size, discrete-time queues, located at the nodes along the routes used by the flows. The proposed scheme requires local information exchange at the link layer and end-to-end information exchange at the transport layer, and is cast in the framework of nonlinear optimization. A distributed dual-based algorithm is proposed to adjust the channel access probabilities to achieve proportional fairness under the above-mentioned constraints. A key contribution of this work lies in the construction of a distributed dual approach that comes with low computational overhead. We establish the convergence to the global optimum under the proposed scheme. MATLAB-based simulation results, along with NS2 simulations using ST-MAC as the MAC protocol, are presented to support our conclusions.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD