Finding Minimum-Power Broadcast Trees for Wireless Networks

Some algorithms have been devised for use in a method of constructing tree graphs that represent connections among the nodes of a wireless ommunication network. These algorithms provide for determining the viability of any given candidate connection tree and for generating an initial set of viable trees that can be used in any of a variety of search algorithms (e.g., a genetic algorithm) to find a tree that enables the network to broadcast from a source node to all other nodes while consuming the minimum amount of total power. The method yields solutions better than those of a prior algorithm known as the broadcast incremental power algorithm, albeit at a slightly greater computational cost.