arXiv subjects

Phee Lep Yeoh

Publications and source records attributed to Phee Lep Yeoh.

32 records · Page 2Linked to original sources

arXiv2020

Joint Information Theoretic Secrecy and Covert Communication in the Presence of an Untrusted User and Warden

In this paper, we investigate joint information theoretic secrecy and covert communication in a single-input multi-output (SIMO) system where a transmitter (Alice) is communicating with two legitimate users (Bob and Carol). We consider that an untrusted user and a warden node are also present in the network attempting to attack the secure and covert communications to Bob and Carol, respectively. Specifically, Bob requires secure communications such that his messages from Alice are not decoded by the untrusted user, while Carol requires covert communications such that her messages from Alice are not detected by the warden. To do so, we consider that Alice transmits Carol's messages during selected time slots to hide them from the warden while also transmitting Bob's messages in each time slot contentiously. We formulate an optimization problem with the aim of maximizing the average rate subject to a covert communication requirement and a secure communications constraint. Since the proposed optimization problem is non-convex, we utilize successive convex approximation to obtain a tractable solution. We consider practical assumptions that Alice has imperfect knowledge of the warden's location and imperfect channel state information (CSI) of Bob and Carol. Our numerical examples highlight that the imperfect CSI at Carol has a more detrimental impact on the average rate compared to imperfect CSI at Bob.

eess.SP↗

arXiv2020

Secure mm-Wave Communications with Imperfect Hardware and Uncertain Eavesdropper Location

This paper examines the secrecy performance of millimeter-wave (mm-Wave) communications with imperfect hardware and uncertain eavesdropper location. We consider a multiple-antenna source communicating with a single-antenna destination using masked beamforming to transmit the information signals with artificial noise (AN) in the presence of a passive eavesdropper (Eve). For this system, we derive new expressions for the secrecy outage probability (SOP) and secrecy throughput with mm-Wave multipath propagation under slow-fading channel conditions and hardware imperfections. Based on this, optimal power allocation (OPA) solutions are derived for the information and AN signals aimed at minimizing the SOP and maximizing the secrecy throughput. Our results reveal that it is non-trivial to achieve an OPA solution for the general scenario of imperfect hardware. We also highlight that our proposed masked beamforming with OPA scheme significantly enhances the secrecy throughput compared with the benchmark schemes of maximal-ratio transmission and equal power allocation.

cs.IT↗

arXiv2020

Optimal Detection Interval for Absorbing Receivers in Molecular Communication Systems with Interference

We consider a molecular communication system comprised of a transmitter, an absorbing receiver, and an interference source. Assuming amplitude modulation, we analyze the dependence of the bit error rate (BER) on the detection interval, which is the time within one transmission symbol interval during which the receiver is active to absorb and detect the number of information-carrying molecules. We then propose efficient algorithms to determine the optimal detection interval that minimizes the BER of the molecular communication system assuming no inter-symbol interference (ISI). Simulation and numerical evaluations are provided to highlight further insights into the optimal results. For example, we demonstrate that the optimal detection interval can be very small compared to the transmission symbol interval. Moreover, our numerical results show that significant BER improvements are achieved by using the optimal detection interval for systems without and with ISI.

cs.IT↗

arXiv2020

Fractionally-Spaced Equalization and Decision Feedback Sequence Detection for Diffusive MC

In this paper, we consider diffusive molecular communication (MC) systems affected by signal-dependent diffusive noise, inter-symbol interference, and external noise. We design linear and nonlinear fractionally-spaced equalization schemes and a detection scheme which combines decision feedback and sequence detection (DFSD). In contrast to the symbol-rate equalization schemes in the MC literature, the proposed equalization and detection schemes exploit multiple samples of the received signal per symbol interval to achieve lower bit error rates (BERs) than existing schemes. The proposed DFSD scheme achieves a BER which is very close to that achieved by maximum likelihood sequence detection, but with lower computational complexity.

cs.IT↗

arXiv2019

Chemical Reactions-based Detection Mechanism for Molecular Communications

In molecular communications, the direct detection of signaling molecules may be challenging due to a lack of suitable sensors and interference in the environment. Motivated by research in molecular biology, we investigate an indirect detection mechanism using chemical reactions between the signaling molecules and a molecular probe to produce an easy-to-measure product at the receiver. We consider two implementations of the proposed detection mechanism, i.e., unrestricted probe movement and probes restricted to a volume around the receiver. The reaction-diffusion equations describing the concentrations of the reactant and product molecules in the system are non-linear and coupled, and cannot be solved in closed form. Therefore, we develop an efficient iterative algorithm by discretizing the time variable and solving for the space variables of the equations in each time step. Our results show that the concentrations of the product molecules and the signalling molecules share a similar characteristic over time, i.e., a single peak and a long tail. The peak and tail values of the product molecule concentration can be controlled by choosing probes with suitable parameters. By carefully choosing the molecular probe and optimizing the decision threshold, the BER can be improved significantly and outperform that of a direct detection system.

