Maximizing Multicast Lifetime with Transmitter-Receiver Power Tradeoff is NP-Hard.
Guofeng DengSandeep K. S. GuptaGeorgios VarsamopoulosPublished in: IEEE Commun. Lett. (2008)
Keyphrases
- np hard
- channel state information
- computational complexity
- wireless networks
- wireless communication systems
- power consumption
- maximum lifetime
- optimal solution
- linear programming
- special case
- scheduling problem
- approximation algorithms
- np complete
- multicast routing
- communication systems
- power supply
- multiple input multiple output
- received signal
- energy dissipation
- power allocation
- data gathering
- overlay network
- routing algorithm
- energy consumption
- worst case
- application layer
- wireless ad hoc networks
- fading channels
- greedy heuristic
- np hardness
- content delivery
- genetic algorithm
- ad hoc networks
- signal to noise ratio
- life span
- lower bound
- remains np hard