<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T05:53:13Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/16786" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/16786</identifier><datestamp>2022-01-13T07:54:29Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131022</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Robert Gallager.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Schein, Brett E. (Brett Eric)</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2005-05-19T14:35:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2005-05-19T14:35:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2001</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2001</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/16786</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">49839193</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 227-231).</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">This electronic version was submitted by the student author.  The certified thesis is available in the Institute Archives and Special Collections.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Constructing a large-scale wireless data network is spectacularly expensive. It is therefore important to understand how to efficiently utilize the physical infrastructure and available battery power, which are expensive system resources. Unfortunately, we currently understand very little about efficient communication in a distributed environment. In distributed wireless networks, there appears to be an interesting and complex trade-off between trying to take advantage of independent noisy signals at different relays and closely coordinating relay transmissions to a receiver. Designing the right structure for efficient communication, by choice of source transmission codebook and relay terminal processing, is the important and difficult problem on which we focus. We use an information theoretic framework to study several very simple multiple terminal networks, focusing exclusively on single source, single destination networks where communication must take place through intermediate nodes. Our goal is to determine how much data we can get reliably from source to destination, placing no importance on delay or computational complexity. The core problem then involves distributed detection at the intermediate nodes and coordination in relaying information to the destination.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Brett E. Schein.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Ph.D.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">231 p.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1678843 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1678596 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Distributed coordination in network information theory</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="8dcc383b-e954-44a4-bab2-cdaf3f0b5f7d">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Distributed coordination in network information theory&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2001&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Schein, Brett E. (Brett Eric)&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Electrical Engineering and Computer Science.&lt;/Keyword>
   	&lt;Abstract>Constructing a large-scale wireless data network is spectacularly expensive. It is therefore important to understand how to efficiently utilize the physical infrastructure and available battery power, which are expensive system resources. Unfortunately, we currently understand very little about efficient communication in a distributed environment. In distributed wireless networks, there appears to be an interesting and complex trade-off between trying to take advantage of independent noisy signals at different relays and closely coordinating relay transmissions to a receiver. Designing the right structure for efficient communication, by choice of source transmission codebook and relay terminal processing, is the important and difficult problem on which we focus. We use an information theoretic framework to study several very simple multiple terminal networks, focusing exclusively on single source, single destination networks where communication must take place through intermediate nodes. Our goal is to determine how much data we can get reliably from source to destination, placing no importance on delay or computational complexity. The core problem then involves distributed detection at the intermediate nodes and coordination in relaying information to the destination.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>