A knapsack problem formulation for relay selection in secure cooperative wireless communication.
Shuangyu LuoHana GodrichAthina P. PetropuluH. Vincent PoorPublished in: ICASSP (2011)
Keyphrases
- relay selection
- knapsack problem
- fading channels
- wireless communication
- wireless networks
- linear programming relaxation
- wireless channels
- optimal solution
- optimization problems
- computer simulation
- communication networks
- dynamic programming
- wireless sensor networks
- np hard
- wifi
- cooperative
- greedy algorithm
- bit error rate
- multipath
- lower bound