Abstract
Minimizing total energy to keep an ad hoc wireless network symmetrically connected is an NP-hard problem. Recently, several greedy approximations have been proposed, based on k-restricted decompositions of the network. Their performance ratios are established through estimations of the least upper bound ρk for the ratio between total powers of best possible k-restricted decomposition and the optimal solution. In this paper, we determine the exact value of ρk for all k.
| Original language | English |
|---|---|
| Pages (from-to) | 399-408 |
| Number of pages | 10 |
| Journal | Theoretical Computer Science |
| Volume | 326 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - 20 Oct 2004 |
| Externally published | Yes |
Keywords
- Ad hoc wireless network
- Approximation algorithms
- Min power symmetric connectivity
Fingerprint
Dive into the research topics of 'Performance evaluation for energy efficient topologic control in ad hoc wireless networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver