Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/2451
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGurrala, K K-
dc.contributor.authorDas, S-
dc.date.accessioned2016-02-22T11:04:43Z-
dc.date.available2016-02-22T11:04:43Z-
dc.date.issued2015-11-
dc.identifier.citation12th Malaysia International Conference on Communications (MICC-2015), Kuching, Sarawak, Malaysia, 23-25 Nov 2015en_US
dc.identifier.urihttp://hdl.handle.net/2080/2451-
dc.descriptionCopyright belongs to proceeding publisheren_US
dc.description.abstractIn this paper, we propose efficient power allocation techniques using both convex optimization (using Lagrange multiplier method) and a soft evolutionary approach (using Differential Evolution (DE) algorithm) to optimize both the relay and jammer powers in addition to an increase in the system performance in terms of secrecy rate. Here, we consider a cooperative wireless network with control jamming comprising of a source-destination pair with a set of relay nodes in the presence of single and multiple eavesdroppers. Optimal relay node is selected based on the SNR received at each relay, which transmits the data to the destination using decode and forward strategy. Amongst the remaining nodes, selection of jammer is done based on the SNR value of the relay to eavesdropper link. The proposed power allocation schemes are compared with equal power allocation policy for using the Monte-Carlo simulation study and these schemes are found to be superior in terms of average secrecy rate.en_US
dc.publisherIEEEen_US
dc.subjectPhysical layer securityen_US
dc.subjectCooperative jammingen_US
dc.subjectPower allocationen_US
dc.subjectDE algorithmen_US
dc.titleMaximized Secrecy Rate Based Power Allocation for Wireless Cooperative Network with Control Jammingen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2015-MICC_KKGurrala_Maximized.pdf374.84 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.