cs.IT↗

arXiv2019

Diffusive Mobile MC with Absorbing Receivers: Stochastic Analysis and Applications

This paper presents a stochastic analysis of the time-variant channel impulse response (CIR) of a three dimensional diffusive mobile molecular communication (MC) system where the transmitter, the absorbing receiver, and the molecules can freely diffuse. In our analysis, we derive the mean, variance, probability density function (PDF), and cumulative distribution function (CDF) of the CIR. We also derive the PDF and CDF of the probability p that a released molecule is absorbed at the receiver during a given time period. The obtained analytical results are employed for the design of drug delivery and MC systems with imperfect channel state information. For the first application, we exploit the mean and variance of the CIR to optimize a controlled-release drug delivery system employing a mobile drug carrier. We evaluate the performance of the proposed release design based on the PDF and CDF of the CIR. We demonstrate significant savings in the amount of released drugs compared to a constant-release scheme and reveal the necessity of accounting for the drug-carrier's mobility to ensure reliable drug delivery. For the second application, we exploit the PDF of the distance between the mobile transceivers and the CDF of p to optimize three design parameters of an MC system employing on-off keying modulation and threshold detection. Specifically, we optimize the detection threshold at the receiver, the release profile at the transmitter, and the time duration of a bit frame. We show that the proposed optimal designs can significantly improve the system performance in terms of the bit error rate and the efficiency of molecule usage.

cs.IT↗

arXiv2018

Diffusive Mobile MC for Controlled-Release Drug Delivery with Absorbing Receiver

Nanoparticle drug carriers play an important role in facilitating efficient targeted drug delivery, i.e., improving treatment success and reducing drug costs and side effects. However, the mobility of nanoparticle drug carriers poses a challenge in designing drug delivery systems. Moreover, healing results critically depend on the rate and time duration of drug absorption. Therefore, in this paper, we aim to design a controlled-release drug delivery system with a mobile drug carrier that minimizes the total amount of released drugs while ensuring a desired rate of drug absorption during a prescribed time period. We model the mobile drug carrier as a mobile transmitter, the targeted diseased cells as an absorbing receiver, and the channel between the transceivers as a time-variant channel since the carrier mobility results in a time-variant absorption rate of the drug molecules. Based on this, we develop a molecular communication (MC) framework to design the controlled-release drug delivery system. In particular, we develop new analytical expressions for the mean, variance, probability density function, and cumulative distribution function of the channel impulse response (CIR). Equipped with the statistical analysis of the CIR, we design and evaluate the performance of the controlled-release drug delivery system. Numerical results show significant savings in the amount of released drugs compared to a constant-release rate design and reveal the necessity of accounting for drug carrier mobility for reliable drug delivery.

physics.med-ph↗

arXiv2018

A Code Equivalence between Secure Network and Index Coding

A code equivalence between index coding and network coding was established, which shows that any index-coding instance can be mapped to a network-coding instance, for which any index code can be translated to a network code with the same decoding-error performance, and vice versa. Also, any network-coding instance can be mapped to an index-coding instance with a similar code translation. In this paper, we extend the equivalence to secure index coding and secure network coding, where eavesdroppers are present in the networks, and any code construction needs to guarantee security constraints in addition to decoding-error performance.

cs.IT↗

arXiv2017

Optimal Power Allocation and Secrecy Sum Rate in Two-Way Untrusted Relaying

In this paper, we examine the secrecy performance of two-way relaying between a multiple antenna base station (BS) and a single antenna mobile user (MU) in the presence of a multiple antenna friendly jammer (FJ). We consider the untrusted relaying scenario where an amplify-and-forward relay is both a necessary helper and a potential eavesdropper. To maximize the instantaneous secrecy sum rate, we derive new closed-form solutions for the optimal power allocation (OPA) between the BS and MU under the scenario of relaying with friendly jamming (WFJ). Based on the OPA solution, new closed-form expressions are derived for the ergodic secrecy sum rate (ESSR) with Rayleigh fading channel. Furthermore, we explicitly determine the high signal-to-noise ratio slope and power offset of the ESSR to highlight the benefits of friendly jamming. Numerical examples are provided to demonstrate the impact of the FJ's location and number of antennas on the secrecy performance.

