Secrecy Rate Optimization for Secure Multicast Communications
Author(s): Cumanan, Kanapathippillai; Ding, Zhiguo; Xu, Mai; Poor, H Vincent
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1k06x14q
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cumanan, Kanapathippillai | - |
dc.contributor.author | Ding, Zhiguo | - |
dc.contributor.author | Xu, Mai | - |
dc.contributor.author | Poor, H Vincent | - |
dc.date.accessioned | 2024-02-18T03:35:40Z | - |
dc.date.available | 2024-02-18T03:35:40Z | - |
dc.date.issued | 2016-08-16 | en_US |
dc.identifier.citation | Cumanan, Kanapathippillai, Ding, Zhiguo, Xu, Mai, Poor, H Vincent. (2016). Secrecy Rate Optimization for Secure Multicast Communications. IEEE Journal of Selected Topics in Signal Processing, 10 (8), 1417 - 1432. doi:10.1109/jstsp.2016.2600518 | en_US |
dc.identifier.issn | 1932-4553 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1k06x14q | - |
dc.description.abstract | Recently, physical layer security has been recognized as a new design paradigm to provide security in wireless networks. In contrast to the existing conventional cryptographic methods, physical layer security exploits the dynamics of fading channels to enhance security of wireless communications. This paper studies optimization frameworks for a multicasting network in which a transmitter broadcasts the same information to a group of legitimate users in the presence of multiple eavesdroppers. In particular, power minimization and secrecy rate maximization problems are investigated for a multicasting secrecy network. First, the power minimization problem is solved for different numbers of legitimate users and eavesdroppers. Next, the secrecy rate maximization problem is investigated with the help of private jammers to improve the achievable secrecy rates through a game theoretic approach. These jammers charge the transmitter for their jamming services based on the amount of interference caused to the eavesdroppers. For a fixed interference price scenario, a closed-form solution for the optimal interference requirement to maximize the revenue of the transmitter is derived. This rate maximization problem for a nonfixed interference price scenario is formulated as a Stackelberg game in which the jammers and transmitter are the leaders and follower, respectively. For the proposed game, a Stackelberg equilibrium is derived to maximize the revenues of both the transmitter and the private jammers. To support the derived theoretical results, simulation results are provided with different numbers of legitimate users and eavesdroppers. In addition, these results show that physical layer security based jamming schemes could be incorporated in emerging and future wireless networks to enhance the quality of secure communications. | en_US |
dc.format.extent | 1417 - 1432 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | IEEE Journal of Selected Topics in Signal Processing | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | Secrecy Rate Optimization for Secure Multicast Communications | en_US |
dc.type | Journal Article | en_US |
dc.identifier.doi | doi:10.1109/jstsp.2016.2600518 | - |
dc.identifier.eissn | 1941-0484 | - |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Secrecy_rate_game_JSTSP_submitted_for_publication_23_07_16_IEEE.pdf | 1.02 MB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.