Master of Science (MS)
First Committee Member
Laxmi P. Gewali
Number of Pages
In a sensor network with nodes distributed randomly in a two dimensional plane, the problem of constructing a power aware broadcast tree from a given source node is a difficult problem when nodes have k different levels of power. In fact, it is known that the problem of constructing a broadcast tree that minimizes total power consumption is NP-hard; We investigate the development of a good approximation algorithm for generating power reduced broadcast trees for sensor networks. We are particularly interested in the diameter of the generated broadcast tree. Both theoretical investigation and simulated results are presented. We present two approximation algorithms (one based on a partitioning approach and the other based on a cluster following approach) for constructing broadcast tRees The experimental investigation shows that the proposed algorithms are very effective in generating power-reduced and hop-count-reduced broadcast tRees
Aware; Broadcast; Networks; Power; Sensor; Trees
University of Nevada, Las Vegas
If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to firstname.lastname@example.org and include clear identification of the work, preferably with URL.
Veeravalli, Sridhar, "Power aware broadcast trees for sensor networks" (2004). UNLV Retrospective Theses & Dissertations. 1658.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/