Searcharxiv⌕ Search

arXiv subjects

Arumugam Nallanathan

Publications and source records attributed to Arumugam Nallanathan.

At least 199 records · Page 11Linked to original sources

Robust Beamforming Design for Ultra-dense User-Centric C-RAN in the Face of Realistic Pilot Contamination and Limited Feedback

The ultra-dense cloud radio access network (UD-CRAN), in which remote radio heads (RRHs) are densely deployed in the network, is considered. To reduce the channel estimation overhead, we focus on the design of robust transmit beamforming for user-centric frequency division duplex (FDD) UD-CRANs, where only limited channel state information (CSI) is available. Specifically, we conceive a complete procedure for acquiring the CSI that includes two key steps: channel estimation and channel quantization. The phase ambiguity (PA) is also quantized for coherent cooperative transmission. Based on the imperfect CSI, we aim for optimizing the beamforming vectors in order to minimize the total transmit power subject to users' rate requirements and fronthaul capacity constraints. We derive the closed-form expression of the achievable data rate by exploiting the statistical properties of multiple uncertain terms. Then, we propose a low-complexity iterative algorithm for solving this problem based on the successive convex approximation technique. In each iteration, the Lagrange dual decomposition method is employed for obtaining the optimal beamforming vector. Furthermore, a pair of low-complexity user selection algorithms are provided to guarantee the feasibility of the problem. Simulation results confirm the accuracy of our robust algorithm in terms of meeting the rate requirements. Finally, our simulation results verify that using a single bit for quantizing the PA is capable of achieving good performance.

eess.SP↗

Analyzing Power Beacon Assisted Multi-Source Transmission Using Markov Chain

Wireless power transmission (WPT) is envisioned to be a promising technology for prolonging the lifetime of wireless devices in energy-constrained networks. This paper presents a general power beacon (PB) assisted multi-source transmission, where a practical source selection scheme with information transmission (IT) mode or non-IT mode is developed to maximize the transmission reliability. In the IT mode, a zero-forcing (ZF) beamformed signal with no interference to the destination is transmitted at the multi-antenna PB to supply wireless energy for the sources, and bring non-negative effect to the destination. Among multiple sources, the energy-sufficient source with the best channel quality is selected for wireless information transmission (WIT), while the other sources remain for energy harvesting. In the non-IT mode, the equal power transmission is adopted at PB to focus on energy delivery. Using Markov chain theory, the energy arrival and departure of each finite-capacity storage at the source is characterized mathematically, and the comprehensive analytical expressions of the energy outage probability (EOP), the connection outage probability (COP), and the average transmission delay (ATD) are formulated and derived. Our results reveal that the EOP, COP, and ATD can be significantly improved via increasing the number of sources deployed in the proposed network with finite transmit power of PB. We also prove that the multi-source network will never experience energy outage with infinite transmit power of PB.

eess.SP↗

A Machine Learning Approach for Power Allocation in HetNets Considering QoS

There is an increase in usage of smaller cells or femtocells to improve performance and coverage of next-generation heterogeneous wireless networks (HetNets). However, the interference caused by femtocells to neighboring cells is a limiting performance factor in dense HetNets. This interference is being managed via distributed resource allocation methods. However, as the density of the network increases so does the complexity of such resource allocation methods. Yet, unplanned deployment of femtocells requires an adaptable and self-organizing algorithm to make HetNets viable. As such, we propose to use a machine learning approach based on Q-learning to solve the resource allocation problem in such complex networks. By defining each base station as an agent, a cellular network is modelled as a multi-agent network. Subsequently, cooperative Q-learning can be applied as an efficient approach to manage the resources of a multi-agent network. Furthermore, the proposed approach considers the quality of service (QoS) for each user and fairness in the network. In comparison with prior work, the proposed approach can bring more than a four-fold increase in the number of supported femtocells while using cooperative Q-learning to reduce resource allocation overhead.

cs.IT↗

Optimal Throughput Fairness Trade-offs for Downlink Non-Orthogonal Multiple Access over Fading Channels

