{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/119737"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/119737","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"The loudest one wins : efficient communication in theoretical wireless networks","abstract":"In order to develop the most efficient algorithms for wireless networks, first one must understand their theoretical limitations. To this end, we study the leader election and broadcast problems in wireless networks, modeling them using the Signal-to- Interference-plus-Noise-Ratio (SINR) model. Our main result is an algorithm that solves the leader election problem in two communication rounds using power control, with high probability. Previously, it was known that [Omega](log n) rounds were sufficient and necessary when using uniform power, where n is the number of nodes in the network. We explore tradeoffs between communication complexity and power used, and show that to elect a leader in t rounds, a power range exp (n (1 [Theta] T) is sufficient and necessary. In addition, we present an efficient algorithm for the broadcast problem. Using power control, it is possible to achieve a broadcast algorithm that terminates successfully in 2n rounds, w.h.p..","abstract_html":"In order to develop the most efficient algorithms for wireless networks, first one must understand their theoretical limitations. To this end, we study the leader election and broadcast problems in wireless networks, modeling them using the Signal-to- Interference-plus-Noise-Ratio (SINR) model. Our main result is an algorithm that solves the leader election problem in two communication rounds using power control, with high probability. Previously, it was known that [Omega](log n) rounds were sufficient and necessary when using uniform power, where n is the number of nodes in the network. We explore tradeoffs between communication complexity and power used, and show that to elect a leader in t rounds, a power range exp (n (1 [Theta] T) is sufficient and necessary. In addition, we present an efficient algorithm for the broadcast problem. Using power control, it is possible to achieve a broadcast algorithm that terminates successfully in 2n rounds, w.h.p..","abstract_has_math":false,"creators":["Markatou, Evangelia Anna"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Nancy Lynch."],"committee_chairs":[],"committee_members":[],"year":2018,"date_issued":"2018","date_published":"2018","updated_at":"2026-07-22T22:21:16Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/119737","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. Department of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Markatou, Evangelia Anna"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-12-18T19:47:53Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-12-18T19:47:53Z"]},{"key":"dc:date.issued","label":"Date","values":["2018"]},{"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":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written 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/119737"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Cataloged from student-submitted PDF version of thesis.","Includes bibliographical references (pages 68-70)."]},{"key":"dc:description.abstract","label":"Abstract","values":["In order to develop the most efficient algorithms for wireless networks, first one must understand their theoretical limitations. To this end, we study the leader election and broadcast problems in wireless networks, modeling them using the Signal-to- Interference-plus-Noise-Ratio (SINR) model. Our main result is an algorithm that solves the leader election problem in two communication rounds using power control, with high probability. Previously, it was known that [Omega](log n) rounds were sufficient and necessary when using uniform power, where n is the number of nodes in the network. We explore tradeoffs between communication complexity and power used, and show that to elect a leader in t rounds, a power range exp (n (1 [Theta] T) is sufficient and necessary. In addition, we present an efficient algorithm for the broadcast problem. Using power control, it is possible to achieve a broadcast algorithm that terminates successfully in 2n rounds, w.h.p.."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M. Eng."]},{"key":"dc:title","label":"Title","values":["The loudest one wins : efficient communication in theoretical wireless networks"]}]}],"canonical_facts":{"dc:contributor.advisor":["Nancy Lynch."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Markatou, Evangelia Anna"],"dc:date.accessioned":["2018-12-18T19:47:53Z"],"dc:date.available":["2018-12-18T19:47:53Z"],"dc:date.issued":["2018"],"dc:description":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Cataloged from student-submitted PDF version of thesis.","Includes bibliographical references (pages 68-70)."],"dc:description.abstract":["In order to develop the most efficient algorithms for wireless networks, first one must understand their theoretical limitations. To this end, we study the leader election and broadcast problems in wireless networks, modeling them using the Signal-to- Interference-plus-Noise-Ratio (SINR) model. Our main result is an algorithm that solves the leader election problem in two communication rounds using power control, with high probability. Previously, it was known that [Omega](log n) rounds were sufficient and necessary when using uniform power, where n is the number of nodes in the network. We explore tradeoffs between communication complexity and power used, and show that to elect a leader in t rounds, a power range exp (n (1 [Theta] T) is sufficient and necessary. In addition, we present an efficient algorithm for the broadcast problem. Using power control, it is possible to achieve a broadcast algorithm that terminates successfully in 2n rounds, w.h.p.."],"dc:description.degree":["M. Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/119737"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["The loudest one wins : efficient communication in theoretical wireless networks"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:16Z"}