Onur Ozan Koyluoglu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Onur Ozan Koyluoglu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Hesham El Gamal
ECE Department The Ohio State University Columbus OH
4 shared publications C. Emre Koksal
1 shared publication- Harold Vincent Poor
Princeton University
1 shared publication Hesham El Gamal
1 shared publicationKarim Khalil
Wireless Intelligent Networks Center (WINC) Nile University Cairo Egypt
1 shared publication- Lifeng Lai
Department of Electrical Engineering Princeton University Princeton 08544 NJ USA
1 shared publication
Latest Publications
- Open Access
On Secrecy Capacity Scaling in Wireless Networks
This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities $\lambda$ and $\lambda_e$, respectively. It is shown that, as long as $\lambda_e/\lambda=o((\log n)^{-2})$, almost all of the nodes achieve a perfectly secure rate of $\Omega(\frac{1}{\sqrt{n}})$ for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multi-hop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Secondly, an ergodic fading model with $n$ source-destination pairs and $n_e$ eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy pre-coding, each user is shown to achieve a constant positive secret rate for sufficiently large $n$. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized.Open AccessOn Secrecy Capacity Scaling in Wireless Networks
This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities $\lambda$ and $\lambda_e$, respectively. It is shown that, as long as $\lambda_e/\lambda=o((\log n)^{-2})$, almost all of the nodes achieve a perfectly secure rate of $\Omega(\frac{1}{\sqrt{n}})$ for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multi-hop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Secondly, an ergodic fading model with $n$ source-destination pairs and $n_e$ eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy pre-coding, each user is shown to achieve a constant positive secret rate for sufficiently large $n$. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized. - Open Access
On the Secrecy Rate Region for the Interference Channel
This paper studies interference channels with security constraints. The existence of an external eavesdropper in a two-user interference channel is assumed, where the network users would like to secure their messages from the external eavesdropper. The cooperative binning and channel prefixing scheme is proposed for this system model which allows users to cooperatively add randomness to the channel in order to degrade the observations of the external eavesdropper. This scheme allows users to add randomness to the channel in two ways: 1) Users cooperate in their design of the binning codebooks, and 2) Users cooperatively exploit the channel prefixing technique. As an example, the channel prefixing technique is exploited in the Gaussian case to transmit a superposition signal consisting of binning codewords and independently generated noise samples. Gains obtained form the cooperative binning and channel prefixing scheme compared to the single user scenario reveals the positive effect of interference in increasing the network security. Remarkably, interference can be exploited to cooperatively add randomness into the network in order to enhance the security.
Open AccessOn the Secrecy Rate Region for the Interference Channel
This paper studies interference channels with security constraints. The existence of an external eavesdropper in a two-user interference channel is assumed, where the network users would like to secure their messages from the external eavesdropper. The cooperative binning and channel prefixing scheme is proposed for this system model which allows users to cooperatively add randomness to the channel in order to degrade the observations of the external eavesdropper. This scheme allows users to add randomness to the channel in two ways: 1) Users cooperate in their design of the binning codebooks, and 2) Users cooperatively exploit the channel prefixing technique. As an example, the channel prefixing technique is exploited in the Gaussian case to transmit a superposition signal consisting of binning codewords and independently generated noise samples. Gains obtained form the cooperative binning and channel prefixing scheme compared to the single user scenario reveals the positive effect of interference in increasing the network security. Remarkably, interference can be exploited to cooperatively add randomness into the network in order to enhance the security.
- Open Access
On the Delay Limited Secrecy Capacity of Fading Channels
In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main and eavesdropper channel gains. Here, upper and lower bounds on the secure delay limited capacity are derived and shown to be tight in the high signal-to-noise ratio (SNR) regime (for a wide class of channel distributions). In the second scenario, only the main channel CSI is assumed to be available at the transmitter. Remarkably, under this assumption, we establish the achievability of non-zero secure rate (for a wide class of channel distributions) under a strict delay constraint. In the two cases, our achievability arguments are based on a novel two-stage approach that overcomes the secrecy outage phenomenon observed in earlier works.
Open AccessOn the Delay Limited Secrecy Capacity of Fading Channels
In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main and eavesdropper channel gains. Here, upper and lower bounds on the secure delay limited capacity are derived and shown to be tight in the high signal-to-noise ratio (SNR) regime (for a wide class of channel distributions). In the second scenario, only the main channel CSI is assumed to be available at the transmitter. Remarkably, under this assumption, we establish the achievability of non-zero secure rate (for a wide class of channel distributions) under a strict delay constraint. In the two cases, our achievability arguments are based on a novel two-stage approach that overcomes the secrecy outage phenomenon observed in earlier works.
- Open Access
On the Secure Degrees of Freedom in the K-User Gaussian Interference Channel
This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using interference alignment along with secrecy pre-coding at each transmitter, it is shown that each user in the network can achieve non-zero secure Degrees of Freedoms (DoFs) in both scenarios. In particular, the proposed coding scheme achieves (K-2)/(2K-2) secure DoFs for each user in the interference channel with confidential messages model, and (K-2)/2K secure DoFs in the case of an external eavesdropper. The fundamental difference between the two scenarios stems from the lack of channel state information (CSI) about the external eavesdropper. Remarkably, the results establish the positive impact of interference on the secrecy capacity of wireless networks.
Open AccessOn the Secure Degrees of Freedom in the K-User Gaussian Interference Channel
This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using interference alignment along with secrecy pre-coding at each transmitter, it is shown that each user in the network can achieve non-zero secure Degrees of Freedoms (DoFs) in both scenarios. In particular, the proposed coding scheme achieves (K-2)/(2K-2) secure DoFs for each user in the interference channel with confidential messages model, and (K-2)/2K secure DoFs in the case of an external eavesdropper. The fundamental difference between the two scenarios stems from the lack of channel state information (CSI) about the external eavesdropper. Remarkably, the results establish the positive impact of interference on the secrecy capacity of wireless networks.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2161-2165
On the Utility of Frequency Reuse in Cognitive Radio Channels
We consider the generalized cognitive radio channel where the secondary user is allowed to reuse the frequency during the active periods of the primary user, as long as the primary rate remains the same. In this setting, the optimal power allocation policy with a single antenna secondary transmitter (and receiver) is explored. Interestingly, we show that the offered gain resulting from the frequency reuse during the active periods of the spectrum disappears in both the low and high signal-to- noise ratio (SNR) regimes. This drawback, however, is shown to disappear with multi-antenna nodes by using simple zero-forcing strategies at both ends of the secondary channel.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2161-2165
On the Utility of Frequency Reuse in Cognitive Radio Channels
We consider the generalized cognitive radio channel where the secondary user is allowed to reuse the frequency during the active periods of the primary user, as long as the primary rate remains the same. In this setting, the optimal power allocation policy with a single antenna secondary transmitter (and receiver) is explored. Interestingly, we show that the offered gain resulting from the frequency reuse during the active periods of the spectrum disappears in both the low and high signal-to- noise ratio (SNR) regimes. This drawback, however, is shown to disappear with multi-antenna nodes by using simple zero-forcing strategies at both ends of the secondary channel.