<?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-21T08:29:16Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/3935" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/3935</identifier><datestamp>2026-05-14T13:57:18Z</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">Hu, An-swol</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-12-06T20:57:35Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-12-06T20:57:35Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2006-12-06T20:57:35Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/3935</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6476233</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Network time synchronization is an important aspect of sensor&#xd;
network operation. It is often achieved by synchronizing the clock&#xd;
of each node in the network to the clock of some reference node.&#xd;
However, it is well known that synchronization error accumulates&#xd;
over multiple hops. This scalability problem presents a&#xd;
challenge for large-scale, multi-hop sensor networks with a large&#xd;
number of nodes distributed over wide areas.&#xd;
&#xd;
In this thesis we develop the use of spatial averaging as an&#xd;
approach to mitigating the effects of the scalability problem.  We&#xd;
first develop a cooperative synchronization technique using spatial&#xd;
averaging that can achieve "perfect" synchronization in the limit&#xd;
of an infinitely dense network.  We show that it is possible to&#xd;
maintain a perfect timing signal with equispaced zero-crossings that&#xd;
occur at integer values of the reference time.   Second, we study&#xd;
the benefits of cooperative time synchronization using spatial&#xd;
averaging in networks of finite density.  We present a protocol that&#xd;
uses spatial averaging to reduce error accumulation in large-scale&#xd;
networks and show that synchronization performance can be&#xd;
significantly improved by increasing network density.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">948335 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">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">time synchronization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">sensor networks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">spatial averaging</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">wireless networks</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Time Synchronization in Large-scale 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">Hu, An-swol</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="d496360b-0b20-46a9-9d1f-fdb2c6510939">
	&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>Time Synchronization in Large-scale Networks&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2006-12-06T20:57:35Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Hu, An-swol&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>time synchronization&lt;/Keyword>
    &lt;Keyword>sensor networks&lt;/Keyword>
    &lt;Keyword>spatial averaging&lt;/Keyword>
    &lt;Keyword>wireless networks&lt;/Keyword>
   	&lt;Abstract>Network time synchronization is an important aspect of sensor&#xd;
network operation. It is often achieved by synchronizing the clock&#xd;
of each node in the network to the clock of some reference node.&#xd;
However, it is well known that synchronization error accumulates&#xd;
over multiple hops. This scalability problem presents a&#xd;
challenge for large-scale, multi-hop sensor networks with a large&#xd;
number of nodes distributed over wide areas.&#xd;
&#xd;
In this thesis we develop the use of spatial averaging as an&#xd;
approach to mitigating the effects of the scalability problem.  We&#xd;
first develop a cooperative synchronization technique using spatial&#xd;
averaging that can achieve &amp;quot;perfect&amp;quot; synchronization in the limit&#xd;
of an infinitely dense network.  We show that it is possible to&#xd;
maintain a perfect timing signal with equispaced zero-crossings that&#xd;
occur at integer values of the reference time.   Second, we study&#xd;
the benefits of cooperative time synchronization using spatial&#xd;
averaging in networks of finite density.  We present a protocol that&#xd;
uses spatial averaging to reduce error accumulation in large-scale&#xd;
networks and show that synchronization performance can be&#xd;
significantly improved by increasing network density.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>