arXiv subjects

Robert Schober

Publications and source records attributed to Robert Schober.

At least 469 records · Page 26Linked to original sources

arXiv2014

Diffusive Molecular Communication with Disruptive Flows

In this paper, we study the performance of detectors in a diffusive molecular communication environment where steady uniform flow is present. We derive the expected number of information molecules to be observed in a passive spherical receiver, and determine the impact of flow on the assumption that the concentration of molecules throughout the receiver is uniform. Simulation results show the impact of advection on detector performance as a function of the flow's magnitude and direction. We highlight that there are disruptive flows, i.e., flows that are not in the direction of information transmission, that lead to an improvement in detector performance as long as the disruptive flow does not dominate diffusion and sufficient samples are taken.

cs.IT↗

arXiv2014

Adaptive Mode Selection for Bidirectional Relay Networks -- Fixed Rate Transmission

In this paper, we consider the problem of sum throughput maximization for bidirectional relay networks with block fading. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct link between both users is not present. We assume that channel state information at the transmitter (CSIT) is not available and/or only one coding and modulation scheme is used at the transmitters due to complexity constraints. Thus, the nodes transmit with a fixed predefined rate regardless of the channel state information (CSI). In general, the nodes in the network can assume one of three possible states in each time slot, namely the transmit, receive, and silent state. Most of the existing protocols assume a fixed schedule for the sequence of the states of the nodes. In this paper, we abandon the restriction of having a fixed and predefined schedule and propose a new protocol which, based on the CSI at the receiver (CSIR), selects the optimal states of the nodes in each time slot such that the sum throughput is maximized. To this end, the relay has to be equipped with two buffers for storage of the information received from the two users. Numerical results show that the proposed protocol significantly outperforms the existing protocols.

cs.IT↗

arXiv2014

Linear MIMO Precoding in Jointly-Correlated Fading Multiple Access Channels with Finite Alphabet Signaling

In this paper, we investigate the design of linear precoders for multiple-input multiple-output (MIMO) multiple access channels (MAC). We assume that statistical channel state information (CSI) is available at the transmitters and consider the problem under the practical finite alphabet input assumption. First, we derive an asymptotic (in the large-system limit) weighted sum rate (WSR) expression for the MIMO MAC with finite alphabet inputs and general jointly-correlated fading. Subsequently, we obtain necessary conditions for linear precoders maximizing the asymptotic WSR and propose an iterative algorithm for determining the precoders of all users. In the proposed algorithm, the search space of each user for designing the precoding matrices is its own modulation set. This significantly reduces the dimension of the search space for finding the precoding matrices of all users compared to the conventional precoding design for the MIMO MAC with finite alphabet inputs, where the search space is the combination of the modulation sets of all users. As a result, the proposed algorithm decreases the computational complexity for MIMO MAC precoding design with finite alphabet inputs by several orders of magnitude. Simulation results for finite alphabet signalling indicate that the proposed iterative algorithm achieves significant performance gains over existing precoder designs, including the precoder design based on the Gaussian input assumption, in terms of both the sum rate and the coded bit error rate.

cs.IT↗

arXiv2014

Secure Layered Transmission in Multicast Systems with Wireless Information and Power Transfer

This paper considers downlink multicast transmit beamforming for secure layered transmission systems with wireless simultaneous information and power transfer. We study the power allocation algorithm design for minimizing the total transmit power in the presence of passive eavesdroppers and energy harvesting receivers. The algorithm design is formulated as a non-convex optimization problem. Our problem formulation promotes the dual use of energy signals in providing secure communication and facilitating efficient energy transfer. Besides, we take into account a minimum required power for energy harvesting at the idle receivers and heterogeneous quality of service (QoS) requirements for the multicast video receivers. In light of the intractability of the problem, we reformulate the considered problem by replacing a non-convex probabilistic constraint with a convex deterministic constraint. Then, a semidefinite programming relaxation (SDR) approach is adopted to obtain an upper solution for the reformulated problem. Subsequently, sufficient conditions for the global optimal solution of the reformulated problem are revealed. Furthermore, we propose two suboptimal power allocation schemes based on the upper bound solution. Simulation results demonstrate the excellent performance and significant transmit power savings achieved by the proposed schemes compared to isotropic energy signal generation.

