Kwok Hung Li

Bio: Kwok Hung Li is an academic researcher from Nanyang Technological University. The author has contributed to research in topics: Fading & Cognitive radio. The author has an hindex of 29, co-authored 212 publications receiving 3030 citations.

Energy-Efficient Design of Sequential Channel Sensing in Cognitive Radio Networks: Optimal Sensing Strategy, Power Allocation, and Sensing Order

Abstract: Energy-efficient design has become increasingly important to battery-powered wireless devices. In this paper, we focus on the energy efficiency of a cognitive radio network, in which a secondary user senses the channels licensed to some primary users sequentially before it decides to transmit. Energy is consumed in both the channel sensing and transmission processes. The energy-efficient design calls for a careful design in the sensing-access strategies and the sensing order, with the sensing strategy specifying when to stop sensing and start transmission, the access strategy specifying the power level to be used upon transmission, and the sensing order specifying the sequence of channel sensing. Hence, the objective of this paper is to identify the sensing-access strategies and the sensing order that achieve the maximum energy efficiency. We first investigate the design when the channel sensing order is given and formulate the above design problem as a stochastic sequential decision-making problem. To solve it, we study another parametric formulation of the original problem, which rewards transmission throughput and penalizes energy consumption. Dynamic programming can be applied to identify the optimal strategy for the parametric problem. Then, by exploring the relationship between the two formulations and making use of the monotonicity property of the parametric formulation, we develop an algorithm to find the optimal sensing-access strategies for the original problem. Furthermore, we study the joint design of the channel sensing order and the sensing-access strategies. Lastly, the performance of the proposed designs is evaluated through numerical results.

Secure communication over MISO cognitive radio channels

Abstract: In this paper, we address the physical-layer security issue of a secondary user (SU) in a spectrum-sharing cognitive radio network (CRN) from an information-theoretic perspective. Specially, we consider a secure multiple-input single-output (MISO) cognitive radio channel, where a multi-antenna SU transmitter (SU-Tx) sends confidential information to a legitimate SU receiver (SU-Rx) in the presence of an eavesdropper and on the licensed band of a primary user (PU). The secrecy capacity of the channel is characterized, which is a quasiconvex optimization problem of finding the capacity-achieving transmit covariance matrix under the joint transmit power and interference power constraints. Two numerical approaches are proposed to derive the optimal transmit covariance matrix. The first approach recasts the original quasiconvex problem into a single convex semidefinite program (SDP) by exploring its inherent convexity; while the second one explores the relationship between the secure CRN and the conventional CRN and transforms the original problem into a sequence of optimization problems associated with the conventional CRN, which helps to prove that beamforming is the optimal strategy for the secure MISO CR channel. In addition, to reduce the computational complexity, three suboptimal schemes are presented, namely, scaled secret beamforming (SSB), projected secret beamforming (PSB) and projected cognitive beamforming (PCB). Lastly, computer simulation results show that the three suboptimal schemes can approach the secrecy capacity well under certain conditions.

Downlink and Uplink Intelligent Reflecting Surface Aided Networks: NOMA and OMA

Abstract: Intelligent reflecting surfaces (IRSs) are envisioned to provide reconfigurable wireless environments for future communication networks In this paper, both downlink and uplink IRS-aided non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA) networks are studied, in which an IRS is deployed to enhance the coverage by assisting a cell-edge user device (UD) to communicate with the base station (BS) To characterize system performance, new channel statistics of the BS-IRS-UD link with Nakagami- $m$ fading are investigated For each scenario, the closed-form expressions for the outage probability and ergodic rate are derived To gain further insight, the diversity order and high signal-to-noise ratio (SNR) slope for each scenario are obtained according to asymptotic approximations in the high-SNR regime It is demonstrated that the diversity order is affected by the number of IRS reflecting elements and Nakagami fading parameters, but the high-SNR slope is not related to these parameters Simulation results validate our analysis and reveal the superiority of the IRS over the full-duplex decode-and-forward relay

Secure Communication in Multiantenna Cognitive Radio Networks With Imperfect Channel State Information

Abstract: In this paper, we address the issue of optimal transmitter design to achieve physical layer security for a multiple-input single-output (MISO) cognitive radio network (CRN), in which a secondary user transmitter (SU-Tx) sends confidential information to a SU receiver (SU-Rx) on the same frequency band with a primary user (PU) in the presence of an eavesdropper receiver (ED-Rx). It is assumed that all the channel state information (CSI) of the secondary, primary and eavesdropper channels is not perfectly known at the SU-Tx. The optimal transmitter design, under the restriction of Gaussian signaling without preprocessing of information, involves a nonconvex semiinfinite optimization problem which maximizes the rate of the secondary link while avoiding harmful interference to the PU and keeping the eavesdropper totally ignorant of the messages sent regardless of the uncertainties in the CSI. We propose two approaches to solve this challenging optimization problem. The first one relates the original problem to a sequence of semiinfinite capacity-achieving transmitter design problems in an auxiliary CRN without any eavesdropper, which can then be solved through transformations and using convex semidefinite programs (SDPs). The second approach explores the hidden convexity of the problem and hence transforms it into a single SDP, which significantly reduces the computational complexity. Furthermore, a few heuristic beamforming solutions for the ease of implementation are also introduced. Finally, simulation results are presented to evaluate the performance of the proposed optimal and suboptimal solutions.

How much time is needed for wideband spectrum sensing

Abstract: In this paper, we consider a wideband cognitive radio network (CRN) which can simultaneously sense multiple narrowband channels and thus aggregate the perceived available channels for transmission. We study the problem of designing the optimal spectrum sensing time and power allocation schemes so as to maximize the average achievable throughput of the CRN subject to the constraints of probability of detection and the total transmit power. The optimal sensing time and power allocation strategies are developed under two different total power constraints, namely, instantaneous power constraint and average power constraint. Finally, numerical results show that, under both cases, for a CRN with three 6 MHz channels, if the frame duration is 100 ms and the target probability of detection is 90% for the worst case signal-to-noise ratio of primary users being -12 dB, -15 dB and -20 dB, respectively, the optimal sensing time is around 6 ms and it is almost insensitive to the total transmit power.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

Random graphs

Abstract: We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Table Of Integrals Series And Products

Abstract: Thank you very much for downloading table of integrals series and products. Maybe you have knowledge that, people have look hundreds times for their chosen books like this table of integrals series and products, but end up in harmful downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they cope with some harmful virus inside their laptop. table of integrals series and products is available in our book collection an online access to it is set as public so you can get it instantly. Our book servers saves in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Merely said, the table of integrals series and products is universally compatible with any devices to read.

On the capacity of a cellular CDMA system

Abstract: It is shown that, particularly for terrestrial cellular telephony, the interference-suppression feature of CDMA (code division multiple access) can result in a many-fold increase in capacity over analog and even over competing digital techniques. A single-cell system, such as a hubbed satellite network, is addressed, and the basic expression for capacity is developed. The corresponding expressions for a multiple-cell system are derived. and the distribution on the number of users supportable per cell is determined. It is concluded that properly augmented and power-controlled multiple-cell CDMA promises a quantum increase in current cellular capacity. >