Constructing minimum-energy broadcast trees in wireless ad hoc networks.
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider two fundamental problems related to power consumption in this kind of network. One is the minimum-energy broadcast tree problem, which broadcast a message from a source node to all the other nodes in the network such that the summation of transmission powers at all nodes is minimized; and another is the minimum-energy...[Show more]
|Collections||ANU Research Publications|
|Source:||Constructing minimum-energy broadcast trees in wireless ad hoc networks|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.