cs.IT↗

arXiv2014

Relay Selection for Simultaneous Information Transmission and Wireless Energy Transfer: A Tradeoff Perspective

In certain applications, relay terminals can be employed to simultaneously deliver information and energy to a designated receiver and a radio frequency (RF) energy harvester, respectively. In such scenarios, the relay that is preferable for information transmission does not necessarily coincide with the relay with the strongest channel to the energy harvester, since the corresponding channels fade independently. Relay selection thus entails a tradeoff between the efficiency of the information transfer to the receiver and the amount of energy transferred to the energy harvester. The study of this tradeoff is the subject on which this work mainly focuses. Specifically, we investigate the behavior of the ergodic capacity and the outage probability of the information transmission to the receiver, for a given amount of energy transferred to the RF energy harvester. We propose two relay selection methods that apply to any number of available relays. Furthermore, for the case of two relays, we develop the optimal relay selection method in a maximum capacity / minimum outage probability sense, for a given energy transfer constraint. A close-to-optimal selection method that is easier to analyze than the optimal one is also examined. Closed-form expressions for the capacity-energy and the outage-energy tradeoffs of the developed schemes are provided and corroborated by simulations. Interesting insights on the aforementioned tradeoffs are obtained.

cs.IT↗

arXiv2013

Power Efficient MISO Beamforming for Secure Layered Transmission

This paper studies secure layered video transmission in a multiuser multiple-input single-output (MISO) beamforming downlink communication system. The power allocation algorithm design is formulated as a non-convex optimization problem for minimizing the total transmit power while guaranteeing a minimum received signal-to-interference-plus-noise ratio (SINR) at the desired receiver. In particular, the proposed problem formulation takes into account the self-protecting architecture of layered transmission and artificial noise generation to prevent potential information eavesdropping. A semi-definite programming (SDP) relaxation based power allocation algorithm is proposed to obtain an upper bound solution. A sufficient condition for the global optimal solution is examined to reveal the tightness of the upper bound solution. Subsequently, two suboptimal power allocation schemes with low computational complexity are proposed for enabling secure layered video transmission. Simulation results demonstrate significant transmit power savings achieved by the proposed algorithms and layered transmission compared to the baseline schemes.

cs.IT↗

arXiv2013

Improving Receiver Performance of Diffusive Molecular Communication with Enzymes

This paper studies the mitigation of intersymbol interference in a diffusive molecular communication system using enzymes that freely diffuse in the propagation environment. The enzymes form reaction intermediates with information molecules and then degrade them so that they cannot interfere with future transmissions. A lower bound expression on the expected number of molecules measured at the receiver is derived. A simple binary receiver detection scheme is proposed where the number of observed molecules is sampled at the time when the maximum number of molecules is expected. Insight is also provided into the selection of an appropriate bit interval. The expected bit error probability is derived as a function of the current and all previously transmitted bits. Simulation results show the accuracy of the bit error probability expression and the improvement in communication performance by having active enzymes present.

cs.IT↗

arXiv2013

Achievable Rate Region of the Bidirectional Buffer-Aided Relay Channel with Block Fading

The bidirectional relay channel, in which two users communicate with each other through a relay node, is a simple but fundamental and practical network architecture. In this paper, we consider the block fading bidirectional relay channel and propose efficient transmission strategies that exploit the block fading property of the channel. Thereby, we consider a decode-and-forward relay and assume that a direct link between the two users is not present. Our aim is to characterize the long-term achievable rate region and to develop protocols which achieve all points of the obtained rate region. Specifically, in the bidirectional relay channel, there exist six possible transmission modes: four point-to-point modes (user 1-to-relay, user 2-to-relay, relay-to-user 1, relay-to-user 2), a multiple-access mode (both users to the relay), and a broadcast mode (the relay to both users). Most existing protocols assume a fixed schedule for using a subset of the aforementioned transmission modes. Motivated by this limitation, we develop protocols which are not restricted to adhere to a predefined schedule for using the transmission modes. In fact, based on the instantaneous channel state information (CSI) of the involved links, the proposed protocol selects the optimal transmission mode in each time slot to maximize the long-term achievable rate region. Thereby, we consider two different types of transmit power constraints: 1) a joint long-term power constraint for all nodes, and 2) a fixed transmit power for each node. Furthermore, to enable the use of a non-predefined schedule for transmission mode selection, the relay has to be equipped with two buffers for storage of the information received from both users. As data buffering increases the end-to-end delay, we consider both delay-unconstrained and delay-constrained transmission in the paper.

