{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/26050"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/26050","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Opportunistic clock synchronization for ad hoc networks","abstract":"An ad hoc network is a collection of computing nodes communicating over wireless channels without relying on any fi xed infrastructure such as servers and towers. Such networks are useful in rescue operations, and in rural and military settings. Clock synchronization is an essential building block for many ad hoc wireless network applications. It provides the participating computing nodes with logical clocks whose di erences can be bounded. Several traditional distributed clock synchronization algorithms use strict communication structures such as spanning trees. In such protocols, a node corrects its logical clock when it receives a new time-stamped message from its parent. In this thesis, we present a new clock synchronization protocol that exploits the broadcast medium in wireless networks, allowing nodes to opportunistically correct their logical clocks in order to converge to a reference time provided by a designated root node. Our protocol does not rely on a communication structure and is lightweight due to its low overhead. We also propose a variation of our opportunistic protocol, which further reduces overhead through randomized broadcast techniques. Our simulation-based experimental evaluation of the protocols illustrates that our opportunistic algorithms improve the accuracy of the nodes' logical clocks, when compared to a tree-based protocol. However, we show that the level of improvement is a function of the density of the wireless network. Additionally, the results show that our algorithms can produce around half the overhead, compared to an existing protocol that achieves higher levels of precision.","abstract_html":"An ad hoc network is a collection of computing nodes communicating over wireless channels without relying on any fi xed infrastructure such as servers and towers. Such networks are useful in rescue operations, and in rural and military settings. Clock synchronization is an essential building block for many ad hoc wireless network applications. It provides the participating computing nodes with logical clocks whose di erences can be bounded. Several traditional distributed clock synchronization algorithms use strict communication structures such as spanning trees. In such protocols, a node corrects its logical clock when it receives a new time-stamped message from its parent. In this thesis, we present a new clock synchronization protocol that exploits the broadcast medium in wireless networks, allowing nodes to opportunistically correct their logical clocks in order to converge to a reference time provided by a designated root node. Our protocol does not rely on a communication structure and is lightweight due to its low overhead. We also propose a variation of our opportunistic protocol, which further reduces overhead through randomized broadcast techniques. Our simulation-based experimental evaluation of the protocols illustrates that our opportunistic algorithms improve the accuracy of the nodes' logical clocks, when compared to a tree-based protocol. However, we show that the level of improvement is a function of the density of the wireless network. Additionally, the results show that our algorithms can produce around half the overhead, compared to an existing protocol that achieves higher levels of precision.","abstract_has_math":false,"creators":["Carrasco, Maria B."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Mitra, Sayan"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-08-25T22:10:51Z","date_published":"2011-08-25T22:10:51Z","updated_at":"2026-07-22T22:25:26Z","subjects":["clock synchronization","Ad hoc","opportunistic","broadcasts","window of opportunity","randomized"],"languages":["en"],"rights":["Copyright 2011 Maria B. Carrasco"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/26050","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Mitra, Sayan"]},{"key":"dc:creator","label":"Author","values":["Carrasco, Maria B."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-08-25T22:10:51Z","2011-08"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["clock synchronization","Ad hoc","opportunistic","broadcasts","window of opportunity","randomized"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2011 Maria B. Carrasco"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/26050"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["An ad hoc network is a collection of computing nodes communicating over wireless channels without relying on any fi xed infrastructure such as servers and towers. Such networks are useful in rescue operations, and in rural and military settings. Clock synchronization is an essential building block for many ad hoc wireless network applications. It provides the participating computing nodes with logical clocks whose di erences can be bounded. Several traditional distributed clock synchronization algorithms use strict communication structures such as spanning trees. In such protocols, a node corrects its logical clock when it receives a new time-stamped message from its parent. In this thesis, we present a new clock synchronization protocol that exploits the broadcast medium in wireless networks, allowing nodes to opportunistically correct their logical clocks in order to converge to a reference time provided by a designated root node. Our protocol does not rely on a communication structure and is lightweight due to its low overhead. We also propose a variation of our opportunistic protocol, which further reduces overhead through randomized broadcast techniques. Our simulation-based experimental evaluation of the protocols illustrates that our opportunistic algorithms improve the accuracy of the nodes' logical clocks, when compared to a tree-based protocol. However, we show that the level of improvement is a function of the density of the wireless network. Additionally, the results show that our algorithms can produce around half the overhead, compared to an existing protocol that achieves higher levels of precision.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-07-09T17:20:58Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 ecethesis.tex: 90427 bytes, checksum: 97838b751ecdadf684d41b996a1ab52e (MD5) Carrasco_Maria.pdf: 11432025 bytes, checksum: 591e5d8bf3754c49672a52eb19786752 (MD5)","Made available in DSpace on 2011-08-25T22:10:51Z (GMT). No. of bitstreams: 3 Carrasco_Maria.pdf: 11432025 bytes, checksum: 591e5d8bf3754c49672a52eb19786752 (MD5) license.txt: 4064 bytes, checksum: 41b15a8e433f04684c85786720770356 (MD5) ecethesis.tex: 90427 bytes, checksum: 97838b751ecdadf684d41b996a1ab52e (MD5)"]},{"key":"dc:title","label":"Title","values":["Opportunistic clock synchronization for ad hoc networks"]}]}],"canonical_facts":{"dc:contributor":["Mitra, Sayan"],"dc:creator":["Carrasco, Maria B."],"dc:date":["2011-08-25T22:10:51Z","2011-08"],"dc:description":["An ad hoc network is a collection of computing nodes communicating over wireless channels without relying on any fi xed infrastructure such as servers and towers. Such networks are useful in rescue operations, and in rural and military settings. Clock synchronization is an essential building block for many ad hoc wireless network applications. It provides the participating computing nodes with logical clocks whose di erences can be bounded. Several traditional distributed clock synchronization algorithms use strict communication structures such as spanning trees. In such protocols, a node corrects its logical clock when it receives a new time-stamped message from its parent. In this thesis, we present a new clock synchronization protocol that exploits the broadcast medium in wireless networks, allowing nodes to opportunistically correct their logical clocks in order to converge to a reference time provided by a designated root node. Our protocol does not rely on a communication structure and is lightweight due to its low overhead. We also propose a variation of our opportunistic protocol, which further reduces overhead through randomized broadcast techniques. Our simulation-based experimental evaluation of the protocols illustrates that our opportunistic algorithms improve the accuracy of the nodes' logical clocks, when compared to a tree-based protocol. However, we show that the level of improvement is a function of the density of the wireless network. Additionally, the results show that our algorithms can produce around half the overhead, compared to an existing protocol that achieves higher levels of precision.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-07-09T17:20:58Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 ecethesis.tex: 90427 bytes, checksum: 97838b751ecdadf684d41b996a1ab52e (MD5) Carrasco_Maria.pdf: 11432025 bytes, checksum: 591e5d8bf3754c49672a52eb19786752 (MD5)","Made available in DSpace on 2011-08-25T22:10:51Z (GMT). No. of bitstreams: 3 Carrasco_Maria.pdf: 11432025 bytes, checksum: 591e5d8bf3754c49672a52eb19786752 (MD5) license.txt: 4064 bytes, checksum: 41b15a8e433f04684c85786720770356 (MD5) ecethesis.tex: 90427 bytes, checksum: 97838b751ecdadf684d41b996a1ab52e (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/26050"],"dc:language":["en"],"dc:rights":["Copyright 2011 Maria B. Carrasco"],"dc:subject":["clock synchronization","Ad hoc","opportunistic","broadcasts","window of opportunity","randomized"],"dc:title":["Opportunistic clock synchronization for ad hoc networks"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:26Z"}