Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1405.3507

Secure Data Transmission in Cooperative Modes: Relay and MAC

Samah A. M. Ghanem, Munnujahan Ara

Published May 14, 2014• 0 citations
arXivHTMLPDF

Abstract

Cooperation in clouds provides a promising technique for 5G wireless networks, supporting higher data rates. Security of data transmission over wireless clouds could put constraints on devices; whether to cooperate or not. Therefore, our aim is to provide analytical framework for the security on the physical layer of such setup and to define the constraints embodied with cooperation in small size wireless clouds. In this paper, two legitimate transmitters Alice and John cooperate to increase the reliable transmission rate received by their common legitimate receiver Bob, where one eavesdropper, Eve exists. We provide the achievable secure data transmission rates with cooperative relaying and when no cooperation exists creating a Multiple Access Channel (MAC). The paper considers the analysis of different cooperative scenarios: a cooperative scenario with two relaying devices, a cooperative scenario without relaying, a non-cooperative scenario, and cooperation from one side. We derive analytical expressions for the optimal power allocation that maximizes the achievable secrecy rates for the different set of scenarios where the implication of cooperation on the achievable secrecy rates was analyzed. We propose a distributed algorithm that allows the devices to select whether to cooperate or not and to choose their optimal power allocation based on the cooperation framework selected. Moreover, we defined distance constraints to enforce the benefits of cooperation between devices in a wireless cloud.

DOI
10.48550/arxiv.1405.3507

Related papers

Secure communications with D2D cooperation

Samah A. M. Ghanem, Munnujahan Ara

Device to Device (D2D) communications provides a promising technique for 5G wireless networks, supporting higher data rates. Security of data transmission over wireless clouds could put constraints on devices; whether to cooperate or not. Therefore, our aim is to provide analytical framework for the security at the physical layer and to define the constraints embodied with cooperation in wireless clouds1. In this paper, two legitimate transmitters Alice and John cooperate to increase the reliable transmission rate received by their common legitimate receiver Bob, where one eavesdropper, Eve exists. We propose a distributed algorithm that allows the devices to select whether to cooperate or not and to adapt their optimal power allocation based on the cooperation framework selected. Moreover, we define distance constraints to enforce the benefits of cooperation between devices in a wireless cloud.

International Conference on Communications, Signal Processing, and their Applications (ICCSPA)•Feb 1, 2015•14 citations

Improving Wireless Physical Layer Security via Cooperating Relays

Lun Dong, Zhu Han, Athina P. Petropulu +1 more

Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel conditions: absent feedback, they are typically feasible only when the source-destination channel is better than the source-eavesdropper channel. Node cooperation is a means to overcome this challenge and improve the performance of secure wireless communications. This paper addresses secure communications of one source-destination pair with the help of multiple cooperating relays in the presence of one or more eavesdroppers. Three cooperative schemes are considered: decode-and-forward (DF), amplify-and-forward (AF), and cooperative jamming (CJ). For these schemes, the relays transmit a weighted version of a reencoded noise-free message signal (for DF), a received noisy source signal (for AF), or a common jamming signal (for CJ). Novel system designs are proposed, consisting of the determination of relay weights and the allocation of transmit power, that maximize the achievable secrecy rate subject to a transmit power constraint, or, minimize the transmit power subject to a secrecy rate constraint. For DF in the presence of one eavesdropper, closed-form optimal solutions are derived for the relay weights. For other problems, since the optimal relay weights are difficult to obtain, several criteria are considered leading to suboptimal but simple solutions, i.e., the complete nulling of the message signals at all eavesdroppers (for DF and AF), or the complete nulling of jamming signal at the destination (for CJ). Based on the designed relay weights, for DF in the presence of multiple eavesdroppers, and for CJ in the presence of one eavesdropper, the optimal power allocation is obtained in closed-form; in all other cases the optimal power allocation is obtained via iterative algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results show that the proposed design can significantly improve the performance of secure wireless communications.

IEEE Transactions on Signal Processing•Dec 11, 2009•1,355 citations

Destination Assisted Secret Transmission in Wireless Relay Networks

Shaobo Jia, Jiayan Zhang, Honglin Zhao +1 more

