arXiv subjects

Robert Schober

Publications and source records attributed to Robert Schober.

At least 379 records · Page 21Linked to original sources

arXiv2017

Secure Transmission with Large Numbers of Antennas and Finite Alphabet Inputs

In this paper, we investigate secure transmission over the large-scale multiple-antenna wiretap channel with finite alphabet inputs. First, we investigate the case where instantaneous channel state information (CSI) of the eavesdropper is known at the transmitter. We show analytically that a generalized singular value decomposition (GSVD) based design, which is optimal for Gaussian inputs, may exhibit a severe performance loss for finite alphabet inputs in the high signal-to-noise ratio (SNR) regime. In light of this, we propose a novel Per-Group-GSVD (PG-GSVD) design which can effectively compensate the performance loss caused by the GSVD design. More importantly, the computational complexity of the PG-GSVD design is by orders of magnitude lower than that of the existing design for finite alphabet inputs in [1] while the resulting performance loss is minimal. Then, we extend the PG-GSVD design to the case where only statistical CSI of the eavesdropper is available at the transmitter. Numerical results indicate that the proposed PG-GSVD design can be efficiently implemented in large-scale multiple-antenna systems and achieves significant performance gains compared to the GSVD design.

cs.IT↗

arXiv2017

Statistical Analysis of Time-Variant Channels in Diffusive Mobile Molecular Communications

In this paper, we consider a diffusive mobile molecular communication (MC) system consisting of a pair of mobile transmitter and receiver nano-machines suspended in a fluid medium, where we model the mobility of the nano-machines by Brownian motion. The transmitter and receiver nano-machines exchange information via diffusive signaling molecules. Due to the random movements of the transmitter and receiver nano-machines, the statistics of the channel impulse response (CIR) change over time. We introduce a statistical framework for characterization of the impulse response of time-variant MC channels. In particular, we derive closed-form analytical expressions for the mean and the autocorrelation function of the impulse response of the channel. Given the autocorrelation function, we define the coherence time of the time-variant MC channel as a metric that characterizes the variations of the impulse response. Furthermore, we derive an analytical expression for evaluation of the expected error probability of a simple detector for the considered system. In order to investigate the impact of CIR decorrelation over time, we compare the performances of a detector with perfect channel state information (CSI) knowledge and a detector with outdated CSI knowledge. The accuracy of the proposed analytical expression is verified via particle-based simulation of the Brownian motion.

cs.IT↗

arXiv2017

C-RAN with Hybrid RF/FSO Fronthaul Links: Joint Optimization of RF Time Allocation and Fronthaul Compression

This paper considers the uplink of a cloud radio access network (C-RAN) comprised of several multi-antenna remote radio units (RUs) which send the data that they received from multiple mobile users (MUs) to a central unit (CU) via a wireless fronthaul link. One of the fundamental challenges in implementing C-RAN is the huge data rate required for fronthauling. To address this issue, we employ hybrid radio frequency (RF)/free space optical (FSO) systems for the fronthaul links as they benefit from both the large data rates of FSO links and the reliability of RF links. To efficiently exploit the fronthaul capacity, the RUs employ vector quantization to jointly compress the signals received at their antennas. Moreover, due to the limited available RF spectrum, we assume that the RF multiple-access and fronthaul links employ the same RF resources. Thereby, we propose an adaptive protocol which allocates transmission time to the RF multiple-access and fronthaul links in a time division duplex (TDD) manner and optimizes the quantization noise covariance matrix at each RU such that the sum rate is maximized. Our simulation results reveal that a considerable gain in terms of sum rate can be achieved by the proposed protocol in comparison with benchmark schemes from the literature, especially when the FSO links experience unfavorable atmospheric conditions.

cs.IT↗

arXiv2017

Low-Complexity MIMO Precoding for Finite-Alphabet Signals

