arXiv subjects

He Chen

Publications and source records attributed to He Chen.

At least 109 records · Page 6Linked to original sources

arXiv2017

Short-Packet Two-Way Amplify-and-Forward Relaying

This letter investigates an amplify-and-forward two-way relay network (TWRN) for short-packet communications. We consider a classical three-node TWRN consisting of two sources and one relay. Both two time slots (2TS) scheme and three time slots (3TS) scheme are studied under the finite blocklength regime. We derive approximate closed-form expressions of sum-block error rate (BLER) for both schemes. Simple asymptotic expressions for sum-BLER at high signal-to-noise ratio (SNR) are also derived. Based on the asymptotic expressions, we analytically compare the sum-BLER performance of 2TS and 3TS schemes, and attain an expression of critical blocklength, which can determine the performance superiority of 2TS and 3TS in terms of sum-BLER. Extensive simulations are provided to validate our theoretical analysis. Our results discover that 3TS scheme is more suitable for a system with lower relay transmission power, higher differences between the average SNR of both links and relatively lower requirements on data rate and latency.

cs.IT↗

arXiv2017

Cooperative Strategies for Wireless-Powered Communications: An Overview

Radio frequency (RF) energy transfer and harvesting has been intensively studied recently as a promising approach to significantly extend the lifetime of energy-constrained wireless networks. This technique has a great potential to provide relatively stable and continuous RF energy to devices wirelessly; it thus opened a new research paradigm, termed wireless-powered communication (WPC), which has raised many new research opportunities with wide applications. Among these, the design and analysis of cooperative schemes towards efficient WPC have attracted tremendous research interests nowadays. This article provides an overview of various cooperative strategies for WPC, with particular emphasis on relaying protocols for wireless-powered cooperative communications, cooperative spectrum sharing schemes for cognitive wireless-powered networks, and cooperative jamming strategies towards wireless-powered secure communications. We also identify several interesting research directions in this area before concluding this article.

cs.IT↗

arXiv2017

Antenna Selection in MIMO Non-orthogonal Multiple Access Systems

This paper considers the joint antenna selection (AS) problem for a classical two-user MIMO non-orthogonal multiple access (NOMA) system, where both the base station (BS) and users (UEs) are equipped with multiple antennas. Specifically, several computationally-efficient AS algorithms are developed for two commonly-used NOMA scenarios: fixed power allocation NOMA (F-NOMA) and cognitive radio-inspired NOMA (CR-NOMA). For the F-NOMA system, two novel AS schemes, namely max-max-max AS (A$^3$-AS) and max-min-max AS (AIA-AS), are proposed to maximize the system sum-rate, without and with the consideration of user fairness, respectively. In the CR-NOMA network, a novel AS algorithm, termed maximum-channel-gain-based AS (MCG-AS), is proposed to maximize the achievable rate of the secondary user, under the condition that the primary user's quality of service requirement is satisfied. The asymptotic closed-form expressions of the average sum-rate for A$^3$-AS and AIA-AS and that of the average rate of the secondary user for MCG-AS are derived, respectively. Numerical results demonstrate that the AIA-AS provides better user-fairness, while the A$^3$-AS achieves a near-optimal sum-rate in F-NOMA systems. For the CR-NOMA scenario, MCG-AS achieves a near-optimal performance in a wide SNR regime. Furthermore, all the proposed AS algorithms yield a significant computational complexity reduction, compared to exhaustive search-based counterparts.

cs.IT↗

arXiv2017

Ultra-Reliable Short-Packet Communications: Half-Duplex or Full-Duplex Relaying?

This letter analyzes and compares the performance of full-duplex relaying (FDR) and half-duplex relaying (HDR) for ultra-reliable short-packet communications. Specifically, we derive both approximate and asymptotic closed-form expressions of the block error rate (BLER) for FDR and HDR using short packets with finite blocklength codes. We define and attain a closed-form expression of a critical BLER, which can be used to efficiently determine the optimal duplex mode for ultra-reliable low latency communication scenarios. Our results unveil that FDR is more appealing to the system with relatively lower transmit power constraint, less stringent BLER requirement and stronger loop interference suppression.

