2026-09-20T02:36:13Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1197372026-06-06T00:49:28Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Nancy Lynch.
Markatou, Evangelia Anna
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2018-12-18T19:47:53Z
2018-12-18T19:47:53Z
2018
2018
http://hdl.handle.net/1721.1/119737
1078689082
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).
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..
by Evangelia Anna Markatou.
M.Eng.
70 pages
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
The loudest one wins : efficient communication in theoretical wireless networks
Efficient communication in theoretical wireless networks
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="488263c3-b41e-4888-a884-4a761b75fb60">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>The loudest one wins : efficient communication in theoretical wireless networks</Title>
<Subtitle>Efficient communication in theoretical wireless networks</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2018</PublicationDate>
<Authors>
<Author>
<DisplayName>Markatou, Evangelia Anna</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>