<?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-19T00:25:55Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/26710" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/26710</identifier><datestamp>2022-01-13T07:54:29Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</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">Eytan Modiano, Lizhong Zheng and Jinane Abounadi.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Khandani, Amir E. (Amir Ehsan), 1979-</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-09-06T19:45:10Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2005-09-06T19:45:10Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2004</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2004</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/26710</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">57418357</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.</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" lang="en_US">Includes bibliographical references (p. 87-89).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">In this thesis, we study the problem of energy efficiency and reliability in wireless ad-hoc networks. First, we introduce the idea of wireless cooperation advantage. We formulate the problem of finding the minimum energy cooperative route for a wireless network under idealized channel and receiver models. Fundamental to the understanding of the routing problem is the understanding of the optimal power allocation for a single message transmission between two sets of nodes. We present the solution to this problem, and use that as the basis for solving the minimum energy cooperative routing problem. We analytically obtain the energy savings in regular line and regular grid networks. We propose heuristics for selecting the cooperative route in random networks and give simulation results confirming significant energy savings achieved through cooperation. In the second part, we study the problem of route reliability in a multi-hop network. We look at the reliability issue at the link level and extend those result to a wireless network setting. In the network setting, we first define and analyze the reliability for a fixed route and then propose algorithms for finding the optimal route between a source-destination pair of nodes. The relationship between the route reliability and consumed power is studied. The idea of route diversity is introduced as a way to improve the reliability by taking advantage of the broadcast property, the independence of fading state between different pairs of nodes, and space diversity created by multiple intermediate relay nodes along the route. We give analytical results on improvements due to route diversity in some simple network topologies.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Amir E. Khandani.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">89 p.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">490881 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">482963 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">en_US</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">Cooperative routing in wireless networks</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="02b9201f-aa8d-43b5-b017-e16e6cc4f736">
	&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>en_US&lt;/Language>
   	&lt;Title>Cooperative routing in wireless networks&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2004&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Khandani, Amir E. (Amir Ehsan), 1979-&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>In this thesis, we study the problem of energy efficiency and reliability in wireless ad-hoc networks. First, we introduce the idea of wireless cooperation advantage. We formulate the problem of finding the minimum energy cooperative route for a wireless network under idealized channel and receiver models. Fundamental to the understanding of the routing problem is the understanding of the optimal power allocation for a single message transmission between two sets of nodes. We present the solution to this problem, and use that as the basis for solving the minimum energy cooperative routing problem. We analytically obtain the energy savings in regular line and regular grid networks. We propose heuristics for selecting the cooperative route in random networks and give simulation results confirming significant energy savings achieved through cooperation. In the second part, we study the problem of route reliability in a multi-hop network. We look at the reliability issue at the link level and extend those result to a wireless network setting. In the network setting, we first define and analyze the reliability for a fixed route and then propose algorithms for finding the optimal route between a source-destination pair of nodes. The relationship between the route reliability and consumed power is studied. The idea of route diversity is introduced as a way to improve the reliability by taking advantage of the broadcast property, the independence of fading state between different pairs of nodes, and space diversity created by multiple intermediate relay nodes along the route. We give analytical results on improvements due to route diversity in some simple network topologies.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>