cs.IT↗

arXiv2017

Distributed Multi-Relay Selection in Accumulate-then-Forward Energy Harvesting Relay Networks

This paper investigates a wireless-powered cooperative network (WPCN) consisting of one source-destination pair and multiple decode-and-forward (DF) relays. We develop an energy threshold based multi-relay selection (ETMRS) scheme for the considered WPCN. The proposed ETMRS scheme can be implemented in a fully distributed manner as the relays only need local information to switch between energy harvesting and information forwarding modes. By modeling the charging/discharging behaviours of the finite-capacity battery at each relay as a finite-state Markov Chain (MC), we derive an analytical expression for the system outage probability of the proposed ETMRS scheme over mixed Nakagami-$m$ and Rayleigh fading channels. Based on the derived expression, the optimal energy thresholds for all the relays corresponding to the minimum system outage probability can be obtained via an exhaustive search. However, this approach becomes computationally prohibitive when the number of relays and the associated number of battery energy levels is large. To resolve this issue, we propose a heuristic approach to optimize the energy threshold for each relay. To gain some useful insights for practical relay design, we also derive the upper bound for system outage probability corresponding to the case that all relays are equipped with infinite-capacity batteries. Numerical results validate our theoretical analysis. It is shown that the proposed heuristic approach can achieve a near-optimal system performance and our ETMRS scheme outperforms the existing single-relay selection scheme and common energy threshold scheme.

cs.IT↗

arXiv2017

Antenna Selection in MIMO Cognitive Radio-Inspired NOMA Systems

This letter investigates a joint antenna selection (AS) problem for a MIMO cognitive radio-inspired non-orthogonal multiple access (CR-NOMA) network. In particular, a new computationally efficient joint AS algorithm, namely subset-based joint AS (SJ-AS), is proposed to maximize the signal-to-noise ratio of the secondary user under the condition that the quality of service (QoS) of the primary user is satisfied. The asymptotic closed-form expression of the outage performance for SJ-AS is derived, and the minimal outage probability achieved by SJ-AS among all possible joint AS schemes is proved. The provided numerical results demonstrate the superior performance of the proposed scheme.

cs.IT↗

arXiv2017

Uplink Non-Orthogonal Multiple Access with Finite-Alphabet Inputs

This paper focuses on the non-orthogonal multiple access (NOMA) design for a classical two-user multiple access channel (MAC) with finite-alphabet inputs. We consider practical quadrature amplitude modulation (QAM) constellations at both transmitters, the sizes of which are assumed to be not necessarily identical. We propose to maximize the minimum Euclidean distance of the received sum-constellation with a maximum likelihood (ML) detector by adjusting the scaling factors (i.e., instantaneous transmitted powers and phases) of both users. The formulated problem is a mixed continuous-discrete optimization problem, which is nontrivial to resolve in general. By carefully observing the structure of the objective function, we discover that Farey sequence can be applied to tackle the formulated problem. However, the existing Farey sequence is not applicable when the constellation sizes of the two users are not the same. Motivated by this, we define a new type of Farey sequence, termed punched Farey sequence. Based on this, we manage to achieve a closed-form optimal solution to the original problem by first dividing the entire feasible region into a finite number of Farey intervals and then taking the maximum over all the possible intervals. The resulting sum-constellation is proved to be a regular QAM constellation of a larger size. Moreover, the superiority of NOMA over time-division multiple access (TDMA) in terms of minimum Euclidean distance is rigorously proved. Furthermore, the optimal rate allocation among the two users is obtained in closed-form to further maximize the obtained minimum Euclidean distance of the received signal subject to a total rate constraint. Finally, simulation results are provided to verify our theoretical analysis and demonstrate the merits of the proposed NOMA over existing orthogonal and non-orthogonal designs.

cs.IT↗

arXiv2017

On Non-Orthogonal Multiple Access with Finite-Alphabet Inputs in Z-Channels