cs.IT↗

arXiv2013

Receiver Concepts and Resource Allocation for OSC Downlink Transmission

Voice services over Adaptive Multi-user channels on One Slot (VAMOS) has been standardized as an extension to the Global System for Mobile Communications (GSM). The aim of VAMOS is to increase the capacity of GSM, while maintaining backward compatibility with the legacy system. To this end, the Orthogonal Sub-channels (OSC) concept is employed, where two Gaussian minimum-shift keying (GMSK) signals are transmitted in the same time slot and with the same carrier frequency. To fully exploit the possible capacity gain of OSC, new receiver concepts are necessary. In contrast to the base station, where multiple antennas can be employed, the mobile station is typically equipped with only one receive antenna. Therefore, the downlink receiver design is a very challenging task. Different concepts for channel estimation, user separation, and equalization at the receiver of an OSC downlink transmission are introduced in this paper. Furthermore, the system capacity must be improved by suitable downlink power and resource allocation algorithms. Making realistic assumptions on the information available at the base station, an algorithm for joint power and radio resource allocation is proposed. Simulation results show the excellent performance of the proposed channel estimation algorithms, equalization schemes, and joint radio resource and power allocation algorithms in realistic VAMOS environments.

cs.IT↗

arXiv2013

Wireless Information and Power Transfer: Energy Efficiency Optimization in OFDMA Systems

This paper considers orthogonal frequency division multiple access systems with simultaneous wireless information and power transfer. We study the resource allocation algorithm design for maximization of the energy efficiency of data transmission. In particular, we focus on power splitting hybrid receivers which are able to split the received signals into two power streams for concurrent information decoding and energy harvesting. Two scenarios are investigated considering different power splitting abilities of the receivers. In the first scenario, we assume receivers which can split the received power into a continuous set of power streams with arbitrary power splitting ratios. In the second scenario, we examine receivers which can split the received power only into a discrete set of power streams with fixed power splitting ratios. In both scenarios, we formulate the corresponding algorithm design as a non-convex optimization problem which takes into account the circuit power consumption, the minimum data rate requirements of delay constrained services, the minimum required system data rate, and the minimum amount of power that has to be delivered to the receivers. Subsequently, by exploiting fractional programming and dual decomposition, suboptimal iterative resource allocation algorithms are proposed to solve the non-convex problems. Simulation results illustrate that the proposed iterative resource allocation algorithms approach the optimal solution within a small number of iterations and unveil the trade-off between energy efficiency, system capacity, and wireless power transfer.

cs.IT↗

arXiv2013

Multi-user Scheduling Schemes for Simultaneous Wireless Information and Power Transfer

In this paper, we study the downlink multi-user scheduling problem for a time-slotted system with simultaneous wireless information and power transfer. In particular, in each time slot, a single user is scheduled to receive information, while the remaining users opportunistically harvest the ambient radio frequency (RF) energy. We devise novel scheduling schemes in which the tradeoff between the users' ergodic capacities and their average amount of harvested energy can be controlled. To this end, we modify two fair scheduling schemes used in information-only transfer systems. First, proportionally fair maximum normalized signal-to-noise ratio (N-SNR) scheduling is modified by scheduling the user having the jth ascendingly ordered (rather than the maximum) N-SNR. We refer to this scheme as order-based N-SNR scheduling. Second, conventional equal-throughput (ET) fair scheduling is modified by scheduling the user having the minimum moving average throughput among the set of users whose N-SNR orders fall into a certain set of allowed orders Sa (rather than the set of all users). We refer to this scheme as order-based ET scheduling. The feasibility conditions required for the users to achieve ET with this scheme are also derived. We show that the smaller the selection order j for the order-based N-SNR scheme, and the lower the orders in Sa for the order-based ET scheme, the higher the average amount of energy harvested by the users at the expense of a reduction in their ergodic capacities. We analyze the performance of the considered scheduling schemes for independent and non-identically distributed (i.n.d.) Ricean fading channels, and provide closed-form results for the special case of i.n.d. Rayleigh fading.