To improve physical (PHY) layer security of a wireless relay system in the presence of an eavesdropper, a two-phase cooperative relaying scheme is investigated in this paper. In phase I, the source transmits confidential message, simultaneously, it cooperates with the friendly jammers and destination to create jamming signal at the eavesdropper without affecting the forwarding relay which is preselected. In phase II, the forwarding relay retransmits the decoded signal, meanwhile, the particular relay cooperates with the friendly jammers to create jamming signal at the eavesdropper without affecting the destination. We focus on the investigation of optimal power allocation for maximizing achievable secrecy rate subject to a total power constraint. Optimal relay selection and suboptimal relay selection schemes are also proposed. It is shown that as the number of relays increases, both secrecy rate and the performance of suboptimal relay selection scheme improve significantly. Numerical results are presented to validate the derived analytical results and compare them to existing work.

IEEE Vehicular Technology Conference•Sep 1, 2016•2 citations

Adaptive Base Station Cooperation for Physical Layer Security in Two-Cell Wireless Networks

Lin Hu, Hong Wen, Bin Wu +2 more

We study physical layer security in two-cell wireless networks in which a base station (Alice) intends to send a confidential message to a legitimate user (Bob) with the help of a cooperative base station (Charlie), in the presence of an eavesdropper (Eve). Adaptive base station cooperation is explored to secure communication between Alice and Bob, and ensure the desired quality of service (QoS) at Charlie’s user. In particular, we consider two different scenarios where the channel state information of Eve is perfectly and statistically known, respectively. In either scenario, we provide a cooperative transmission scheme for secrecy rate maximization, subject to both security and QoS constraints. Unlike the conventional cooperative security with a fixed transmission scheme, we propose a mechanism for transmit strategy adaptation with security protection. Specifically, the cooperative transmission is replaced by a cooperative jamming scheme if either security or QoS constraint is not satisfied. Our design enables adaptive secure transmission, and thus is flexible and environment-adaptive. Moreover, numerical results confirm that our scheme is efficient in power resource utilization.

IEEE Access•Jan 1, 2016•28 citations

Destination Assisted Cooperative Jamming for Wireless Physical-Layer Security

Yupeng Liu, Jiangyuan Li, Athina P. Petropulu

A wireless network with one source, one destination, one eavesdropper, and multiple decode-and-forward relays is considered. A two-slot cooperative relaying scheme is proposed that targets at maximizing the secrecy rate. In the first slot, the source transmits the information bearing signal, and at the same time, it cooperates with the destination in jamming the eavesdropper without creating interference at the relay. In the second slot, one optimally selected relay retransmits the decoded source signal, and at the same time, that particular relay cooperates with the source to jam the eavesdropper without creating interference at the destination. Optimal relay selection and also optimal power allocation among the first/second slot data signal and jamming noise are proposed. It is shown that the secrecy rate of the proposed scheme scales with the total system powerP0and the number of available relaysKaccording to 1/2log2(1 +P0/8logK) - 1.6 bits/channel use . Although the proposed power allocation and relay selection assume global CSI available, the performance under imperfect relay CSI is also investigated. Also, the performance under distributed relay selection with limited feedback is demonstrated.

IEEE Transactions on Information Forensics and Security•Feb 25, 2013•195 citations

Secure Relaying in Non-Orthogonal Multiple Access: Trusted and Untrusted Scenarios

Ahmed M. Arafa, Wonjae Shin, Mojtaba Vaezi +1 more