This paper focuses on the design of non-orthogonal multiple access (NOMA) in a classical two-transmitter two-receiver Z-channel, wherein one transmitter sends information to its intended receiver from the direct link while the other transmitter sends information to both receivers from the direct and cross links. Unlike most existing designs using (continuous) Gaussian input distribution, we consider the practical finite-alphabet (i.e., discrete) inputs by assuming that the widely-used quadrature amplitude modulation (QAM) constellations are adopted by both transmitters. To balance the error performance of two receivers, we apply the max-min fairness design criterion in this paper. More specifically, we propose to jointly optimize the scaling factors at both transmitters, which control the minimum Euclidean distance of transmitting constellations, to maximize the smaller minimum Euclidean distance of two resulting constellations at the receivers, subject to an individual average power constraint at each transmitter. The formulated problem is a mixed continuous-discrete optimization problem and is thus intractable in general. By resorting to the Farey sequence, we manage to attain the closed-form expression for the optimal solution to the formulated problem. This is achieved by dividing the overall feasible region of the original optimization problem into a finite number of sub-intervals and deriving the optimal solution in each sub-interval. Through carefully observing the structure of the optimal solutions in all sub-intervals, we obtain compact and closed-form expressions for the optimal solutions to the original problem in three possible scenarios defined by the relative strength of the cross link. Simulation studies are provided to validate our analysis and demonstrate the merits of the proposed design over existing orthogonal or non-orthogonal schemes.

cs.IT↗

arXiv2017

Joint Rate Control and Power Allocation for Non-Orthogonal Multiple Access Systems

This paper investigates the optimal resource allocation of a downlink non-orthogonal multiple access (NOMA) system consisting of one base station and multiple users. Unlike existing short-term NOMA designs that focused on the resource allocation for only the current transmission timeslot, we aim to maximize a long-term network utility by jointly optimizing the data rate control at the network layer and the power allocation among multiple users at the physical layer, subject to practical constraints on both the short-term and long-term power consumptions. To solve this problem, we leverage the recently-developed Lyapunov optimization framework to convert the original long-term optimization problem into a series of online rate control and power allocation problems in each timeslot. The power allocation problem, however, is shown to be non-convex in nature and thus cannot be solved with a standard method. However, we explore two structures of the optimal solution and develop a dynamic programming based power allocation algorithm, which can derive a globally optimal solution, with a polynomial computational complexity. Extensive simulation results are provided to evaluate the performance of the proposed joint rate control and power allocation framework for NOMA systems, which demonstrate that the proposed NOMA design can significantly outperform multiple benchmark schemes, including orthogonal multiple access (OMA) schemes with optimal power allocation and NOMA schemes with non-optimal power allocation, in terms of average throughput and data delay.

cs.IT↗

arXiv2017

On the Performance of Multi-tier Heterogeneous Cellular Networks with Idle Mode Capability

This paper studies the impact of the base station (BS) idle mode capability (IMC) on the network performance of multi-tier and dense heterogeneous cellular networks (HCNs). Different from most existing works that investigated network scenarios with an infinite number of user equipments (UEs), we consider a more practical setup with a finite number of UEs in our analysis. More specifically, we derive the probability of which BS tier a typical UE should associate to and the expression of the activated BS density in each tier. Based on such results, analytical expressions for the coverage probability and the area spectral efficiency (ASE) in each tier are also obtained. The impact of the IMC on the performance of all BS tiers is shown to be significant. In particular, there will be a surplus of BSs when the BS density in each tier exceeds the UE density, and the overall coverage probability as well as the ASE continuously increase when the BS IMC is applied. Such finding is distinctively different from that in existing work. Thus, our result sheds new light on the design and deployment of the future 5G HCNs.

cs.NI↗

arXiv2017

The Influence of Surface Topography and Surface Chemistry on the Anti-Adhesive Performance of Nanoporous Monoliths