cs.IT↗

arXiv2013

Improving Bandwidth Efficiency in E-band Communication Systems

The allocation of a large amount of bandwidth by regulating bodies in the 70/80 GHz band, i.e., the E-band, has opened up new potentials and challenges for providing affordable and reliable Gigabit per second wireless point-to-point links. This article first reviews the available bandwidth and licensing regulations in the E-band. Subsequently, different propagation models, e.g., the ITU-R and Cane models, are compared against measurement results and it is concluded that to meet specific availability requirements, E-band wireless systems may need to be designed with larger fade margins compared to microwave systems. A similar comparison is carried out between measurements and models for oscillator phase noise. It is confirmed that phase noise characteristics, that are neglected by the models used for narrowband systems, need to be taken into account for the wideband systems deployed in the E-band. Next, a new multi-input multi-output (MIMO) transceiver design, termed continuous aperture phased (CAP)-MIMO, is presented. Simulations show that CAP-MIMO enables E-band systems to achieve fiber-optic like throughputs. Finally, it is argued that full-duplex relaying can be used to greatly enhance the coverage of E-band systems without sacrificing throughput, thus, facilitating their application in establishing the backhaul of heterogeneous networks.

cs.NI↗

arXiv2013

Multi-Objective Beamforming for Secure Communication in Systems with Wireless Information and Power Transfer

In this paper, we study power allocation for secure communication in a multiuser multiple-input single-output (MISO) downlink system with simultaneous wireless information and power transfer. The receivers are able to harvest energy from the radio frequency when they are idle. We propose a multi-objective optimization problem for power allocation algorithm design which incorporates two conflicting system objectives: total transmit power minimization and energy harvesting efficiency maximization. The proposed problem formulation takes into account a quality of service (QoS) requirement for the system secrecy capacity. Our designs advocate the dual use of artificial noise in providing secure communication and facilitating efficient energy harvesting. The multi-objective optimization problem is non-convex and is solved by a semidefinite programming (SDP) relaxation approach which results in an approximate of solution. A sufficient condition for the global optimal solution is revealed and the accuracy of the approximation is examined. To strike a balance between computational complexity and system performance, we propose two suboptimal power allocation schemes. Numerical results not only demonstrate the excellent performance of the proposed suboptimal schemes compared to baseline schemes, but also unveil an interesting trade-off between energy harvesting efficiency and total transmit power.

cs.IT↗

arXiv2013

Optimal Tx-BF for MIMO SC-FDE Systems

Transmit beamforming (Tx-BF) for multiple-input multiple-output (MIMO) channels is an effective means to improve system performance. In frequency-selective channels, Tx-BF can be implemented in combination with single-carrier frequency-domain equalization (SC-FDE) to combat inter-symbol interference. In this paper, we consider the optimal design of the Tx-BF matrix for a MIMO SC-FDE system employing a linear minimum mean square error (MSE) receiver. We formulate the Tx-BF optimization problem as the minimization of a general function of the stream MSEs, subject to a transmit power constraint. The optimal structure of the Tx-BF matrix is obtained in closed form and an efficient algorithm is proposed for computing the optimal power allocation. Our simulation results validate the excellent performance of the proposed scheme in terms of uncoded bit-error rate and achievable bit rate.

cs.IT↗

arXiv2013

Adaptive Mode Selection in Bidirectional Buffer-aided Relay Networks with Fixed Transmit Powers

