Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

MOBIHOC

2002

ACM

2002

ACM

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 ...

Related Content

Added |
24 Dec 2009 |

Updated |
24 Dec 2009 |

Type |
Conference |

Year |
2002 |

Where |
MOBIHOC |

Authors |
Weifa Liang |

Comments (0)