The loudest one wins : efficient communication in theoretical wireless networks
Name
1078689082-MIT.pdf
Description
Full printable version
Size
606.66 KB
Format
Adobe PDF
Checksum (MD5)
598020fd131437dc6a63d5876406c68d
Author(s)
Markatou, Evangelia Anna
Advisor(s)
Nancy Lynch.
Alternative Title
Efficient communication in theoretical wireless networks
Date Issued
2018
Publisher
Massachusetts Institute of Technology
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..
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).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
