Document Type
Thesis - University Access Only
Award Date
2009
Degree Name
Master of Science (MS)
Department / School
Electrical Engineering and Computer Science
Abstract
In the current state of technology, the focus on wireless networks is higher than ever before. It is considered standard that laptops and mobile phones have wireless functionality. It is necessary to keep the battery of these devices alive as long as possible. Some networks, for example wireless ad hoc networks where infrastructures do not exist, rely on ability of all devices to maintain functionality in order to keep the life of the entire network alive. For unicast communication, the shortest path will find an optimal solution which cannot be applied to broadcast or multicast communications. In order to maintain battery life, it is important to find the optimal tree structure that uses the least amount of total power to reach all nodes in the tree. In this thesis, we review algorithms found in the literature that don't necessarily find the optimal solution to the tree problem, but do find the answer in a shorter computing time. We then show how we find the optimal solution using integer programming, and use the results to find the commonalities in these optimal solutions. Our contribution in this work is a rigorous study of theoretical aspects of commonalities of optimal solutions which can be used to create a better heuristic.
Library of Congress Subject Headings
Power transmission
Ad hoc networks (Computer networks)
Wireless communication systems
Format
application/pdf
Number of Pages
73
Publisher
South Dakota State University
Recommended Citation
O'Brien, Austin, "Optimality of Minimum Power Broadcasting in Wireless Ad Hoc Networks" (2009). Electronic Theses and Dissertations. 1609.
https://openprairie.sdstate.edu/etd2/1609