We designed spongy monoliths allowing liquid delivery to their surfaces through continuous nanopore systems (mean pore diameter ca. 40 nm). These nanoporous monoliths were flat or patterned with microspherical structures a few 10 microns in diameter, and their surfaces consisted of aprotic polymer or of TiO2 coatings. Liquid may reduce adhesion forces FAd; possible reasons include screening of solid-solid interactions and poroelastic effects. Softening-induced deformation of flat polymeric monoliths upon contact formation in the presence of liquids enhanced the work of separation WSe. On flat TiO2-coated monoliths, WSe was under wet conditions smaller than under dry conditions, possibly because of liquid-induced screening of solid-solid interactions. Under dry conditions, WSe is larger on flat TiO2-coated monoliths than on flat monoliths with polymeric surface. However, under wet conditions liquid-induced softening results in larger WSe on flat monoliths with polymeric surface than on flat monoliths with oxidic surface. Monolithic microsphere arrays show anti-adhesive properties; FAd and WSe are reduced by at least one order of magnitude as compared to flat nanoporous counterparts. On nanoporous monolithic microsphere arrays, capillarity (WSe is larger under wet than under dry conditions) and solid-solid interactions (WSe is larger on oxide than on polymer) dominate contact mechanics. Thus, the microsphere topography reduces the impact of softening-induced surface deformation and screening of solid-solid interactions associated with liquid supply. Overall, simple modifications of surface topography and chemistry combined with delivery of liquid to the contact interface allow adjusting WSe and FAd over at least one order of magnitude. (...)

cond-mat.soft↗

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

A Contract-based Incentive Mechanism for Energy Harvesting-based Internet of Things

By enabling wireless devices to be charged wirelessly and remotely, radio frequency energy harvesting (RFEH) has become a promising technology to power the unattended Internet of Things (IoT) low-power devices. To enable this, in future IoT networks, besides the conventional data access points (DAPs) responsible for collecting data from IoT devices, energy access points (EAPs) should be deployed to transfer radio frequency (RF) energy to IoT devices to maintain their sustainable operations. In practice, the DAPs and EAPs may be operated by different operators and a DAP should provide certain incentives to motivate the surrounding EAPs to charge its associated IoT device(s) to assist its data collection. Motivated by this, in this paper we develop a contract theory-based incentive mechanism for the energy trading in RFEH assisted IoT systems. The necessary and sufficient condition for the feasibility of the formulated contract is analyzed. The optimal contract is derived to maximize the DAP's expected utility as well as the social welfare. Simulation results demonstrate the feasibility and effectiveness of the proposed incentive mechanism.

cs.GT↗

arXiv2017

Fountain Code-Inspired Channel Estimation for Multi-user Millimeter Wave MIMO Systems

This paper develops a novel channel estimation approach for multi-user millimeter wave (mmWave) wireless systems with large antenna arrays. By exploiting the inherent mmWave channel sparsity, we propose a novel simultaneous-estimation with iterative fountain training (SWIFT) framework, in which the average number of channel measurements is adapted to various channel conditions. To this end, the base station (BS) and each user continue to measure the channel with a random subset of transmit/receive beamforming directions until the channel estimate converges. We formulate the channel estimation process as a compressed sensing problem and apply a sparse estimation approach to recover the virtual channel information. As SWIFT does not adapt the BS's transmitting beams to any single user, we are able to estimate all user channels simultaneously. Simulation results show that SWIFT can significantly outperform existing random-beamforming based approaches that use a fixed number of measurements, over a range of signal-to-noise ratios and channel coherence times.

cs.IT↗

arXiv2016

Wireless Energy Harvesting Cooperative Communications with Direct Link and Energy Accumulation

This paper investigates a wireless energy harvesting cooperative network (WEHCN) consisting of a source, a decode-and-forward (DF) relay and a destination. We consider the relay as an energy harvesting (EH) node equipped with EH circuit and a rechargeable battery. Moreover, the direct link between source and destination is assumed to exist. The relay can thus harvest and accumulate energy from radio-frequency signals ejected by the source and assist its information transmission opportunistically. We develop an incremental accumulate-then-forward (IATF) relaying protocol for the considered WEHCN. In the IATF protocol, the source sends its information to destination via the direct link and requests the relay to cooperate only when it is necessary such that the relay has more chances to accumulate the harvested energy. By modeling the charging/discharging behaviors of the relay battery as a finite-state Markov chain, we derive a closed-form expression for the outage probability of the proposed IATF. Numerical results validate our theoretical analysis and show that the IATF scheme can significantly outperform the direct transmission scheme without cooperation.