We consider a bidirectional network in which two users exchange information with the help of a buffer-aided relay. In such a network without direct link between user 1 and user 2, there exist six possible transmission modes, i.e., four point-to-point modes (user 1-to-relay, user 2-to-relay, relay-to-user 1, relay-to-user 2), a multiple access mode (both users to the relay), and a broadcast mode (the relay to both users). Because of the buffering capability at the relay, the transmissions in the network are not restricted to adhere to a predefined schedule, and therefore, all the transmission modes in the bidirectional relay network can be used adaptively based on the instantaneous channel state information (CSI) of the involved links. For the considered network, assuming fixed transmit powers for both the users and the relay, we derive the optimal transmission mode selection policy which maximizes the sum rate. The proposed policy selects one out of the six possible transmission modes in each time slot based on the instantaneous CSI. Simulation results confirm the effectiveness of the proposed protocol compared to existing protocols.

cs.IT↗

arXiv2013

Adaptive Mode Selection and Power Allocation in Bidirectional Buffer-aided Relay Networks

In this paper, we consider the problem of sum rate maximization in a bidirectional relay network with fading. Hereby, user 1 and user 2 communicate with each other only through a relay, i.e., a direct link between user 1 and user 2 is not present. In this network, there exist six possible transmission modes: four point-to-point modes (user 1-to-relay, user 2-to-relay, relay-to-user 1, relay-to-user 2), a multiple access mode (both users to the relay), and a broadcast mode (the relay to both users). Most existing protocols assume a fixed schedule of using a subset of the aforementioned transmission modes, as a result, the sum rate is limited by the capacity of the weakest link associated with the relay in each time slot. Motivated by this limitation, we develop a protocol which is not restricted to adhere to a predefined schedule for using the transmission modes. Therefore, all transmission modes of the bidirectional relay network can be used adaptively based on the instantaneous channel state information (CSI) of the involved links. To this end, the relay has to be equipped with two buffers for the storage of the information received from users 1 and 2, respectively. For the considered network, given a total average power budget for all nodes, we jointly optimize the transmission mode selection and power allocation based on the instantaneous CSI in each time slot for sum rate maximization. Simulation results show that the proposed protocol outperforms existing protocols for all signal-to-noise ratios (SNRs). Specifically, we obtain a considerable gain at low SNRs due to the adaptive power allocation and at high SNRs due to the adaptive mode selection.

cs.IT↗

arXiv2013

Resource Allocation for Secure Communication in Systems with Wireless Information and Power Transfer

This paper considers secure communication in a multiuser multiple-input single-output (MISO) downlink system with simultaneous wireless information and power transfer. We study the design of resource allocation algorithms minimizing the total transmit power for the case when the receivers are able to harvest energy from the radio frequency. In particular, the algorithm design is formulated as a non-convex optimization problem which takes into account artificial noise generation to combat potential eavesdroppers, a minimum required signal-to-interference-plus-noise ratio (SINR) at the desired receiver, maximum tolerable SINRs at the potential eavesdroppers, and a minimum required power delivered to the receivers. We adopt a semidefinite programming (SDP) relaxation approach to obtain an upper bound solution for the considered problem. The tightness of the upper bound is revealed by examining a sufficient condition for the global optimal solution. Inspired by the sufficient condition, we propose two suboptimal resource allocation schemes enhancing secure communication and facilitating efficient energy harvesting. Simulation results demonstrate a close-to-optimal performance achieved by the proposed suboptimal schemes and significant transmit power savings by optimization of the artificial noise generation.

cs.IT↗

arXiv2013

Improving Diffusion-Based Molecular Communication with Unanchored Enzymes

In this paper, we propose adding enzymes to the propagation environment of a diffusive molecular communication system as a strategy for mitigating intersymbol interference. The enzymes form reaction intermediates with information molecules and then degrade them so that they have a smaller chance of interfering with future transmissions. We present the reaction-diffusion dynamics of this proposed system and derive a lower bound expression for the expected number of molecules observed at the receiver. We justify a particle-based simulation framework, and present simulation results that show both the accuracy of our expression and the potential for enzymes to improve communication performance.

cs.IT↗