{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/16085"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/16085","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Enforcing cooperation and providing quality of service in wireless networks","abstract":"The purpose of this dissertation is to design algorithms that provide quality of service and enforce cooperation in wireless ad hoc networks. Using a simple network model, we first study the performance of some previously proposed cooperation-enforcing strategies and then present a new mechanism. We prove that our mechanism is robust to imperfect measurements, is collusion-resistant, and can achieve full cooperation among nodes. Assuming cooperation is being enforced, we then study the problem of optimal routing and admission control for flows which require a pre-specified bandwidth from the network. We develop an algorithm whose performance is close to that of an omniscient off-line algorithm that has complete a priori knowledge of the entire sequence of flow arrivals and their bandwidth requests, including the future. We then study the problem of congestion control and scheduling in wireless ad hoc networks that have to support a mixture of best-effort and real-time traffic. We propose a model for incorporating the requirements of packets with deadlines in an optimization framework. The solution to the problem results in a joint congestion control and scheduling algorithm which fairly allocates resources to meet the fairness objectives of both elastic and inelastic flows, and the per-packet delay requirements of inelastic flows.","abstract_html":"The purpose of this dissertation is to design algorithms that provide quality of service and enforce cooperation in wireless ad hoc networks. Using a simple network model, we first study the performance of some previously proposed cooperation-enforcing strategies and then present a new mechanism. We prove that our mechanism is robust to imperfect measurements, is collusion-resistant, and can achieve full cooperation among nodes. Assuming cooperation is being enforced, we then study the problem of optimal routing and admission control for flows which require a pre-specified bandwidth from the network. We develop an algorithm whose performance is close to that of an omniscient off-line algorithm that has complete a priori knowledge of the entire sequence of flow arrivals and their bandwidth requests, including the future. We then study the problem of congestion control and scheduling in wireless ad hoc networks that have to support a mixture of best-effort and real-time traffic. We propose a model for incorporating the requirements of packets with deadlines in an optimization framework. The solution to the problem results in a joint congestion control and scheduling algorithm which fairly allocates resources to meet the fairness objectives of both elastic and inelastic flows, and the per-packet delay requirements of inelastic flows.","abstract_has_math":false,"creators":["Jaramillo Jimenez, Juan J."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Srikant, Rayadurgam","Kumar, P.R.","Vaidya, Nitin H.","Veeravalli, Venugopal V."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2010,"date_issued":"2010-05-19T18:34:22Z","date_published":"2010-05-19T18:34:22Z","updated_at":"2026-07-22T22:25:08Z","subjects":["wireless networks","ad hoc networks","cooperation","quality of service"],"languages":["en"],"rights":["Copyright 2010 Juan Jose Jaramillo Jimenez"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/16085","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Srikant, Rayadurgam","Kumar, P.R.","Vaidya, Nitin H.","Veeravalli, Venugopal V."]},{"key":"dc:creator","label":"Author","values":["Jaramillo Jimenez, Juan J."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2010-05-19T18:34:22Z","2010-5"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"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":["wireless networks","ad hoc networks","cooperation","quality of service"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2010 Juan Jose Jaramillo Jimenez"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/16085"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The purpose of this dissertation is to design algorithms that provide quality of service and enforce cooperation in wireless ad hoc networks. Using a simple network model, we first study the performance of some previously proposed cooperation-enforcing strategies and then present a new mechanism. We prove that our mechanism is robust to imperfect measurements, is collusion-resistant, and can achieve full cooperation among nodes. Assuming cooperation is being enforced, we then study the problem of optimal routing and admission control for flows which require a pre-specified bandwidth from the network. We develop an algorithm whose performance is close to that of an omniscient off-line algorithm that has complete a priori knowledge of the entire sequence of flow arrivals and their bandwidth requests, including the future. We then study the problem of congestion control and scheduling in wireless ad hoc networks that have to support a mixture of best-effort and real-time traffic. We propose a model for incorporating the requirements of packets with deadlines in an optimization framework. The solution to the problem results in a joint congestion control and scheduling algorithm which fairly allocates resources to meet the fairness objectives of both elastic and inelastic flows, and the per-packet delay requirements of inelastic flows.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2009-12-10T18:44:47Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 4 dissertation.zip: 363657 bytes, checksum: fe6dee949a67734854064db6b940db44 (MD5) Jaramillo Jimenez_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5) Jaramillo-Jimenez_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5) Jaramillo_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5)","Made available in DSpace on 2010-05-19T18:34:22Z (GMT). No. of bitstreams: 5 Jaramillo Jimenez_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5) Jaramillo-Jimenez_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5) dissertation.zip: 363657 bytes, checksum: fe6dee949a67734854064db6b940db44 (MD5) Jaramillo_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5) license.txt: 4064 bytes, checksum: a5da1e2d323ca4083541e45d36881128 (MD5)"]},{"key":"dc:title","label":"Title","values":["Enforcing cooperation and providing quality of service in wireless networks"]}]}],"canonical_facts":{"dc:contributor":["Srikant, Rayadurgam","Kumar, P.R.","Vaidya, Nitin H.","Veeravalli, Venugopal V."],"dc:creator":["Jaramillo Jimenez, Juan J."],"dc:date":["2010-05-19T18:34:22Z","2010-5"],"dc:description":["The purpose of this dissertation is to design algorithms that provide quality of service and enforce cooperation in wireless ad hoc networks. Using a simple network model, we first study the performance of some previously proposed cooperation-enforcing strategies and then present a new mechanism. We prove that our mechanism is robust to imperfect measurements, is collusion-resistant, and can achieve full cooperation among nodes. Assuming cooperation is being enforced, we then study the problem of optimal routing and admission control for flows which require a pre-specified bandwidth from the network. We develop an algorithm whose performance is close to that of an omniscient off-line algorithm that has complete a priori knowledge of the entire sequence of flow arrivals and their bandwidth requests, including the future. We then study the problem of congestion control and scheduling in wireless ad hoc networks that have to support a mixture of best-effort and real-time traffic. We propose a model for incorporating the requirements of packets with deadlines in an optimization framework. The solution to the problem results in a joint congestion control and scheduling algorithm which fairly allocates resources to meet the fairness objectives of both elastic and inelastic flows, and the per-packet delay requirements of inelastic flows.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2009-12-10T18:44:47Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 4 dissertation.zip: 363657 bytes, checksum: fe6dee949a67734854064db6b940db44 (MD5) Jaramillo Jimenez_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5) Jaramillo-Jimenez_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5) Jaramillo_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5)","Made available in DSpace on 2010-05-19T18:34:22Z (GMT). No. of bitstreams: 5 Jaramillo Jimenez_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5) Jaramillo-Jimenez_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5) dissertation.zip: 363657 bytes, checksum: fe6dee949a67734854064db6b940db44 (MD5) Jaramillo_Juan.pdf: 715884 bytes, checksum: a8c8436c1484b82285258044d2c30f20 (MD5) license.txt: 4064 bytes, checksum: a5da1e2d323ca4083541e45d36881128 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/16085"],"dc:language":["en"],"dc:rights":["Copyright 2010 Juan Jose Jaramillo Jimenez"],"dc:subject":["wireless networks","ad hoc networks","cooperation","quality of service"],"dc:title":["Enforcing cooperation and providing quality of service in wireless networks"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:08Z"}