cs.IT↗

arXiv2016

Exploiting Energy Accumulation Against Co-channel Interference in Wireless Energy Harvesting MIMO Relaying

This paper investigates a three-node multiple-input multiple-output relay system suffering from co-channel interference (CCI) at the multi-antenna relay. Contrary to the conventional relay networks, we consider the scenario that the relay is an energy harvesting (EH) node and has no embedded energy supply. But it is equipped with a rechargeable battery such that it can harvest and accumulate the harvested energy from RF signals sent by the source and co-channel interferers to support its operation. Leveraging the inherent feature of the considered system, we develop a novel accumulate-then-forward (ATF) protocol to eliminate the harmful effect of CCI. In the proposed ATF scheme, at the beginning of each transmission block, the relay can choose either EH operation to harvest energy from source and CCI or information decoding (ID) operation to decode and forward source's information while suffering from CCI. Specifically, ID operation is activated only when the accumulated energy at the relay can support an outage-free transmission in the second hop. Otherwise, EH operation is invoked at the relay to harvest and accumulate energy. By modeling the finite-capacity battery of relay as a finite-state Markov Chain (MC), we derive a closed-form expression for the system throughput of the proposed ATF scheme over mixed Nakagami-m and Rayleigh fading channels. Numerical results validate our theoretical analysis, and show that the proposed ATF scheme with energy accumulation significantly outperforms the existing one without energy accumulation.

cs.IT↗

arXiv2016

Antenna Selection for MIMO-NOMA Networks

This paper considers the joint antenna selection (AS) problem for a classical two-user non-orthogonal multiple access (NOMA) network where both the base station and users are equipped with multiple antennas. Since the exhaustive-search-based optimal AS scheme is computationally prohibitive when the number of antennas is large, two computationally efficient joint AS algorithms, namely max-min-max AS (AIA-AS) and max-max-max AS (A$^3$-AS), are proposed to maximize the system sum-rate. The asymptotic closed-form expressions for the average sum-rates for both AIA-AS and A$^3$-AS are derived in the high signal-to-noise ratio (SNR) regime, respectively. Numerical results demonstrate that both AIA-AS and A$^3$-AS can yield significant performance gains over comparable schemes. Furthermore, AIA-AS can provide better user fairness, while the A$^3$-AS scheme can achieve the near-optimal sum-rate performance.

cs.IT↗

arXiv2016

Millimeter Wave MIMO Channel Estimation using Overlapped Beam Patterns and Rate Adaptation

This paper is concerned with the channel estimation problem in Millimeter wave (mmWave) wireless systems with large antenna arrays. By exploiting the inherent sparse nature of the mmWave channel, we first propose a fast channel estimation (FCE) algorithm based on a novel overlapped beam pattern design, which can increase the amount of information carried by each channel measurement and thus reduce the required channel estimation time compared to the existing non-overlapped designs. We develop a maximum likelihood (ML) estimator to optimally extract the path information from the channel measurements. Then, we propose a novel rate-adaptive channel estimation (RACE) algorithm, which can dynamically adjust the number of channel measurements based on the expected probability of estimation error (PEE). The performance of both proposed algorithms is analyzed. For the FCE algorithm, an approximate closed-form expression for the PEE is derived. For the RACE algorithm, a lower bound for the minimum signal energy-to-noise ratio required for a given number of channel measurements is developed based on the Shannon-Hartley theorem. Simulation results show that the FCE algorithm significantly reduces the number of channel estimation measurements compared to the existing algorithms using non-overlapped beam patterns. By adopting the RACE algorithm, we can achieve up to a 6dB gain in signal energy-to-noise ratio for the same PEE compared to the existing algorithms.

cs.IT↗