Show simple item record

dc.contributor.advisorMuriel Médard and Christopher Yu.en_US
dc.contributor.authorAdams, David C. (David Christopher)en_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2014-10-21T17:25:59Z
dc.date.available2014-10-21T17:25:59Z
dc.date.copyright2014en_US
dc.date.issued2014en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/91099
dc.descriptionThesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.en_US
dc.description27en_US
dc.descriptionCataloged from PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 79-81).en_US
dc.description.abstractTraditionally, 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.en_US
dc.description.statementofresponsibilityby David C. Adams.en_US
dc.format.extent81 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectElectrical Engineering and Computer Science.en_US
dc.titleA delay-constrained cross-layer model using network codingen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc892740319en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record