<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/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-11-21T10:04:18Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/3294" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/3294</identifier><datestamp>2026-05-14T13:49:01Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</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="author">Sirkeci, Birsen</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-07-19T12:10:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-07-19T12:10:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2006-07-19T12:10:21Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/3294</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6476144</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Cooperative communication employs distributed transmission resources&#xd;
at the physical layer as a single radio with spatial diversity in&#xd;
order to increase the performance of wireless networks. However,&#xd;
node cooperation entails large communication overhead, and&#xd;
distributed protocols that eliminate or reduce the communication&#xd;
overhead are desirable. This dissertation proposes distributed&#xd;
cooperative schemes for wireless ad hoc networks and develops new&#xd;
methods to analyze their performance.&#xd;
&#xd;
&#xd;
First, we study the behavior of distributed cooperative transmission&#xd;
in wireless networks for both point-to-point and broadcasting&#xd;
scenarios. In particular, we analyze the effect of critical network&#xd;
parameters on the number of nodes reached by cooperative&#xd;
transmission.  We show that there exists a phase transition in the&#xd;
network behavior: if the decoding threshold is below a critical&#xd;
value, the message is delivered to the intended recipient(s).&#xd;
Otherwise, only a fraction of the nodes is reached. Our approach is&#xd;
based on the idea of continuum approximation, which yields&#xd;
closed-form expressions that are accurate when the network density&#xd;
is high.&#xd;
&#xd;
We next study the optimal power allocation problem for the&#xd;
cooperative broadcast in dense large-scale networks. The&#xd;
transmission order (schedule) and the transmission powers of the&#xd;
relays are designed so that the message reaches the entire network&#xd;
with the minimum possible total power consumption. In general,&#xd;
finding the best scheduling in cooperative broadcast is known to be&#xd;
an NP-complete problem. We show that the optimal scheduling problem&#xd;
can be solved for dense networks, which can be expressed as a&#xd;
continuum of nodes.&#xd;
&#xd;
&#xd;
Finally, we study the design of distributed space-time codes for&#xd;
cooperative communication. With few exceptions, most of the&#xd;
literature on the subject proposes coding rules such that either&#xd;
inter-node communication or a central control unit is required for&#xd;
code assignment.  We introduce novel randomized strategies that&#xd;
decentralize the transmission of a space time code from a set of&#xd;
distributed relays. Our simple idea is to let each node transmit an&#xd;
independent random linear combination of the codewords that would&#xd;
have been transmitted by all the elements of a multi-antenna system.&#xd;
We show that the proposed scheme achieves the optimal diversity&#xd;
order.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1470884 bytes</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" />
   <dim:field mdschema="dc" element="subject" lang="en_US">cooperative communication</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">distributed protocols</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Distributed Cooperative Communication in Large-Scale Wireless Networks</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Sirkeci, Birsen</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="30b1f42e-a707-4e56-9240-56cdfa4ffdb5">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
   	&lt;Title>Distributed Cooperative Communication in Large-Scale Wireless Networks&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2006-07-19T12:10:21Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Sirkeci, Birsen&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>cooperative communication&lt;/Keyword>
    &lt;Keyword>distributed protocols&lt;/Keyword>
   	&lt;Abstract>Cooperative communication employs distributed transmission resources&#xd;
at the physical layer as a single radio with spatial diversity in&#xd;
order to increase the performance of wireless networks. However,&#xd;
node cooperation entails large communication overhead, and&#xd;
distributed protocols that eliminate or reduce the communication&#xd;
overhead are desirable. This dissertation proposes distributed&#xd;
cooperative schemes for wireless ad hoc networks and develops new&#xd;
methods to analyze their performance.&#xd;
&#xd;
&#xd;
First, we study the behavior of distributed cooperative transmission&#xd;
in wireless networks for both point-to-point and broadcasting&#xd;
scenarios. In particular, we analyze the effect of critical network&#xd;
parameters on the number of nodes reached by cooperative&#xd;
transmission.  We show that there exists a phase transition in the&#xd;
network behavior: if the decoding threshold is below a critical&#xd;
value, the message is delivered to the intended recipient(s).&#xd;
Otherwise, only a fraction of the nodes is reached. Our approach is&#xd;
based on the idea of continuum approximation, which yields&#xd;
closed-form expressions that are accurate when the network density&#xd;
is high.&#xd;
&#xd;
We next study the optimal power allocation problem for the&#xd;
cooperative broadcast in dense large-scale networks. The&#xd;
transmission order (schedule) and the transmission powers of the&#xd;
relays are designed so that the message reaches the entire network&#xd;
with the minimum possible total power consumption. In general,&#xd;
finding the best scheduling in cooperative broadcast is known to be&#xd;
an NP-complete problem. We show that the optimal scheduling problem&#xd;
can be solved for dense networks, which can be expressed as a&#xd;
continuum of nodes.&#xd;
&#xd;
&#xd;
Finally, we study the design of distributed space-time codes for&#xd;
cooperative communication. With few exceptions, most of the&#xd;
literature on the subject proposes coding rules such that either&#xd;
inter-node communication or a central control unit is required for&#xd;
code assignment.  We introduce novel randomized strategies that&#xd;
decentralize the transmission of a space time code from a set of&#xd;
distributed relays. Our simple idea is to let each node transmit an&#xd;
independent random linear combination of the codewords that would&#xd;
have been transmitted by all the elements of a multi-antenna system.&#xd;
We show that the proposed scheme achieves the optimal diversity&#xd;
order.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>