{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/31124"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/31124","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Topics in multi-terminal wireless networks","abstract":"In this dissertation, tools from information theory are used to study multiterminal wireless networks. A compress-and-forward scheme with layered decoding is presented for the unicast and multi-source wireless network and shown to be approximately optimal. This scheme is shown to allow better decoding complexity compared to previously known approximately optimal schemes. Characterizing the layered decoding scheme is shown to be equivalent to characterizing an information flow for the wireless network. A nodeflow for a graph with bisubmodular capacity constraints is presented and a max-flow min-cut theorem is presented. This generalizes many well-known results of flows over capacity constrained graphs studied in computer science literature. In the final part of the dissertation, the intuitions from the reciprocal nature of networks are used to present an approximately optimal communication scheme for broadcast networks, which are the reciprocal of the multi-source wireless networks.","abstract_html":"In this dissertation, tools from information theory are used to study multiterminal wireless networks. A compress-and-forward scheme with layered decoding is presented for the unicast and multi-source wireless network and shown to be approximately optimal. This scheme is shown to allow better decoding complexity compared to previously known approximately optimal schemes. Characterizing the layered decoding scheme is shown to be equivalent to characterizing an information flow for the wireless network. A nodeflow for a graph with bisubmodular capacity constraints is presented and a max-flow min-cut theorem is presented. This generalizes many well-known results of flows over capacity constrained graphs studied in computer science literature. In the final part of the dissertation, the intuitions from the reciprocal nature of networks are used to present an approximately optimal communication scheme for broadcast networks, which are the reciprocal of the multi-source wireless networks.","abstract_has_math":false,"creators":["Raja, Adnan"],"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":["Viswanath, Pramod","Chekuri, Chandra S.","Hajek, Bruce","Kumar, P.R.","Veeravalli, Venugopal V."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012-05-22T00:29:37Z","date_published":"2012-05-22T00:29:37Z","updated_at":"2026-07-22T22:25:30Z","subjects":["wireless networks","relay","compress-and-forward","relay schemes","bisubmodular","polymatroidal flow","broadcast","reciprocity"],"languages":["en"],"rights":["Copyright 2012 Adnan Raja"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/31124","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Viswanath, Pramod","Chekuri, Chandra S.","Hajek, Bruce","Kumar, P.R.","Veeravalli, Venugopal V."]},{"key":"dc:creator","label":"Author","values":["Raja, Adnan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012-05-22T00:29:37Z","2012-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"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","relay","compress-and-forward","relay schemes","bisubmodular","polymatroidal flow","broadcast","reciprocity"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2012 Adnan Raja"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/31124"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In this dissertation, tools from information theory are used to study multiterminal wireless networks. A compress-and-forward scheme with layered decoding is presented for the unicast and multi-source wireless network and shown to be approximately optimal. This scheme is shown to allow better decoding complexity compared to previously known approximately optimal schemes. Characterizing the layered decoding scheme is shown to be equivalent to characterizing an information flow for the wireless network. A nodeflow for a graph with bisubmodular capacity constraints is presented and a max-flow min-cut theorem is presented. This generalizes many well-known results of flows over capacity constrained graphs studied in computer science literature. In the final part of the dissertation, the intuitions from the reciprocal nature of networks are used to present an approximately optimal communication scheme for broadcast networks, which are the reciprocal of the multi-source wireless networks.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-02-14T18:36:55Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Raja_Adnan.pdf: 426610 bytes, checksum: f44a6d89fa676ccd9133280b6d978698 (MD5)","Made available in DSpace on 2012-05-22T00:29:37Z (GMT). No. of bitstreams: 2 Raja_Adnan.pdf: 426610 bytes, checksum: f44a6d89fa676ccd9133280b6d978698 (MD5) license.txt: 4058 bytes, checksum: 489ceb79e6300938792f4fdacba1df39 (MD5)"]},{"key":"dc:title","label":"Title","values":["Topics in multi-terminal wireless networks"]}]}],"canonical_facts":{"dc:contributor":["Viswanath, Pramod","Chekuri, Chandra S.","Hajek, Bruce","Kumar, P.R.","Veeravalli, Venugopal V."],"dc:creator":["Raja, Adnan"],"dc:date":["2012-05-22T00:29:37Z","2012-05"],"dc:description":["In this dissertation, tools from information theory are used to study multiterminal wireless networks. A compress-and-forward scheme with layered decoding is presented for the unicast and multi-source wireless network and shown to be approximately optimal. This scheme is shown to allow better decoding complexity compared to previously known approximately optimal schemes. Characterizing the layered decoding scheme is shown to be equivalent to characterizing an information flow for the wireless network. A nodeflow for a graph with bisubmodular capacity constraints is presented and a max-flow min-cut theorem is presented. This generalizes many well-known results of flows over capacity constrained graphs studied in computer science literature. In the final part of the dissertation, the intuitions from the reciprocal nature of networks are used to present an approximately optimal communication scheme for broadcast networks, which are the reciprocal of the multi-source wireless networks.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-02-14T18:36:55Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Raja_Adnan.pdf: 426610 bytes, checksum: f44a6d89fa676ccd9133280b6d978698 (MD5)","Made available in DSpace on 2012-05-22T00:29:37Z (GMT). No. of bitstreams: 2 Raja_Adnan.pdf: 426610 bytes, checksum: f44a6d89fa676ccd9133280b6d978698 (MD5) license.txt: 4058 bytes, checksum: 489ceb79e6300938792f4fdacba1df39 (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/31124"],"dc:language":["en"],"dc:rights":["Copyright 2012 Adnan Raja"],"dc:subject":["wireless networks","relay","compress-and-forward","relay schemes","bisubmodular","polymatroidal flow","broadcast","reciprocity"],"dc:title":["Topics in multi-terminal wireless networks"],"dc:type":["text"],"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:30Z"}