This paper investigates the design of precoders for single-user multiple-input multiple-output (MIMO) channels, and in particular for finite-alphabet signals. Based on an asymptotic expression for the mutual information of channels exhibiting line-of-sight components and rather general antenna correlations, precoding structures that decompose the general channel into a set of parallel subchannel pairs are proposed. Then, a low-complexity iterative algorithm is devised to maximize the sum mutual information of all pairs. The proposed algorithm significantly reduces the computational load of existing approaches with only minimal loss in performance. The complexity savings increase with the number of transmit antennas and with the cardinality of the signal alphabet, making it possible to support values thereof that were unmanageable with existing solutions. Most importantly, the proposed solution does not require instantaneous channel state information (CSI) at the transmitter, but only statistical CSI.

cs.IT↗

arXiv2017

Cooperative Abnormality Detection via Diffusive Molecular Communications

In this paper, we consider abnormality detection via diffusive molecular communications (MCs) for a network consisting of several sensors and a fusion center (FC). If a sensor detects an abnormality, it injects into the medium a number of molecules which is proportional to the sensed value. Two transmission schemes for releasing molecules into the medium are considered. In the first scheme, referred to as DTM, each sensor releases a different type of molecule, whereas in the second scheme, referred to as STM, all sensors release the same type of molecule. The molecules released by the sensors propagate through the MC channel and some may reach the FC where the final decision regarding whether or not an abnormality has occurred is made. We derive the optimal decision rules for both DTM and STM. However, the optimal detectors entail high computational complexity as log-likelihood ratios (LLRs) have to be computed. To overcome this issue, we show that the optimal decision rule for STM can be transformed into an equivalent low-complexity decision rule. Since a similar transformation is not possible for DTM, we propose simple low-complexity sub-optimal detectors based on different approximations of the LLR. The proposed low-complexity detectors are more suitable for practical MC systems than the original complex optimal decision rule, particularly when the FC is a nano-machine with limited computational capabilities. Furthermore, we analyze the performance of the proposed detectors in terms of their false alarm and missed detection probabilities. Simulation results verify our analytical derivations and reveal interesting insights regarding the trade-off between complexity and performance of the proposed detectors and the considered DTM and STM schemes.

cs.IT↗

arXiv2017

NOMA Meets Finite Resolution Analog Beamforming in Massive MIMO and Millimeter-Wave Networks

Finite resolution analog beamforming (FRAB) has been recognized as an effective approach to reduce hardware costs in massive multiple-input multiple-output (MIMO) and millimeter-wave networks. However, the use of FRAB means that the beamformers are not perfectly aligned with the users' channels and multiple users may be assigned similar or even identifical beamformers. This letter shows how non-orthogonal multiple access (NOMA) can be used to exploit this feature of FRAB, where a single FRAB based beamformer is shared by multiple users. Both analytical and simulation results are provided to demonstrate the excellent performance achieved by this new NOMA transmission scheme.

cs.IT↗

arXiv2017

Symbol Synchronization for Diffusive Molecular Communication Systems

Symbol synchronization refers to the estimation of the start of a symbol interval and is needed for reliable detection. In this paper, we develop a symbol synchronization framework for molecular communication (MC) systems where we consider some practical challenges which have not been addressed in the literature yet. In particular, we take into account that in MC systems, the transmitter may not be equipped with an internal clock and may not be able to emit molecules with a fixed release frequency. Such restrictions hold for practical nanotransmitters, e.g. modified cells, where the lengths of the symbol intervals may vary due to the inherent randomness in the availability of food and energy for molecule generation, the process for molecule production, and the release process. To address this issue, we propose to employ two types of molecules, one for synchronization and one for data transmission. We derive the optimal maximum likelihood (ML) symbol synchronization scheme as a performance upper bound. Since ML synchronization entails high complexity, we also propose two low-complexity synchronization schemes, namely a peak observation-based scheme and a threshold-trigger scheme, which are suitable for MC systems with limited computational capabilities. Our simulation results reveal the effectiveness of the proposed synchronization~schemes and suggest that the end-to-end performance of MC systems significantly depends on the accuracy of symbol synchronization.

cs.IT↗

arXiv2017

Diffusive Mobile Molecular Communications Over Time-Variant Channels