Recently, non-orthogonal multiple access (NOMA) has attracted considerable interest as one of the 5G-enabling techniques. However, users with better channel conditions in downlink communications intrinsically benefits from NOMA thanks to successive decoding, judicious designs are required to guarantee user fairness. In this paper, a two-user downlink NOMA system over fading channels is considered. For delay-tolerant transmission, the average sum-rate is maximized subject to both average and peak power constraints as well as a minimum average user rate constraint. The optimal resource allocation is obtained using Lagrangian dual decomposition under full channel state information at the transmitter (CSIT), while an effective power allocation policy under partial CSIT is also developed based on analytical results. In parallel, for delay-limited transmission, the sum of delay-limited throughput (DLT) is maximized subject to a maximum allowable user outage constraint under full CSIT, and the analysis for the sum of DLT is also performed under partial CSIT. Furthermore, an optimal orthogonal multiple access (OMA) scheme is also studied as a benchmark to prove the superiority of NOMA over OMA under full CSIT. Finally, the theoretical analysis is verified by simulations via different trade-offs for the average sum-rate (sum-DLT) versus the minimum (maximum) average user rate (outage) requirement.

cs.IT↗

Joint Task Assignment and Wireless Resource Allocation for Cooperative Mobile-Edge Computing

This paper studies a multi-user cooperative mobile-edge computing (MEC) system, in which a local mobile user can offload intensive computation tasks to multiple nearby edge devices serving as helpers for remote execution. We focus on the scenario where the local user has a number of independent tasks that can be executed in parallel but cannot be further partitioned. We consider a time division multiple access (TDMA) communication protocol, in which the local user can offload computation tasks to the helpers and download results from them over pre-scheduled time slots. Under this setup, we minimize the local user's computation latency by optimizing the task assignment jointly with the time and power allocations, subject to individual energy constraints at the local user and the helpers. However, the joint task assignment and wireless resource allocation problem is a mixed-integer non-linear program (MINLP) that is hard to solve optimally. To tackle this challenge, we first relax it into a convex problem, and then propose an efficient suboptimal solution based on the optimal solution to the relaxed convex problem. Finally, numerical results show that our proposed joint design significantly reduces the local user's computation latency, as compared against other benchmark schemes that design the task assignment separately from the offloading/downloading resource allocations and local execution.

eess.SP↗

Exploiting Multiple Access in Clustered Millimeter Wave Networks: NOMA or OMA?

In this paper, we introduce a clustered millimeter wave network with non-orthogonal multiple access (NOMA), where the base station (BS) is located at the center of each cluster and all users follow a Poisson Cluster Process. To provide a realistic directional beamforming, an actual antenna pattern is deployed at all BSs. We provide a nearest-random scheme, in which near user is the closest node to the corresponding BS and far user is selected at random, to appraise the coverage performance and universal throughput of our system. Novel closed-form expressions are derived under a loose network assumption. Moreover, we present several Monte Carlo simulations and numerical results, which show that: 1) NOMA outperforms orthogonal multiple access regarding the system rate; 2) the coverage probability is proportional to the number of possible NOMA users and a negative relationship with the variance of intra-cluster receivers; and 3) an optimal number of the antenna elements is existed for maximizing the system throughput.

cs.IT↗

Modeling and Analysis of MmWave Communications in Cache-enabled HetNets

In this paper, we consider a novel cache-enabled heterogeneous network (HetNet), where macro base stations (BSs) with traditional sub-6 GHz are overlaid by dense millimeter wave (mmWave) pico BSs. These two-tier BSs, which are modeled as two independent homogeneous Poisson Point Processes, cache multimedia contents following the popularity rank. High-capacity backhauls are utilized between macro BSs and the core server. A maximum received power strategy is introduced for deducing novel algorithms of the success probability and area spectral efficiency (ASE). Moreover, Monte Carlo simulations are presented to verify the analytical conclusions and numerical results demonstrate that: 1) the proposed HetNet is an interference-limited system and it outperforms the traditional HetNets; 2) there exists an optimal pre-decided rate threshold that contributes to the maximum ASE; and 3) 73 GHz is the best mmWave carrier frequency regarding ASE due to the large antenna scale.

