Distributed construction of energy-efficient ad hoc wireless broadcast trees

Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.

Bibliographic Details
Main Author: Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979-
Other Authors: Eytan Modiano and Li Shu.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2005
Subjects:
Online Access:http://hdl.handle.net/1721.1/16828
_version_ 1811089266076286976
author Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979-
author2 Eytan Modiano and Li Shu.
author_facet Eytan Modiano and Li Shu.
Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979-
author_sort Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979-
collection MIT
description Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
first_indexed 2024-09-23T14:16:10Z
format Thesis
id mit-1721.1/16828
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T14:16:10Z
publishDate 2005
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/168282019-04-10T17:53:51Z Distributed construction of energy-efficient ad hoc wireless broadcast trees Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979- Eytan Modiano and Li Shu. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. 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. 2005-05-19T14:46:35Z 2005-05-19T14:46:35Z 2002 2002 Thesis http://hdl.handle.net/1721.1/16828 51111868 eng 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 72 p. 4610528 bytes 4610283 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology
spellingShingle Electrical Engineering and Computer Science.
Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979-
Distributed construction of energy-efficient ad hoc wireless broadcast trees
title Distributed construction of energy-efficient ad hoc wireless broadcast trees
title_full Distributed construction of energy-efficient ad hoc wireless broadcast trees
title_fullStr Distributed construction of energy-efficient ad hoc wireless broadcast trees
title_full_unstemmed Distributed construction of energy-efficient ad hoc wireless broadcast trees
title_short Distributed construction of energy-efficient ad hoc wireless broadcast trees
title_sort distributed construction of energy efficient ad hoc wireless broadcast trees
topic Electrical Engineering and Computer Science.
url http://hdl.handle.net/1721.1/16828
work_keys_str_mv AT ahluwaliaashwindersashwindersingh1979 distributedconstructionofenergyefficientadhocwirelessbroadcasttrees