{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/91099"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/91099","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"A delay-constrained cross-layer model using network coding","abstract":"Traditionally, most packet-switched networks have only one wireless hop: the link between the end users and their access point. However, there is increasing interest in using wireless links to reach the edge of the network. Having more than one wireless link is a game changer. Network layer architecture is predicated on the assumption that the lower layers are reliable, but this comes at a high cost in terms of data rate on a band-limited, lossy wireless channel. This cost is tolerable over one underutilized link, but when the network demands high-capacity wireless links, it may be time to rethink the way the packet-switched network interacts with its underlying infrastructure. The aim of this thesis is to provide a general model that can be used to frame a wide variety of cross-layer coding problems. We do not explicitly consider the channel code, medium access, or modulation; instead, we leverage the maturity of these fields to observe the general effect they produce on higher layers. We focus our model on applications where delay is constrained, which forces us to consider coding results in the regime where code length is non-asymptotically large. In trying to extend our analysis to multi-hop flows, we develop an analytical tool that can be useful in wider applications. This tool simplifies certain network flows to a distribution on the amount of information available to the destination; it is a step towards characterizing network information flows in the non-asymptotic regime. Finally, we will use the model to design encoding schemes, given practically-motivated constraints.","abstract_html":"Traditionally, most packet-switched networks have only one wireless hop: the link between the end users and their access point. However, there is increasing interest in using wireless links to reach the edge of the network. Having more than one wireless link is a game changer. Network layer architecture is predicated on the assumption that the lower layers are reliable, but this comes at a high cost in terms of data rate on a band-limited, lossy wireless channel. This cost is tolerable over one underutilized link, but when the network demands high-capacity wireless links, it may be time to rethink the way the packet-switched network interacts with its underlying infrastructure. The aim of this thesis is to provide a general model that can be used to frame a wide variety of cross-layer coding problems. We do not explicitly consider the channel code, medium access, or modulation; instead, we leverage the maturity of these fields to observe the general effect they produce on higher layers. We focus our model on applications where delay is constrained, which forces us to consider coding results in the regime where code length is non-asymptotically large. In trying to extend our analysis to multi-hop flows, we develop an analytical tool that can be useful in wider applications. This tool simplifies certain network flows to a distribution on the amount of information available to the destination; it is a step towards characterizing network information flows in the non-asymptotic regime. Finally, we will use the model to design encoding schemes, given practically-motivated constraints.","abstract_has_math":false,"creators":["Adams, David C. (David Christopher)"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Muriel Médard and Christopher Yu."],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014","date_published":"2014","updated_at":"2026-07-22T22:21:13Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/91099","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Muriel Médard and Christopher Yu."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Adams, David C. (David Christopher)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-10-21T17:25:59Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-10-21T17:25:59Z"]},{"key":"dc:date.issued","label":"Date","values":["2014"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/91099"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.","27","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 79-81)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Traditionally, most packet-switched networks have only one wireless hop: the link between the end users and their access point. However, there is increasing interest in using wireless links to reach the edge of the network. Having more than one wireless link is a game changer. Network layer architecture is predicated on the assumption that the lower layers are reliable, but this comes at a high cost in terms of data rate on a band-limited, lossy wireless channel. This cost is tolerable over one underutilized link, but when the network demands high-capacity wireless links, it may be time to rethink the way the packet-switched network interacts with its underlying infrastructure. The aim of this thesis is to provide a general model that can be used to frame a wide variety of cross-layer coding problems. We do not explicitly consider the channel code, medium access, or modulation; instead, we leverage the maturity of these fields to observe the general effect they produce on higher layers. We focus our model on applications where delay is constrained, which forces us to consider coding results in the regime where code length is non-asymptotically large. In trying to extend our analysis to multi-hop flows, we develop an analytical tool that can be useful in wider applications. This tool simplifies certain network flows to a distribution on the amount of information available to the destination; it is a step towards characterizing network information flows in the non-asymptotic regime. Finally, we will use the model to design encoding schemes, given practically-motivated constraints."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M."]},{"key":"dc:title","label":"Title","values":["A delay-constrained cross-layer model using network coding"]}]}],"canonical_facts":{"dc:contributor.advisor":["Muriel Médard and Christopher Yu."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Adams, David C. (David Christopher)"],"dc:date.accessioned":["2014-10-21T17:25:59Z"],"dc:date.available":["2014-10-21T17:25:59Z"],"dc:date.issued":["2014"],"dc:description":["Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.","27","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 79-81)."],"dc:description.abstract":["Traditionally, most packet-switched networks have only one wireless hop: the link between the end users and their access point. However, there is increasing interest in using wireless links to reach the edge of the network. Having more than one wireless link is a game changer. Network layer architecture is predicated on the assumption that the lower layers are reliable, but this comes at a high cost in terms of data rate on a band-limited, lossy wireless channel. This cost is tolerable over one underutilized link, but when the network demands high-capacity wireless links, it may be time to rethink the way the packet-switched network interacts with its underlying infrastructure. The aim of this thesis is to provide a general model that can be used to frame a wide variety of cross-layer coding problems. We do not explicitly consider the channel code, medium access, or modulation; instead, we leverage the maturity of these fields to observe the general effect they produce on higher layers. We focus our model on applications where delay is constrained, which forces us to consider coding results in the regime where code length is non-asymptotically large. In trying to extend our analysis to multi-hop flows, we develop an analytical tool that can be useful in wider applications. This tool simplifies certain network flows to a distribution on the amount of information available to the destination; it is a step towards characterizing network information flows in the non-asymptotic regime. Finally, we will use the model to design encoding schemes, given practically-motivated constraints."],"dc:description.degree":["S.M."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/91099"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["A delay-constrained cross-layer model using network coding"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:13Z"}