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

STACS

2001

Springer

2001

Springer

We consider the problem of computing an optimal range assignment in a wireless network which allows a speciﬁed source station to perform a broadcast operation. In particular, we consider this problem as a special case of the following more general combinatorial optimization problem, called Minimum Energy Consumption Broadcast Subgraph (in short, MECBS): Given a weighted directed graph and a speciﬁed source node, ﬁnd a minimum cost range assignment to the nodes, whose corresponding transmission graph contains a spanning tree rooted at the source node. We ﬁrst prove that MECBS is not approximable within a sub-logarithmic factor (unless P=NP). We then consider the restriction of MECBS to wireless networks and we prove several positive and negative results, depending on the geometric space dimension and on the distance-power gradient. The main result is a polynomial-time approximation algorithm for the NP-hard case in which both the dimension and the gradient are equal to 2: This a...

Related Content

Added |
30 Jul 2010 |

Updated |
30 Jul 2010 |

Type |
Conference |

Year |
2001 |

Where |
STACS |

Authors |
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca |

Comments (0)