cs.IT↗

Toward Cross-Layer Design for Non-Orthogonal Multiple Access: A Quality-of-Experience Perspective

Recent years have seen proliferation in versatile mobile devices and an upsurge in the growth of data-consuming application services. Orthogonal multiple access (OMA) technologies in today's mobile systems fall inefficient in the presence of such massive connectivity and traffic demands. In this regards, non-orthogonal multiple access (NOMA) has been advocated by the research community to embrace unprecedented requirements. Current NOMA designs have been demonstrated to largely improve conventional system performance in terms of throughput and latency, while their impact on the end users' perceived experience has not yet been comprehensively understood. We envision that quality-of-experience (QoE) awareness is a key pillar for NOMA designs to fulfill versatile user demands in the 5th generation (5G) wireless communication systems. This article systematically investigates QoE-aware NOMA designs that translate the physical-layer benefits of NOMA to the improvement of users' perceived experience in upper layers. We shed light on design principles and key challenges in realizing QoE-aware NOMA designs. With these principles and challenges in mind, we develop a general architecture with a dynamic network scheduling scheme. We provide some implications for future QoE-aware NOMA designs by conducting a case study in video streaming applications.

cs.NI↗

Multiple Antenna Assisted Non-Orthogonal Multiple Access

Non-orthogonal multiple access (NOMA) is potentially capable of circumventing the limitations of the classic orthogonal multiple access schemes, hence it has recently received significant research attention both in industry and academia. This article is focused on exploiting multiple antenna techniques in NOMA networks, with an emphasis on investigating the rate region of multiple-input multiple-output (MIMO)-NOMA, whist reviewing two popular multiple antennas aided NOMA structures, as well as underlining resource management problems of both single-carrier and multi-carrier MIMO-NOMA networks. This article also points out several effective methods of tackling the practical implementation constraints of multiple antenna NOMA networks. Finally, some promising open research directions are provided in context of multiple antenna aided NOMA.

cs.IT↗

Outage Performance of Two-Way Relay Non-Orthogonal Multiple Access Systems

This paper investigates a two-way relay nonorthogonal multiple access (TWR-NOMA) system, where two groups of NOMA users exchange messages with the aid of one half-duplex (HD) decode-and-forward (DF) relay. Since the signal-plus-interference-to-noise ratios (SINRs) of NOMA signals mainly depend on effective successive interference cancellation (SIC) schemes, imperfect SIC (ipSIC) and perfect SIC (pSIC) are taken into consideration. To characterize the performance of TWR-NOMA systems, we derive closed-form expressions for both exact and asymptotic outage probabilities of NOMA users' signals with ipSIC/pSIC. Based on the results derived, the diversity order and throughput of the system are examined. Numerical simulations demonstrate that: 1) TWR-NOMA is superior to TWR-OMA in terms of outage probability in low SNR regimes; and 2) Due to the impact of interference signal (IS) at the relay, error floors and throughput ceilings exist in outage probabilities and ergodic rates for TWR-NOMA, respectively.

cs.IT↗

Joint Pilot Allocation and Robust Transmission Design for Ultra-dense User-centric TDD C-RAN with Imperfect CSI

This paper considers the unavailability of complete channel state information (CSI) in ultra-dense cloud radio access networks (C-RANs). The user-centric cluster is adopted to reduce the computational complexity, while the incomplete CSI is considered to reduce the heavy channel training overhead, where only large-scale inter-cluster CSI is available. Channel estimation for intra-cluster CSI is also considered, where we formulate a joint pilot allocation and user equipment (UE) selection problem to maximize the number of admitted UEs with fixed number of pilots. A novel pilot allocation algorithm is proposed by considering the multi-UE pilot interference. Then, we consider robust beam-vector optimization problem subject to UEs' data rate requirements and fronthaul capacity constraints, where the channel estimation error and incomplete inter-cluster CSI are considered. The exact data rate is difficult to obtain in closed form, and instead we conservatively replace it with its lower-bound. The resulting problem is non-convex, combinatorial, and even infeasible. A practical algorithm, based on UE selection, successive convex approximation (SCA) and semi-definite relaxation approach, is proposed to solve this problem with guaranteed convergence. We strictly prove that semidefinite relaxation is tight with probability 1. Finally, extensive simulation results are presented to show the fast convergence of our proposed algorithm and demonstrate its superiority over the existing algorithms.

