<?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-20T00:07:23Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/41657" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/41657</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">Moe Z. Win.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Lien, Jaime</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">2008-05-19T16:06:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-05-19T16:06:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2007</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/41657</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">219735388</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 89-93).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Location-aware technologies have the potential to revolutionize computing, cellular services, sensor networks, and many other commercial, military, and social applications. In wireless networks, accurate information about an agent's location can give meaning to observed data and facilitate the agent's interactions with its surroundings and neighbors. Determining the location of one or more agents, known as localization or positioning, is a fundamental challenge. Most existing localization methods rely on existing infrastructure and hence lack the flexibility and robustness necessary for large ad-hoc networks. In this thesis, we describe a framework for localization that overcomes these limitations by utilizing cooperation: the agents in the network work together to determine their individual locations. We derive a practical algorithm for cooperative localization by formulating the problem as a factor graph and applying the sum-product algorithm. Each agent uses relative positioning measurements and probabilistic location information from its neighbors to iteratively update its location estimate. We investigate the performance of this algorithm in a network of ultra-wideband (UWB) nodes, which are well-suited for localization due to their potential to measure inter-node distances with high accuracy. Realistic models of UWB ranging error, based on an extensive measurement campaign in several indoor environments, are incorporated into the localization algorithm. Using the experimental data and simulations, we quantify the benefits that cooperation brings to localization.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Jaime Lien.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">M.Eng.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">93 p.</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" lang="en_US">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">A framework for cooperative localization in ultra-wideband 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="57f87688-da34-401b-a8e2-769edc40f8d7">
	&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>A framework for cooperative localization in ultra-wideband wireless networks&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2007&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Lien, Jaime&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>Location-aware technologies have the potential to revolutionize computing, cellular services, sensor networks, and many other commercial, military, and social applications. In wireless networks, accurate information about an agent&amp;apos;s location can give meaning to observed data and facilitate the agent&amp;apos;s interactions with its surroundings and neighbors. Determining the location of one or more agents, known as localization or positioning, is a fundamental challenge. Most existing localization methods rely on existing infrastructure and hence lack the flexibility and robustness necessary for large ad-hoc networks. In this thesis, we describe a framework for localization that overcomes these limitations by utilizing cooperation: the agents in the network work together to determine their individual locations. We derive a practical algorithm for cooperative localization by formulating the problem as a factor graph and applying the sum-product algorithm. Each agent uses relative positioning measurements and probabilistic location information from its neighbors to iteratively update its location estimate. We investigate the performance of this algorithm in a network of ultra-wideband (UWB) nodes, which are well-suited for localization due to their potential to measure inter-node distances with high accuracy. Realistic models of UWB ranging error, based on an extensive measurement campaign in several indoor environments, are incorporated into the localization algorithm. Using the experimental data and simulations, we quantify the benefits that cooperation brings to localization.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>