{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/16828"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/16828","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Distributed construction of energy-efficient ad hoc wireless broadcast trees","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_html":"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_has_math":false,"creators":["Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979-"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Eytan Modiano and Li Shu."],"committee_chairs":[],"committee_members":[],"year":2002,"date_issued":"2002","date_published":"2002","updated_at":"2026-07-22T22:22:00Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["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."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/16828","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Eytan Modiano and Li Shu."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979-"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-05-19T14:46:35Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-05-19T14:46:35Z"]},{"key":"dc:date.issued","label":"Date","values":["2002"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["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."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/16828"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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."]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Distributed construction of energy-efficient ad hoc wireless broadcast trees"]}]}],"canonical_facts":{"dc:contributor.advisor":["Eytan Modiano and Li Shu."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Ahluwalia, Ashwinder S. (Ashwinder Singh), 1979-"],"dc:date.accessioned":["2005-05-19T14:46:35Z"],"dc:date.available":["2005-05-19T14:46:35Z"],"dc:date.issued":["2002"],"dc: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."],"dc:description.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."],"dc:description.degree":["M.Eng."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/16828"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["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."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Distributed construction of energy-efficient ad hoc wireless broadcast trees"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:00Z"}