cs.IT↗

Analyzing Large-Scale Multiuser Molecular Communication via 3D Stochastic Geometry

Information delivery using chemical molecules is an integral part of biology at multiple distance scales and has attracted recent interest in bioengineering and communication theory. Potential applications include cooperative networks with a large number of simple devices that could be randomly located (e.g., due to mobility). This paper presents the first tractable analytical model for the collective signal strength due to randomly-placed transmitters in a three-dimensional (3D) large-scale molecular communication system, either with or without degradation in the propagation environment. Transmitter locations in an unbounded and homogeneous fluid are modelled as a homogeneous Poisson point process. By applying stochastic geometry, analytical expressions are derived for the expected number of molecules absorbed by a fully-absorbing receiver or observed by a passive receiver. The bit error probability is derived under ON/OFF keying and either a constant or adaptive decision threshold. Results reveal that the combined signal strength increases proportionately with the transmitter density, and the minimum bit error probability can be improved by introducing molecule degradation. Furthermore, the analysis of the system can be generalized to other receiver designs and other performance characteristics in large-scale molecular communication systems.

cs.IT↗

Enhancing PHY Security of Cooperative Cognitive Radio Multicast Communications

In this paper, we propose a cooperative approach to improve the security of both primary and secondary systems in cognitive radio multicast communications. During their access to the frequency spectrum licensed to the primary users, the secondary unlicensed users assist the primary system in fortifying security by sending a jamming noise to the eavesdroppers, while simultaneously protect themselves from eavesdropping. The main objective of this work is to maximize the secrecy rate of the secondary system, while adhering to all individual primary users' secrecy rate constraints. In the case of active eavesdroppers and perfect channel state information (CSI) at the transceivers, the utility function of interest is nonconcave and the involved constraints are nonconvex, and thus, the optimal solutions are troublesome. To solve this problem, we propose an iterative algorithm to arrive at least to a local optimum of the original nonconvex problem. This algorithm is guaranteed to achieve a Karush-Kuhn-Tucker solution. Then, we extend the optimization approach to the case of passive eavesdroppers and imperfect CSI knowledge at the transceivers, where the constraints are transformed into a linear matrix inequality and convex constraints, in order to facilitate the optimal solution.

cs.IT↗

Robust Sum Secrecy Rate Optimization for MIMO Two-way Full Duplex Systems

This paper considers multiple-input multiple-output (MIMO) full-duplex (FD) two-way secrecy systems. Specifically, both multi-antenna FD legitimate nodes exchange their own confidential message in the presence of an eavesdropper. Taking into account the imperfect channel state information (CSI) of the eavesdropper, we formulate a robust sum secrecy rate maximization (RSSRM) problem subject to the outage probability constraint of the achievable sum secrecy rate and the transmit power constraint. Unlike other existing channel uncertainty models, e.g., norm-bounded and Gaussian-distribution, we exploit a moment-based random distributed CSI channel uncertainty model to recast our formulate RSSRM problem into the convex optimization frameworks based on a Markov's inequality and robust conic reformulation, i.e., semidefinite programming (SDP). In addition, difference-of-concave (DC) approximation is employed to iteratively tackle the transmit covariance matrices of these legitimate nodes. Simulation results are provided to validate our proposed FD approaches.

cs.IT↗

Non-orthogonal Multiple Access in Large-Scale Heterogeneous Networks

