{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/3935"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/3935","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"Time Synchronization in Large-scale Networks","abstract":"Network time synchronization is an important aspect of sensor network operation. It is often achieved by synchronizing the clock of each node in the network to the clock of some reference node. However, it is well known that synchronization error accumulates over multiple hops. This scalability problem presents a challenge for large-scale, multi-hop sensor networks with a large number of nodes distributed over wide areas. In this thesis we develop the use of spatial averaging as an approach to mitigating the effects of the scalability problem. We first develop a cooperative synchronization technique using spatial averaging that can achieve \"perfect\" synchronization in the limit of an infinitely dense network. We show that it is possible to maintain a perfect timing signal with equispaced zero-crossings that occur at integer values of the reference time. Second, we study the benefits of cooperative time synchronization using spatial averaging in networks of finite density. We present a protocol that uses spatial averaging to reduce error accumulation in large-scale networks and show that synchronization performance can be significantly improved by increasing network density.","abstract_html":"Network time synchronization is an important aspect of sensor network operation. It is often achieved by synchronizing the clock of each node in the network to the clock of some reference node. However, it is well known that synchronization error accumulates over multiple hops. This scalability problem presents a challenge for large-scale, multi-hop sensor networks with a large number of nodes distributed over wide areas. In this thesis we develop the use of spatial averaging as an approach to mitigating the effects of the scalability problem. We first develop a cooperative synchronization technique using spatial averaging that can achieve &quot;perfect&quot; synchronization in the limit of an infinitely dense network. We show that it is possible to maintain a perfect timing signal with equispaced zero-crossings that occur at integer values of the reference time. Second, we study the benefits of cooperative time synchronization using spatial averaging in networks of finite density. We present a protocol that uses spatial averaging to reduce error accumulation in large-scale networks and show that synchronization performance can be significantly improved by increasing network density.","abstract_has_math":false,"creators":["Hu, An-swol"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2006,"date_issued":"2006-12-06T20:57:35Z","date_published":"2006-12-06T20:57:35Z","updated_at":"2026-11-19T03:18:04Z","subjects":["time synchronization","sensor networks","spatial averaging","wireless networks"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["6476233"],"render_values":[{"text":"6476233","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/3935","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/3935","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F3935","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Hu, An-swol"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2006-12-06T20:57:35Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2006-12-06T20:57:35Z"]},{"key":"dc:date.issued","label":"Date","values":["2006-12-06T20:57:35Z"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["time synchronization","sensor networks","spatial averaging","wireless networks"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["6476233"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/3935"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"d496360b-0b20-46a9-9d1f-fdb2c6510939\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>Time Synchronization in Large-scale Networks</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2006-12-06T20:57:35Z</PublicationDate> <Authors> <Author> <DisplayName>Hu, An-swol</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>time synchronization</Keyword> <Keyword>sensor networks</Keyword> <Keyword>spatial averaging</Keyword> <Keyword>wireless networks</Keyword> <Abstract>Network time synchronization is an important aspect of sensor network operation. It is often achieved by synchronizing the clock of each node in the network to the clock of some reference node. However, it is well known that synchronization error accumulates over multiple hops. This scalability problem presents a challenge for large-scale, multi-hop sensor networks with a large number of nodes distributed over wide areas. In this thesis we develop the use of spatial averaging as an approach to mitigating the effects of the scalability problem. We first develop a cooperative synchronization technique using spatial averaging that can achieve \"perfect\" synchronization in the limit of an infinitely dense network. We show that it is possible to maintain a perfect timing signal with equispaced zero-crossings that occur at integer values of the reference time. Second, we study the benefits of cooperative time synchronization using spatial averaging in networks of finite density. We present a protocol that uses spatial averaging to reduce error accumulation in large-scale networks and show that synchronization performance can be significantly improved by increasing network density.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Hu, An-swol"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description.abstract","label":"Abstract","values":["Network time synchronization is an important aspect of sensor network operation. It is often achieved by synchronizing the clock of each node in the network to the clock of some reference node. However, it is well known that synchronization error accumulates over multiple hops. This scalability problem presents a challenge for large-scale, multi-hop sensor networks with a large number of nodes distributed over wide areas. In this thesis we develop the use of spatial averaging as an approach to mitigating the effects of the scalability problem. We first develop a cooperative synchronization technique using spatial averaging that can achieve \"perfect\" synchronization in the limit of an infinitely dense network. We show that it is possible to maintain a perfect timing signal with equispaced zero-crossings that occur at integer values of the reference time. Second, we study the benefits of cooperative time synchronization using spatial averaging in networks of finite density. We present a protocol that uses spatial averaging to reduce error accumulation in large-scale networks and show that synchronization performance can be significantly improved by increasing network density."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.extent","label":"Dc Format Extent","values":["948335 bytes"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Time Synchronization in Large-scale Networks"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"d496360b-0b20-46a9-9d1f-fdb2c6510939\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>Time Synchronization in Large-scale Networks</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2006-12-06T20:57:35Z</PublicationDate> <Authors> <Author> <DisplayName>Hu, An-swol</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>time synchronization</Keyword> <Keyword>sensor networks</Keyword> <Keyword>spatial averaging</Keyword> <Keyword>wireless networks</Keyword> <Abstract>Network time synchronization is an important aspect of sensor network operation. It is often achieved by synchronizing the clock of each node in the network to the clock of some reference node. However, it is well known that synchronization error accumulates over multiple hops. This scalability problem presents a challenge for large-scale, multi-hop sensor networks with a large number of nodes distributed over wide areas. In this thesis we develop the use of spatial averaging as an approach to mitigating the effects of the scalability problem. We first develop a cooperative synchronization technique using spatial averaging that can achieve \"perfect\" synchronization in the limit of an infinitely dense network. We show that it is possible to maintain a perfect timing signal with equispaced zero-crossings that occur at integer values of the reference time. Second, we study the benefits of cooperative time synchronization using spatial averaging in networks of finite density. We present a protocol that uses spatial averaging to reduce error accumulation in large-scale networks and show that synchronization performance can be significantly improved by increasing network density.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Hu, An-swol"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:creator":["Hu, An-swol"],"dc:date.accessioned":["2006-12-06T20:57:35Z"],"dc:date.available":["2006-12-06T20:57:35Z"],"dc:date.issued":["2006-12-06T20:57:35Z"],"dc:description.abstract":["Network time synchronization is an important aspect of sensor network operation. It is often achieved by synchronizing the clock of each node in the network to the clock of some reference node. However, it is well known that synchronization error accumulates over multiple hops. This scalability problem presents a challenge for large-scale, multi-hop sensor networks with a large number of nodes distributed over wide areas. In this thesis we develop the use of spatial averaging as an approach to mitigating the effects of the scalability problem. We first develop a cooperative synchronization technique using spatial averaging that can achieve \"perfect\" synchronization in the limit of an infinitely dense network. We show that it is possible to maintain a perfect timing signal with equispaced zero-crossings that occur at integer values of the reference time. Second, we study the benefits of cooperative time synchronization using spatial averaging in networks of finite density. We present a protocol that uses spatial averaging to reduce error accumulation in large-scale networks and show that synchronization performance can be significantly improved by increasing network density."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.extent":["948335 bytes"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["6476233"],"dc:identifier.uri":["https://hdl.handle.net/1813/3935"],"dc:language.iso":["en_US"],"dc:subject":["time synchronization","sensor networks","spatial averaging","wireless networks"],"dc:title":["Time Synchronization in Large-scale Networks"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"]},"updated_at":"2026-11-19T03:18:04Z"}