This letter introduces a formalism for modeling time-variant channels for diffusive molecular communication systems. In particular, we consider a fluid environment where one transmitter nano-machine and one receiver nano-machine are subjected to Brownian motion in addition to the diffusive motion of the information molecules used for communication. Due to the stochastic movements of the transmitter and receiver nano-machines, the statistics of the channel impulse response change over time. We show that the time-variant behaviour of the channel can be accurately captured by appropriately modifying the diffusion coefficient of the information molecules. Furthermore, we derive an analytical expression for evaluation of the expected error probability of a simple detector for the considered system. The accuracy of the proposed analytical expression is verified via particle-based simulation of the Brownian motion.

cs.IT↗

arXiv2017

Simulating with AcCoRD: Actor-Based Communication via Reaction-Diffusion

This paper introduces AcCoRD (Actor-based Communication via Reaction-Diffusion) version 1.0. AcCoRD is a sandbox reaction-diffusion solver designed for the study of molecular communication systems. It uses a hybrid of microscopic and mesoscopic simulation models that enables scalability via user control of local accuracy. AcCoRD is developed in C as an open source command line tool and includes utilities to process simulation output in MATLAB. The latest code and links to user documentation can be found at https://github.com/adamjgnoel/AcCoRD/. This paper provides an overview of AcCoRD's design, including the motivation for developing a specialized reaction-diffusion solver. The corresponding algorithms are presented in detail, including the computational complexity of the microscopic and mesoscopic models. Other novel derivations include the transition rates between adjacent mesoscopic subvolumes of different sizes. Simulation results demonstrate the use of AcCoRD as both an accurate reaction-diffusion solver and one that is catered to the analysis of molecular communication systems. A link is included to videos that demonstrate many of the simulated scenarios. Additional insights from the simulation results include the selection of suitable hybrid model parameters, the impact of reactive surfaces that are in the proximity of a hybrid interface, and the size of a bounded environment that is necessary to assume that it is unbounded. The development of AcCoRD is ongoing, so its future direction is also discussed in order to highlight improvements that will expand its potential areas of application. New features that are being planned at the time of writing include a fluid flow model and more complex actor behavior.

physics.chem-ph↗

arXiv2017

Robust Resource Allocation for MIMO Wireless Powered Communication Networks Based on a Non-linear EH Model

In this paper, we consider a multiple-input multiple-output wireless powered communication network (MIMO-WPCN), where multiple users harvest energy from a dedicated power station in order to be able to transmit their information signals to an information receiving station. Employing a practical non-linear energy harvesting (EH) model, we propose a joint time allocation and power control scheme, which takes into account the uncertainty regarding the channel state information (CSI) and provides robustness against imperfect CSI knowledge. In particular, we formulate two non-convex optimization problems for different objectives, namely system sum throughput maximization and maximization of the minimum individual throughput across all wireless powered users. To overcome the non-convexity, we apply several transformations along with a one-dimensional search to obtain an efficient resource allocation algorithm. Numerical results reveal that a significant performance gain can be achieved when the resource allocation is designed based on the adopted non-linear EH model instead of the conventional linear EH model. Besides, unlike a non-robust baseline scheme designed for perfect CSI, the proposed resource allocation schemes are shown to be robust against imperfect CSI knowledge.

cs.IT↗

arXiv2017

Asymptotically Optimal Power Allocation for Energy Harvesting Communication Networks

For a general energy harvesting (EH) communication network, i.e., a network where the nodes generate their transmit power through EH, we derive the asymptotically optimal online power allocation solution which optimizes a general utility function when the number of transmit time slots, $N$, and the battery capacities of the EH nodes, $B_{\rm max}$, satisfy $N\to\infty$ and $B_{\rm max}\to\infty$. The considered family of utility functions is general enough to include the most important performance measures in communication theory such as the average data rate, outage probability, average bit error probability, and average signal-to-noise ratio. The proposed power allocation solution is very simple. Namely, the asymptotically optimal power allocation for the EH network is identical to the optimal power allocation for an equivalent non-EH network whose nodes have infinite energy available but their average transmit power is constrained to be equal to the average harvested power and/or the maximum average transmit power of the corresponding nodes in the EH network. Moreover, the maximum average performance of a general EH network converges to the maximum average performance of the corresponding equivalent non-EH network, when $N\to\infty$ and $B_{\rm max}\to\infty$. Although the proposed solution is asymptotic in nature, it is applicable to EH systems transmitting in a large but finite number of time slots and having a battery capacity much larger than the average harvested power and/or the maximum average transmit power.

