2026-09-18T20:52:36Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/168282022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Eytan Modiano and Li Shu.
Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-05-19T14:46:35Z
2005-05-19T14:46:35Z
2002
2002
http://hdl.handle.net/1721.1/16828
51111868
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
Includes bibliographical references (p. 71-72).
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
We address the energy-efficient broadcasting problem in ad hoc wireless networks. First we show that finding the minimum energy broadcast tree is NP-complete and develop an approximation algorithm, which computes sub-optimal solutions in polynomial time. We present a distributed algorithm that computes all N possible broadcast trees simultaneously with O(N2) message complexity. We compare our algorithm's performance to the best known centralized algorithm, and show that it constructs trees consuming, on average, only 18% more energy. Finally, we introduce the multiple source broadcasting problem, and explore algorithms that address this problem.
by Ashwinder S. Ahluwalia.
M.Eng.
72 p.
4610528 bytes
4610283 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Distributed construction of energy-efficient ad hoc wireless broadcast trees
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="b23cf803-584a-467d-a66d-c20f26ee9f02">
<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>Distributed construction of energy-efficient ad hoc wireless broadcast trees</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2002</PublicationDate>
<Authors>
<Author>
<DisplayName>Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979-</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>We address the energy-efficient broadcasting problem in ad hoc wireless networks. First we show that finding the minimum energy broadcast tree is NP-complete and develop an approximation algorithm, which computes sub-optimal solutions in polynomial time. We present a distributed algorithm that computes all N possible broadcast trees simultaneously with O(N2) message complexity. We compare our algorithm's performance to the best known centralized algorithm, and show that it constructs trees consuming, on average, only 18% more energy. Finally, we introduce the multiple source broadcasting problem, and explore algorithms that address this problem.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>