A downlink single-input single-output non-orthogonal multiple access setting is considered, in which a base station (BS) is communicating with two legitimate users in two possible scenarios of unsecure environments: existence of an external eavesdropper and communicating through an untrusted relay. For the first scenario, a number of trusted cooperative half-duplex relays is employed to assist with the BS's transmission and secure its signals from the external eavesdropper. Various relaying schemes are proposed and analyzed for that matter: cooperative jamming, decode-and-forward, and amplify-and-forward. For each scheme, secure beamforming signals are devised at the relays to maximize the achievable secrecy rate regions. For the second scenario, with the untrusted relay, achievable secrecy rate regions are derived for two different relaying schemes, compress-and-forward and amplify-and-forward, under two different modes of operation. In the first mode, coined passive user mode, the users receive signals from both the BS and the untrusted relay and combine them to decode their messages. In the second mode, termed the active user mode, the users transmit a cooperative jamming signal simultaneously with the BS's transmission to further confuse the relay. Focusing on half-duplex nodes, the users cannot receive the BS's signal while jamming the relay, i.e., while being active, and rely only on the signals forwarded to them by the relay. It is shown that the best relaying scheme highly depends on the system parameters, in particular the distances between the nodes, and also on the part of the secrecy rate region at which the system is to operate.

arXiv:1808.07864•IEEE Transactions on Information Forensics and Security•May 21, 2019•65 citations
Cooperation in clouds provides a promising technique for 5G wireless networks, supporting higher data rates. Security of data transmission over wireless clouds could put constraints on devices; whether to cooperate or not. Therefore, our aim is to provide analytical framework for the security on the physical layer of such setup and to define the constraints embodied with cooperation in small size wireless clouds. In this paper, two legitimate transmitters Alice and John cooperate to increase the reliable transmission rate received by their common legitimate receiver Bob, where one eavesdropper, Eve exists. We provide the achievable secure data transmission rates with cooperative relaying and when no cooperation exists creating a Multiple Access Channel (MAC). The paper considers the analysis of different cooperative scenarios: a cooperative scenario with two relaying devices, a cooperative scenario without relaying, a non-cooperative scenario, and cooperation from one side. We derive analytical expressions for the optimal power allocation that maximizes the achievable secrecy rates for the different set of scenarios where the implication of cooperation on the achievable secrecy rates was analyzed. We propose a distributed algorithm that allows the devices to select whether to cooperate or not and to choose their optimal power allocation based on the cooperation framework selected. Moreover, we defined distance constraints to enforce the benefits of cooperation between devices in a wireless cloud.
Device to Device (D2D) communications provides a promising technique for 5G wireless networks, supporting higher data rates. Security of data transmission over wireless clouds could put constraints on devices; whether to cooperate or not. Therefore, our aim is to provide analytical framework for the security at the physical layer and to define the constraints embodied with cooperation in wireless clouds1. In this paper, two legitimate transmitters Alice and John cooperate to increase the reliable transmission rate received by their common legitimate receiver Bob, where one eavesdropper, Eve exists. We propose a distributed algorithm that allows the devices to select whether to cooperate or not and to adapt their optimal power allocation based on the cooperation framework selected. Moreover, we define distance constraints to enforce the benefits of cooperation between devices in a wireless cloud.
Physical (PHY) layer security approaches for wireless communications can prevent eavesdropping without upper layer data encryption. However, they are hampered by wireless channel conditions: absent feedback, they are typically feasible only when the source-destination channel is better than the source-eavesdropper channel. Node cooperation is a means to overcome this challenge and improve the performance of secure wireless communications. This paper addresses secure communications of one source-destination pair with the help of multiple cooperating relays in the presence of one or more eavesdroppers. Three cooperative schemes are considered: decode-and-forward (DF), amplify-and-forward (AF), and cooperative jamming (CJ). For these schemes, the relays transmit a weighted version of a reencoded noise-free message signal (for DF), a received noisy source signal (for AF), or a common jamming signal (for CJ). Novel system designs are proposed, consisting of the determination of relay weights and the allocation of transmit power, that maximize the achievable secrecy rate subject to a transmit power constraint, or, minimize the transmit power subject to a secrecy rate constraint. For DF in the presence of one eavesdropper, closed-form optimal solutions are derived for the relay weights. For other problems, since the optimal relay weights are difficult to obtain, several criteria are considered leading to suboptimal but simple solutions, i.e., the complete nulling of the message signals at all eavesdroppers (for DF and AF), or the complete nulling of jamming signal at the destination (for CJ). Based on the designed relay weights, for DF in the presence of multiple eavesdroppers, and for CJ in the presence of one eavesdropper, the optimal power allocation is obtained in closed-form; in all other cases the optimal power allocation is obtained via iterative algorithms. Numerical evaluation of the obtained secrecy rate and transmit power results show that the proposed design can significantly improve the performance of secure wireless communications.
To improve physical (PHY) layer security of a wireless relay system in the presence of an eavesdropper, a two-phase cooperative relaying scheme is investigated in this paper. In phase I, the source transmits confidential message, simultaneously, it cooperates with the friendly jammers and destination to create jamming signal at the eavesdropper without affecting the forwarding relay which is preselected. In phase II, the forwarding relay retransmits the decoded signal, meanwhile, the particular relay cooperates with the friendly jammers to create jamming signal at the eavesdropper without affecting the destination. We focus on the investigation of optimal power allocation for maximizing achievable secrecy rate subject to a total power constraint. Optimal relay selection and suboptimal relay selection schemes are also proposed. It is shown that as the number of relays increases, both secrecy rate and the performance of suboptimal relay selection scheme improve significantly. Numerical results are presented to validate the derived analytical results and compare them to existing work.
We study physical layer security in two-cell wireless networks in which a base station (Alice) intends to send a confidential message to a legitimate user (Bob) with the help of a cooperative base station (Charlie), in the presence of an eavesdropper (Eve). Adaptive base station cooperation is explored to secure communication between Alice and Bob, and ensure the desired quality of service (QoS) at Charlie’s user. In particular, we consider two different scenarios where the channel state information of Eve is perfectly and statistically known, respectively. In either scenario, we provide a cooperative transmission scheme for secrecy rate maximization, subject to both security and QoS constraints. Unlike the conventional cooperative security with a fixed transmission scheme, we propose a mechanism for transmit strategy adaptation with security protection. Specifically, the cooperative transmission is replaced by a cooperative jamming scheme if either security or QoS constraint is not satisfied. Our design enables adaptive secure transmission, and thus is flexible and environment-adaptive. Moreover, numerical results confirm that our scheme is efficient in power resource utilization.
A wireless network with one source, one destination, one eavesdropper, and multiple decode-and-forward relays is considered. A two-slot cooperative relaying scheme is proposed that targets at maximizing the secrecy rate. In the first slot, the source transmits the information bearing signal, and at the same time, it cooperates with the destination in jamming the eavesdropper without creating interference at the relay. In the second slot, one optimally selected relay retransmits the decoded source signal, and at the same time, that particular relay cooperates with the source to jam the eavesdropper without creating interference at the destination. Optimal relay selection and also optimal power allocation among the first/second slot data signal and jamming noise are proposed. It is shown that the secrecy rate of the proposed scheme scales with the total system powerP0and the number of available relaysKaccording to 1/2log2(1 +P0/8logK) - 1.6 bits/channel use . Although the proposed power allocation and relay selection assume global CSI available, the performance under imperfect relay CSI is also investigated. Also, the performance under distributed relay selection with limited feedback is demonstrated.
A downlink single-input single-output non-orthogonal multiple access setting is considered, in which a base station (BS) is communicating with two legitimate users in two possible scenarios of unsecure environments: existence of an external eavesdropper and communicating through an untrusted relay. For the first scenario, a number of trusted cooperative half-duplex relays is employed to assist with the BS's transmission and secure its signals from the external eavesdropper. Various relaying schemes are proposed and analyzed for that matter: cooperative jamming, decode-and-forward, and amplify-and-forward. For each scheme, secure beamforming signals are devised at the relays to maximize the achievable secrecy rate regions. For the second scenario, with the untrusted relay, achievable secrecy rate regions are derived for two different relaying schemes, compress-and-forward and amplify-and-forward, under two different modes of operation. In the first mode, coined passive user mode, the users receive signals from both the BS and the untrusted relay and combine them to decode their messages. In the second mode, termed the active user mode, the users transmit a cooperative jamming signal simultaneously with the BS's transmission to further confuse the relay. Focusing on half-duplex nodes, the users cannot receive the BS's signal while jamming the relay, i.e., while being active, and rely only on the signals forwarded to them by the relay. It is shown that the best relaying scheme highly depends on the system parameters, in particular the distances between the nodes, and also on the part of the secrecy rate region at which the system is to operate.