cs.IT↗

arXiv2017

Secure SWIPT Networks Based on a Non-linear Energy Harvesting Model

We optimize resource allocation to enable communication security in simultaneous wireless information and power transfer (SWIPT) for internet-of-things (IoT) networks. The resource allocation algorithm design is formulated as a non-convex optimization problem. We aim at maximizing the total harvested power at energy harvesting (EH) receivers via the joint optimization of transmit beamforming vectors and the covariance matrix of the artificial noise injected to facilitate secrecy provisioning. The proposed problem formulation takes into account the non-linearity of energy harvesting circuits and the quality of service requirements for secure communication. To obtain a globally optimal solution of the resource allocation problem, we first transform the resulting non-convex sum-of-ratios objective function into an equivalent objective function in parametric subtractive form, which facilitates the design of a novel iterative resource allocation algorithm. In each iteration, the semidefinite programming (SDP) relaxation approach is adopted to solve a rank-constrained optimization problem optimally. Numerical results reveal that the proposed algorithm can guarantee communication security and provide a significant performance gain in terms of the harvested energy compared to existing designs which are based on the traditional linear EH model.

cs.IT↗

arXiv2016

Large-Scale MIMO Secure Transmission with Finite Alphabet Inputs

In this paper, we investigate secure transmission over the large-scale multiple-antenna wiretap channel with finite alphabet inputs. First, we show analytically that a generalized singular value decomposition (GSVD) based design, which is optimal for Gaussian inputs, may exhibit a severe performance loss for finite alphabet inputs in the high signal-to-noise ratio (SNR) regime. In light of this, we propose a novel Per-Group-GSVD (PG-GSVD) design which can effectively compensate the performance loss caused by the GSVD design. More importantly, the computational complexity of the PG-GSVD design is by orders of magnitude lower than that of the existing design for finite alphabet inputs in [1] while the resulting performance loss is minimal. Numerical results indicate that the proposed PG-GSVD design can be efficiently implemented in large-scale multiple-antenna systems and achieves significant performance gains compared to the GSVD design.

cs.IT↗

arXiv2016

Distributed Optimization of Hierarchical Small Cell Networks: A GNEP Framework

Deployment of small cell base stations (SBSs) overlaying the coverage area of a macrocell BS (MBS) results in a two-tier hierarchical small cell network. Cross-tier and inter-tier interference not only jeopardize primary macrocell communication but also limit the spectral efficiency of small cell communication. This paper focuses on distributed interference management for downlink small cell networks. We address the optimization of transmit strategies from both the game theoretical and the network utility maximization (NUM) perspectives and show that they can be unified in a generalized Nash equilibrium problem (GNEP) framework. Specifically, the small cell network design is first formulated as a GNEP, where the SBSs and MBS compete for the spectral resources by maximizing their own rates while satisfying global quality of service (QoS) constraints. We analyze the GNEP via variational inequality theory and propose distributed algorithms, which only require the broadcasting of some pricing information, to achieve a generalized Nash equilibrium (GNE). Then, we also consider a nonconvex NUM problem that aims to maximize the sum rate of all BSs subject to global QoS constraints. We establish the connection between the NUM problem and a penalized GNEP and show that its stationary solution can be obtained via a fixed point iteration of the GNE. We propose GNEP-based distributed algorithms that achieve a stationary solution of the NUM problem at the expense of additional signaling overhead and complexity. The convergence of the proposed algorithms is proved and guaranteed for properly chosen algorithm parameters. The proposed GNEP framework can scale from a QoS constrained game to a NUM design for small cell networks by trading off signaling overhead and complexity.

cs.IT↗

arXiv2016

Cooperative Wireless Backhauling

