{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81132"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81132","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Distributed Algorithms for Resource Allocation in Multi-Hop Random Access Wireless Networks","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Singh, Nikhil"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Srikant, R."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:09:42Z","date_published":"2015-09-25T20:09:42Z","updated_at":"2026-07-22T22:26:15Z","subjects":["Engineering, Electronics and Electrical"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3363092"],"render_values":[{"text":"(MiAaPQ)AAI3363092","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81132","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Srikant, R."]},{"key":"dc:creator","label":"Author","values":["Singh, Nikhil"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:09:42Z","10000-01-01","2009"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Electronics and Electrical"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81132","(MiAaPQ)AAI3363092"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","Made available in DSpace on 2015-09-25T20:09:42Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3363092.pdf: 1919120 bytes, checksum: 198a7d0f032bc2b198269fbd12b85c7b (MD5) Previous issue date: 2009","Embargo set by: Seth Robbins for item 82414 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","108 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009."]},{"key":"dc:title","label":"Title","values":["Distributed Algorithms for Resource Allocation in Multi-Hop Random Access Wireless Networks"]}]}],"canonical_facts":{"dc:contributor":["Srikant, R."],"dc:creator":["Singh, Nikhil"],"dc:date":["2015-09-25T20:09:42Z","10000-01-01","2009"],"dc:description":["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.","Made available in DSpace on 2015-09-25T20:09:42Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3363092.pdf: 1919120 bytes, checksum: 198a7d0f032bc2b198269fbd12b85c7b (MD5) Previous issue date: 2009","Embargo set by: Seth Robbins for item 82414 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","108 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2009."],"dc:identifier":["http://hdl.handle.net/2142/81132","(MiAaPQ)AAI3363092"],"dc:language":["eng"],"dc:subject":["Engineering, Electronics and Electrical"],"dc:title":["Distributed Algorithms for Resource Allocation in Multi-Hop Random Access Wireless Networks"],"dc:type":["text"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:15Z"}