Sciweavers

Share
ICASSP
2011
IEEE

A knapsack problem formulation for relay selection in secure cooperative wireless communication

10 years 5 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy rate, while increasing the communication and synchronization needs associated with cooperative beamforming. For low density networks (small number of relays) the secrecy rate changes rapidly with an increase in the number of relays, while for higher density networks increasing the number of relays has significantly smaller effect on the secrecy rate. This research considers a resource-aware approach: instead of using all available relays, choose the smallest set of active relays that meet a predetermined performance goal. The problem is formulated as a knapsack problem that may be solved through an exhaustive search. As this search method has exponential complexity, three heuristic algorithms are proposed, offering significant complexity reduction. The first one relies on the individual relay secrecy rate ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H
Added 21 Aug 2011
Updated 21 Aug 2011
Type Journal
Year 2011
Where ICASSP
Authors Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H. Vincent Poor
Comments (0)
books