We consider wireless backhauling for a scenario where two small-cell base stations (SC-BSs) employ the same time and frequency resources for offloading their data to a common macro-cell base station (MC-BS). The two SC-BSs allocate a part of the shared resource to exchange data in order to be able to cooperate to boost the backhaul capacity. For this scenario, we develop the optimal transmission strategy which, based on the channel state information, determines whether the SC-BSs should exchange data and cooperate or transmit their data independently to the MC-BS. Our numerical results demonstrate the superiority of the proposed cooperative~wireless backhauling protocol compared to existing protocols in the literature.

cs.IT↗

arXiv2016

Cache-Enabled Physical-Layer Security for Video Streaming in Wireless Networks with Limited Backhaul

In this paper, we investigate for the first time the benefits of wireless caching for the physical layer security (PLS) of wireless networks. In particular, a caching scheme enabling power-efficient PLS is proposed for cellular video streaming with constrained backhaul capacity. By sharing video data across a subset of base stations (BSs) through both caching and backhaul loading, secure cooperative transmission of several BSs is dynamically enabled in accordance with the cache status, the channel conditions, and the backhaul capacity. Thereby, caching reduces the data sharing overhead over the capacity-constrained backhaul links. More importantly, caching introduces additional secure degrees of freedom and enables a power-efficient design. We investigate the optimal caching and transmission policies for minimizing the total transmit power while providing quality of service (QoS) and guaranteeing secrecy during video delivery. A two-stage non-convex mixed-integer optimization problem is formulated, which optimizes the caching policy in an offline video caching stage and the cooperative transmission policy in an online video delivery stage. As the problem is NP-hard, suboptimal polynomial-time algorithms are proposed for low-complexity cache training and delivery control, respectively. Sufficient optimality conditions, under which the proposed schemes attain global optimal solutions, are also provided. Simulation results show that the proposed schemes achieve low secrecy outage probability and high power efficiency simultaneously.

cs.IT↗

arXiv2016

Capacity of the Gaussian Two-Hop Full-Duplex Relay Channel with Residual Self-Interference

In this paper, we investigate the capacity of the Gaussian two-hop full-duplex (FD) relay channel with residual self-interference. This channel is comprised of a source, an FD relay, and a destination, where a direct source-destination link does not exist and the FD relay is impaired by residual self-interference. We adopt the worst-case linear self-interference model with respect to the channel capacity, and model the residual self-interference as a Gaussian random variable whose variance depends on the amplitude of the transmit symbol of the relay. For this channel, we derive the capacity and propose an explicit capacity-achieving coding scheme. Thereby, we show that the optimal input distribution at the source is Gaussian and its variance depends on the amplitude of the transmit symbol of the relay. On the other hand, the optimal input distribution at the relay is discrete or Gaussian, where the latter case occurs only when the relay-destination link is the bottleneck link. The derived capacity converges to the capacity of the two-hop ideal FD relay channel without self-interference and to the capacity of the two-hop half-duplex (HD) relay channel in the limiting cases when the residual self-interference is zero and infinite, respectively. Our numerical results show that significant performance gains are achieved with the proposed capacity-achieving coding scheme compared to the achievable rates of conventional HD relaying and/or conventional FD relaying.

cs.IT↗

arXiv2016

An Overview of Sustainable Green 5G Networks

The stringent requirements of a 1,000 times increase in data traffic and one millisecond round trip latency have made limiting the potentially tremendous ensuing energy consumption one of the most challenging problems for the design of the upcoming fifth-generation (5G) networks. To enable sustainable 5G networks, new technologies have been proposed to improve the system energy efficiency and alternative energy sources are introduced to reduce our dependence on traditional fossil fuels. In particular, various 5G techniques target the reduction of the energy consumption without sacrificing the quality-of-service. Meanwhile, energy harvesting technologies, which enable communication transceivers to harvest energy from various renewable resources and ambient radio frequency signals for communi- cation, have drawn significant interest from both academia and industry. In this article, we provide an overview of the latest research on both green 5G techniques and energy harvesting for communication. In addition, some technical challenges and potential research topics for realizing sustainable green 5G networks are also identified.

cs.IT↗