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

ADHOCNOW

2004

Springer

2004

Springer

Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisﬁes some speciﬁed property. The most fundamental such property is that the network/graph be connected. For connectivity, prior work on topology control gave a polynomial time algorithm for minimizing the maximum power assigned to any node (such that the induced graph is connected). In this paper we study the problem of minimizing the number of maximum power nodes. After establishing that this minimization problem is NP-Complete, we focus on approximation algorithms for graphs with symmetric power thresholds. We ﬁrst show that the problem is reducible in an approximation preserving manner to the problem of assigning power values so that the sum of the powers is minimized. Using known results for that problem, this provides a family of approximation algorithms for the problem of minimizing the number of maximum power nodes with approximation ratios...

Related Content

Added |
30 Jun 2010 |

Updated |
30 Jun 2010 |

Type |
Conference |

Year |
2004 |

Where |
ADHOCNOW |

Authors |
Errol L. Lloyd, Rui Liu, S. S. Ravi |

Comments (0)