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

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.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical and Computer Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Singh, Nikhil

Contributors dc:contributor

• Srikant, R.

• Engineering, Electronics and Electrical

Language dc:language

eng

Identifier

(MiAaPQ)AAI3363092

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81132