{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/55120"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/55120","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Distributed computation on unreliable radio channels","abstract":"An important topic in wireless networking is the development of reliable algorithms for environments suffering from adversarial interference. This term captures any type of channel disruption outside the control of the algorithm designer-from contention with unrelated devices to malicious jamming. In this thesis, we provide four contributions toward a comprehensive theoretical treatment of this topic. First, we detail a formal modeling framework. This framework is general enough to describe almost any radio network studied to date in the theory literature. It can also precisely capture the often subtle details of adversarial behavior. In addition, we prove a pair of composition results that allow a layered strategy for designing radio network algorithms The results can be used to combine an algorithm designed for a powerful channel with an implementation of this channel on a less powerful channel. Next, we formalize adversarial interference with the definition of the t-disrupted channel. We then define the more powerful (t, b, p)-feedback channel, and provide both a randomized and deterministic implementation of the latter using the former. To emphasize the utility of this layered approach, we provide solutions to the set agreement, gossip, and reliable broadcast problems using the powerful feedback channel. Combined with the implementation algorithms and composition results, this automatically generates solutions to these problems for the less powerful, but more realistic, t-disrupted channel. Finally, we define a variant of the modeling framework that captures the attributes of an ad hoc network, including asynchronous starts and the lack of advance knowledge of participating devices.","abstract_html":"An important topic in wireless networking is the development of reliable algorithms for environments suffering from adversarial interference. This term captures any type of channel disruption outside the control of the algorithm designer-from contention with unrelated devices to malicious jamming. In this thesis, we provide four contributions toward a comprehensive theoretical treatment of this topic. First, we detail a formal modeling framework. This framework is general enough to describe almost any radio network studied to date in the theory literature. It can also precisely capture the often subtle details of adversarial behavior. In addition, we prove a pair of composition results that allow a layered strategy for designing radio network algorithms The results can be used to combine an algorithm designed for a powerful channel with an implementation of this channel on a less powerful channel. Next, we formalize adversarial interference with the definition of the t-disrupted channel. We then define the more powerful (t, b, p)-feedback channel, and provide both a randomized and deterministic implementation of the latter using the former. To emphasize the utility of this layered approach, we provide solutions to the set agreement, gossip, and reliable broadcast problems using the powerful feedback channel. Combined with the implementation algorithms and composition results, this automatically generates solutions to these problems for the less powerful, but more realistic, t-disrupted channel. Finally, we define a variant of the modeling framework that captures the attributes of an ad hoc network, including asynchronous starts and the lack of advance knowledge of participating devices.","abstract_has_math":false,"creators":["Newport, Calvin (Calvin Charles)"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Nancy Lynch."],"committee_chairs":[],"committee_members":[],"year":2009,"date_issued":"2009","date_published":"2009","updated_at":"2026-07-22T22:22:24Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/55120","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Nancy Lynch."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Newport, Calvin (Calvin Charles)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2010-05-25T20:50:17Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2010-05-25T20:50:17Z"]},{"key":"dc:date.issued","label":"Date","values":["2009"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/55120"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 169-175)."]},{"key":"dc:description.abstract","label":"Abstract","values":["An important topic in wireless networking is the development of reliable algorithms for environments suffering from adversarial interference. This term captures any type of channel disruption outside the control of the algorithm designer-from contention with unrelated devices to malicious jamming. In this thesis, we provide four contributions toward a comprehensive theoretical treatment of this topic. First, we detail a formal modeling framework. This framework is general enough to describe almost any radio network studied to date in the theory literature. It can also precisely capture the often subtle details of adversarial behavior. In addition, we prove a pair of composition results that allow a layered strategy for designing radio network algorithms The results can be used to combine an algorithm designed for a powerful channel with an implementation of this channel on a less powerful channel. Next, we formalize adversarial interference with the definition of the t-disrupted channel. We then define the more powerful (t, b, p)-feedback channel, and provide both a randomized and deterministic implementation of the latter using the former. To emphasize the utility of this layered approach, we provide solutions to the set agreement, gossip, and reliable broadcast problems using the powerful feedback channel. Combined with the implementation algorithms and composition results, this automatically generates solutions to these problems for the less powerful, but more realistic, t-disrupted channel. Finally, we define a variant of the modeling framework that captures the attributes of an ad hoc network, including asynchronous starts and the lack of advance knowledge of participating devices.","(cont.) Within this new framework, we solve the wireless synchronization problem on a t-disrupted channel. This problem requires devices to agree on a common round numbering scheme. We conclude by discussing how to use such a solution to adapt algorithms designed for the original model to work in the ad hoc variant."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:title","label":"Title","values":["Distributed computation on unreliable radio channels"]}]}],"canonical_facts":{"dc:contributor.advisor":["Nancy Lynch."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Newport, Calvin (Calvin Charles)"],"dc:date.accessioned":["2010-05-25T20:50:17Z"],"dc:date.available":["2010-05-25T20:50:17Z"],"dc:date.issued":["2009"],"dc:description":["Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 169-175)."],"dc:description.abstract":["An important topic in wireless networking is the development of reliable algorithms for environments suffering from adversarial interference. This term captures any type of channel disruption outside the control of the algorithm designer-from contention with unrelated devices to malicious jamming. In this thesis, we provide four contributions toward a comprehensive theoretical treatment of this topic. First, we detail a formal modeling framework. This framework is general enough to describe almost any radio network studied to date in the theory literature. It can also precisely capture the often subtle details of adversarial behavior. In addition, we prove a pair of composition results that allow a layered strategy for designing radio network algorithms The results can be used to combine an algorithm designed for a powerful channel with an implementation of this channel on a less powerful channel. Next, we formalize adversarial interference with the definition of the t-disrupted channel. We then define the more powerful (t, b, p)-feedback channel, and provide both a randomized and deterministic implementation of the latter using the former. To emphasize the utility of this layered approach, we provide solutions to the set agreement, gossip, and reliable broadcast problems using the powerful feedback channel. Combined with the implementation algorithms and composition results, this automatically generates solutions to these problems for the less powerful, but more realistic, t-disrupted channel. Finally, we define a variant of the modeling framework that captures the attributes of an ad hoc network, including asynchronous starts and the lack of advance knowledge of participating devices.","(cont.) Within this new framework, we solve the wireless synchronization problem on a t-disrupted channel. This problem requires devices to agree on a common round numbering scheme. We conclude by discussing how to use such a solution to adapt algorithms designed for the original model to work in the ad hoc variant."],"dc:description.degree":["Ph.D."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/55120"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Distributed computation on unreliable radio channels"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:24Z"}