In this paper, the potential benefits of applying non-orthogonal multiple access (NOMA) technique in $K$-tier hybrid heterogeneous networks (HetNets) is explored. A promising new transmission framework is proposed, in which NOMA is adopted in small cells and massive multiple-input multiple-output (MIMO) is employed in macro cells. For maximizing the biased average received power for mobile users, a NOMA and massive MIMO based user association scheme is developed. To evaluate the performance of the proposed framework, we first derive the analytical expressions for the coverage probability of NOMA enhanced small cells. We then examine the spectrum efficiency of the whole network, by deriving exact analytical expressions for NOMA enhanced small cells and a tractable lower bound for massive MIMO enabled macro cells. Lastly, we investigate the energy efficiency of the hybrid HetNets. Our results demonstrate that: 1) The coverage probability of NOMA enhanced small cells is affected to a large extent by the targeted transmit rates and power sharing coefficients of two NOMA users; 2) Massive MIMO enabled macro cells are capable of significantly enhancing the spectrum efficiency by increasing the number of antennas; 3) The energy efficiency of the whole network can be greatly improved by densely deploying NOMA enhanced small cell base stations (BSs); and 4) The proposed NOMA enhanced HetNets transmission scheme has superior performance compared to the orthogonal multiple access~(OMA) based HetNets.

cs.IT↗

Optimal User Scheduling and Power Allocation for Millimeter Wave NOMA Systems

This paper investigates the application of non-orthogonal multiple access (NOMA) in millimeter wave (mmWave) communications by exploiting beamforming, user scheduling and power allocation. Random beamforming is invoked for reducing the feedback overhead of considered systems. A nonconvex optimization problem for maximizing the sum rate is formulated, which is proved to be NP-hard. The branch and bound (BB) approach is invoked to obtain the optimal power allocation policy, which is proved to converge to a global optimal solution. To elaborate further, low complexity suboptimal approach is developed for striking a good computational complexity-optimality tradeoff, where matching theory and successive convex approximation (SCA) techniques are invoked for tackling the user scheduling and power allocation problems, respectively. Simulation results reveal that: i) the proposed low complexity solution achieves a near-optimal performance; and ii) the proposed mmWave NOMA systems is capable of outperforming conventional mmWave orthogonal multiple access (OMA) systems in terms of sum rate and the number of served users.

cs.IT↗

Optimizing DF Cognitive Radio Networks with Full-Duplex-Enabled Energy Access Points

With the recent advances in radio frequency (RF) energy harvesting (EH) technologies, wireless powered cooperative cognitive radio network (CCRN) has drawn an upsurge of interest for improving the spectrum utilization with incentive to motivate joint information and energy cooperation between the primary and secondary systems. Dedicated energy beamforming (EB) is aimed for remedying the low efficiency of wireless power transfer (WPT), which nevertheless arouses out-of-band EH phases and thus low cooperation efficiency. To address this issue, in this paper, we consider a novel RF EH CCRN aided by full-duplex (FD)-enabled energy access points (EAPs) that can cooperate to wireless charge the secondary transmitter (ST) while concurrently receiving primary transmitter (PT)'s signal in the first transmission phase, and to perform decode-and-forward (DF) relaying in the second transmission phase. We investigate a weighted sum-rate maximization problem subject to the transmitting power constraints as well as a total cost constraint using successive convex approximation (SCA) techniques. A zero-forcing (ZF) based suboptimal scheme that requires only local CSIs for the EAPs to obtain their optimum receive beamforming is also derived. Various tradeoffs between the weighted sum-rate and other system parameters are provided in numerical results to corroborate the effectiveness of the proposed solutions against the benchmark ones.

cs.IT↗

Robust Beamforming for Secrecy Rate in Cooperative Cognitive Radio Multicast Communications

In this paper, we propose a cooperative approach to improve the security of both primary and secondary systems in cognitive radio multicast communications. During their access to the frequency spectrum licensed to the primary users, the secondary unlicensed users assist the primary system in fortifying security by sending a jamming noise to the eavesdroppers, while simultaneously protect themselves from eavesdropping. The main objective of this work is to maximize the secrecy rate of the secondary system, while adhering to all individual primary users' secrecy rate constraints. In the case of passive eavesdroppers and imperfect channel state information knowledge at the transceivers, the utility function of interest is nonconcave and involved constraints are nonconvex, and thus, the optimal solutions are troublesome. To address this problem, we propose an iterative algorithm to arrive at a local optimum of the considered problem. The proposed iterative algorithm is guaranteed to achieve a Karush-Kuhn-Tucker solution.

cs.IT↗