cs.CR↗

arXiv2017

Optimal Power Allocation by Imperfect Hardware Analysis in Untrusted Relaying Networks

By taking a variety of realistic hardware imperfections into consideration, we propose an optimal power allocation (OPA) strategy to maximize the instantaneous secrecy rate of a cooperative wireless network comprised of a source, a destination and an untrusted amplify-and-forward (AF) relay. We assume that either the source or the destination is equipped with a large-scale multiple antennas (LSMA) system, while the rest are equipped with a single antenna. To prevent the untrusted relay from intercepting the source message, the destination sends an intended jamming noise to the relay, which is referred to as destination-based cooperative jamming (DBCJ). Given this system model, novel closed-form expressions are presented in the high signal-to-noise ratio (SNR) regime for the ergodic secrecy rate (ESR) and the secrecy outage probability (SOP). We further improve the secrecy performance of the system by optimizing the associated hardware design. The results reveal that by beneficially distributing the tolerable hardware imperfections across the transmission and reception radio-frequency (RF) front ends of each node, the system's secrecy rate may be improved. The engineering insight is that equally sharing the total imperfections at the relay between the transmitter and the receiver provides the best secrecy performance. Numerical results illustrate that the proposed OPA together with the most appropriate hardware design significantly increases the secrecy rate.

cs.CR↗

arXiv2017

Secure two-way communication via a wireless powered untrusted relay and friendly jammer

In this paper, we propose a self-dependent two-way secure communication where two sources exchange confidential messages via a wireless powered untrusted amplify-and-forward (AF) relay and friendly jammer (FJ). By adopting the time switching (TS) architecture at the relay, the data transmission is accomplished in three phases: Phase I) Energy harvesting by the untrusted relay and the FJ through non-information transmissions from the sources, Phase II) Information transmission by the sources and jamming transmissions from the FJ to reduce information leakage to the untrusted relay; and Phase III) Forwarding the scaled version of the received signal from the untrusted relay to the sources. For the proposed system, we derive a new closed-form lower bound expression for the ergodic secrecy sum rate (ESSR). Numerical examples are provided to demonstrate the impacts of different system parameters such as energy harvesting time, transmit signal-to-noise ratio (SNR) and the relay/FJ location on the secrecy performance. The numerical results illustrate that the proposed network with friendly jamming (WFJ) outperforms traditional one-way communication and the two-way without friendly jamming (WoFJ) policy.

cs.CR↗

arXiv2017

Full-Duplex Cooperative Cognitive Radio Networks with Wireless Energy Harvesting

This paper proposes and analyzes a new full-duplex (FD) cooperative cognitive radio network with wireless energy harvesting (EH). We consider that the secondary receiver is equipped with a FD radio and acts as a FD hybrid access point (HAP), which aims to collect information from its associated EH secondary transmitter (ST) and relay the signals. The ST is assumed to be equipped with an EH unit and a rechargeable battery such that it can harvest and accumulate energy from radio frequency (RF) signals transmitted by the primary transmitter (PT) and the HAP. We develop a novel cooperative spectrum sharing (CSS) protocol for the considered system. In the proposed protocol, thanks to its FD capability, the HAP can receive the PT's signals and transmit energy-bearing signals to charge the ST simultaneously, or forward the PT's signals and receive the ST's signals at the same time. We derive analytical expressions for the achievable throughput of both primary and secondary links by characterizing the dynamic charging/discharging behaviors of the ST battery as a finite-state Markov chain. We present numerical results to validate our theoretical analysis and demonstrate the merits of the proposed protocol over its non-cooperative counterpart.

cs.IT↗

arXiv2017

An Equivalence Between Secure Network and Index Coding

We extend the equivalence between network coding and index coding by Effros, El Rouayheb, and Langberg to the secure communication setting in the presence of an eavesdropper. Specifically, we show that the most general versions of secure network-coding setup by Chan and Grant and the secure index-coding setup by Dau, Skachek, and Chee, which also include the randomised encoding setting, are equivalent.

cs.IT↗

arXiv2016

Secure Index Coding: Existence and Construction

We investigate the construction of weakly-secure index codes for a sender to send messages to multiple receivers with side information in the presence of an eavesdropper. We derive a sufficient and necessary condition for the existence of index codes that are secure against an eavesdropper with access to any subset of messages of cardinality $t$, for any fixed $t$. In contrast to the benefits of using random keys in secure network coding, we prove that random keys do not promote security in three classes of index-coding instances.

cs.IT↗