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 broadcasts 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 multicast tree problem, which multicasts a message from a source node to the nodes in a given subset of nodes such that the summation of the transmission powers at all involved nodes is minimized. We first show the minimum-energy broadcast tree problem is NP-complete. We then present an approximate algorithm for the problem in a general setting, which delivers an approximate solution with a bounded performance guarantee. The algorithm takes O((k + 1)1/ n3/ ) time, where n is the number of nodes ...

• Type: Conference
• Year: 2002
• Where: MOBIHOC
• Authors: Weifa Liang
• Keywords: Broadcast Tree Problem, MOBIHOC 2002, Multicast Tree Problem, Multihop Wireless Network, Wireless Networks