Distributed construction of energy-efficient ad hoc wireless broadcast trees
Name
51111868-MIT.pdf
Description
Full printable version
Size
3.21 MB
Format
Adobe PDF
Checksum (MD5)
b569b46023c3687d4e226992ecc4f1e1
Author(s)
Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979-
Advisor(s)
Eytan Modiano and Li Shu.
Date Issued
2002
Publisher
Massachusetts Institute of Technology
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.
Description
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.
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
