arXiv subjects

Robert Schober

Publications and source records attributed to Robert Schober.

485 records · Page 27Linked to original sources

arXiv2013

Using Dimensional Analysis to Assess Scalability and Accuracy in Molecular Communication

In this paper, we apply dimensional analysis to study a diffusive molecular communication system that uses diffusing enzymes in the propagation environment to mitigate intersymbol interference. The enzymes bind to information molecules and then degrade them so that they cannot interfere with the detection of future transmissions at the receiver. We determine when it is accurate to assume that the concentration of information molecules throughout the receiver is constant and equal to that expected at the center of the receiver. We show that a lower bound on the expected number of molecules observed at the receiver can be arbitrarily scaled over the environmental parameters, and generalize how the accuracy of the lower bound is qualitatively impacted by those parameters.

cs.IT↗

arXiv2013

Spectral Efficient Optimization in OFDM Systems with Wireless Information and Power Transfer

This paper considers an orthogonal frequency division multiplexing (OFDM) point-to-point wireless communication system with simultaneous wireless information and power transfer. We study a receiver which is able to harvest energy from the desired signal, noise, and interference. In particular, we consider a power splitting receiver which dynamically splits the received power into two power streams for information decoding and energy harvesting. We design power allocation algorithms maximizing the spectral efficiency (bit/s/Hz) of data transmission. In particular, the algorithm design is formulated as a nonconvex optimization problem which takes into account the constraint on the minimum power delivered to the receiver. The problem is solved by using convex optimization techniques and a one-dimensional search. The optimal power allocation algorithm serves as a system benchmark scheme due to its high complexity. To strike a balance between system performance and computational complexity, we also propose two suboptimal algorithms which require a low computational complexity. Simulation results demonstrate the excellent performance of the proposed suboptimal algorithms.

cs.IT↗

arXiv2013

Energy-Efficient Resource Allocation in OFDMA Systems with Hybrid Energy Harvesting Base Station

We study resource allocation algorithm design for energy-efficient communication in an OFDMA downlink network with hybrid energy harvesting base station. Specifically, an energy harvester and a constant energy source driven by a non-renewable resource are used for supplying the energy required for system operation. We first consider a deterministic offline system setting. In particular, assuming availability of non-causal knowledge about energy arrivals and channel gains, an offline resource allocation problem is formulated as a non-convex optimization problem taking into account the circuit energy consumption, a finite energy storage capacity, and a minimum required data rate. We transform this non-convex optimization problem into a convex optimization problem by applying time-sharing and fractional programming which results in an efficient asymptotically optimal offline iterative resource allocation algorithm. In each iteration, the transformed problem is solved by using Lagrange dual decomposition. The obtained resource allocation policy maximizes the weighted energy efficiency of data transmission. Subsequently, we focus on online algorithm design. A stochastic dynamic programming approach is employed to obtain the optimal online resource allocation algorithm which requires a prohibitively high complexity. To strike a balance between system performance and computational complexity, we propose a low complexity suboptimal online iterative algorithm which is motivated by the offline optimization.

cs.IT↗

arXiv2013

Buffer-Aided Relaying with Adaptive Link Selection - Fixed and Mixed Rate Transmission

We consider a simple network consisting of a source, a half-duplex DF relay with a buffer, and a destination. We assume that the direct source-destination link is not available and all links undergo fading. We propose two new buffer-aided relaying schemes. In the first scheme, neither the source nor the relay have CSIT, and consequently, both nodes are forced to transmit with fixed rates. In contrast, in the second scheme, the source does not have CSIT and transmits with fixed rate but the relay has CSIT and adapts its transmission rate accordingly. In the absence of delay constraints, for both fixed rate and mixed rate transmission, we derive the throughput-optimal buffer-aided relaying protocols which select either the source or the relay for transmission based on the instantaneous SNRs of the source-relay and the relay-destination links. In addition, for the delay constrained case, we develop buffer-aided relaying protocols that achieve a predefined average delay. Compared to conventional relaying protocols, which select the transmitting node according to a predefined schedule independent of the link instantaneous SNRs, the proposed buffer-aided protocols with adaptive link selection achieve large performance gains. In particular, for fixed rate transmission, we show that the proposed protocol achieves a diversity gain of two as long as an average delay of more than three time slots can be afforded. Furthermore, for mixed rate transmission with an average delay of $E{T}$ time slots, a multiplexing gain of $r=1-1/(2E{T})$ is achieved. Hence, for mixed rate transmission, for sufficiently large average delays, buffer-aided half-duplex relaying with and without adaptive link selection does not suffer from a multiplexing gain loss compared to full-duplex relaying.

cs.IT↗

arXiv2013

Energy-Efficient Power Allocation in OFDM Systems with Wireless Information and Power Transfer

This paper considers an orthogonal frequency division multiplexing (OFDM) downlink point-to-point system with simultaneous wireless information and power transfer. It is assumed that the receiver is able to harvest energy from noise, interference, and the desired signals. We study the design of power allocation algorithms maximizing the energy efficiency of data transmission (bit/Joule delivered to the receiver). In particular, the algorithm design is formulated as a high-dimensional non-convex optimization problem which takes into account the circuit power consumption, the minimum required data rate, and a constraint on the minimum power delivered to the receiver. Subsequently, by exploiting the properties of nonlinear fractional programming, the considered non-convex optimization problem, whose objective function is in fractional form, is transformed into an equivalent optimization problem having an objective function in subtractive form, which enables the derivation of an efficient iterative power allocation algorithm. In each iteration, the optimal power allocation solution is derived based on dual decomposition and a one-dimensional search. Simulation results illustrate that the proposed iterative power allocation algorithm converges to the optimal solution, and unveil the trade-off between energy efficiency, system capacity, and wireless power transfer: (1) In the low transmit power regime, maximizing the system capacity may maximize the energy efficiency. (2) Wireless power transfer can enhance the energy efficiency, especially in the interference limited regime.

cs.IT↗

arXiv2012

Energy-Efficient Resource Allocation in Multiuser OFDM Systems with Wireless Information and Power Transfer

In this paper, we study the resource allocation algorithm design for multiuser orthogonal frequency division multiplexing (OFDM) downlink systems with simultaneous wireless information and power transfer. The algorithm design is formulated as a non-convex optimization problem for maximizing the energy efficiency of data transmission (bit/Joule delivered to the users). In particular, the problem formulation takes into account the minimum required system data rate, heterogeneous minimum required power transfers to the users, and the circuit power consumption. Subsequently, by exploiting the method of time-sharing and the properties of nonlinear fractional programming, the considered non-convex optimization problem is solved using an efficient iterative resource allocation algorithm. For each iteration, the optimal power allocation and user selection solution are derived based on Lagrange dual decomposition. Simulation results illustrate that the proposed iterative resource allocation algorithm achieves the maximum energy efficiency of the system and reveal how energy efficiency, system capacity, and wireless power transfer benefit from the presence of multiple users in the system.

cs.IT↗

arXiv2012

Spectral Efficiency in Large-Scale MIMO-OFDM Systems with Per-Antenna Power Cost

In this paper, resource allocation for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) downlink networks with large numbers of base station antennas is studied. Assuming perfect channel state information at the transmitter, the resource allocation algorithm design is modeled as a non-convex optimization problem which takes into account the joint power consumption of the power amplifiers, antenna unit, and signal processing circuit unit. Subsequently, by exploiting the law of large numbers and dual decomposition, an efficient suboptimal iterative resource allocation algorithm is proposed for maximization of the system capacity (bit/s). In particular, closed-form power allocation and antenna allocation policies are derived in each iteration. Simulation results illustrate that the proposed iterative resource allocation algorithm achieves a close-to-optimal performance in a small number of iterations and unveil a trade-off between system capacity and the number of activated antennas: Activating all antennas may not be a good solution for system capacity maximization when a system with a per antenna power cost is considered.

cs.IT↗

arXiv2012

Transceiver Design For SC-FDE Based MIMO Relay Systems

In this paper, we propose a joint transceiver design for single-carrier frequency-domain equalization (SC-FDE) based multiple-input multiple-output (MIMO) relay systems. To this end, we first derive the optimal minimum mean-squared error linear and decision-feedback frequency-domain equalization filters at the destination along with the corresponding error covariance matrices at the output of the equalizer. Subsequently, we formulate the source and relay precoding matrix design problem as the minimization of a family of Schur-convex and Schur-concave functions of the mean-squared errors at the output of the equalizer under separate power constraints for the source and the relay. By exploiting properties of the error covariance matrix and results from majorization theory, we derive the optimal structures of the source and relay precoding matrices, which allows us to transform the matrix optimization problem into a scalar power optimization problem. Adopting a high signal-to-noise ratio approximation for the objective function, we obtain the global optimal solution for the power allocation variables. Simulation results illustrate the excellent performance of the proposed system and its superiority compared to conventional orthogonal frequency-division multiplexing based MIMO relay systems.

cs.IT↗

arXiv2012

Buffer-Aided Relaying with Adaptive Link Selection

In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the channel state information of the source-relay and the relay-destination link a decision is made whether the source or the relay transmits. In order to avoid data loss at the relay, adaptive link selection requires the relay to be equipped with a buffer such that data can be queued until the relay-destination link is selected for transmission. We study both delay constrained and delay unconstrained transmission. For the delay unconstrained case, we characterize the optimal link selection policy, derive the corresponding throughput, and develop an optimal power allocation scheme. For the delay constrained case, we propose to starve the buffer of the relay by choosing the decision threshold of the link selection policy smaller than the optimal one and derive a corresponding upper bound on the average delay. Furthermore, we propose a modified link selection protocol which avoids buffer overflow by limiting the queue size. Our analytical and numerical results show that buffer-aided relaying with adaptive link selection achieves significant throughput gains compared to conventional relaying protocols with and without buffers where the relay employs a fixed schedule for reception and transmission.

cs.IT↗

arXiv2012

Power Allocation for Conventional and Buffer-Aided Link Adaptive Relaying Systems with Energy Harvesting Nodes

Energy harvesting (EH) nodes can play an important role in cooperative communication systems which do not have a continuous power supply. In this paper, we consider the optimization of conventional and buffer-aided link adaptive EH relaying systems, where an EH source communicates with the destination via an EH decode-and-forward relay. In conventional relaying, source and relay transmit signals in consecutive time slots whereas in buffer-aided link adaptive relaying, the state of the source-relay and relay-destination channels determines whether the source or the relay is selected for transmission. Our objective is to maximize the system throughput over a finite number of transmission time slots for both relaying protocols. In case of conventional relaying, we propose an offline and several online joint source and relay transmit power allocation schemes. For offline power allocation, we formulate an optimization problem which can be solved optimally. For the online case, we propose a dynamic programming (DP) approach to compute the optimal online transmit power. To alleviate the complexity inherent to DP, we also propose several suboptimal online power allocation schemes. For buffer-aided link adaptive relaying, we show that the joint offline optimization of the source and relay transmit powers along with the link selection results in a mixed integer non-linear program which we solve optimally using the spatial branch-and-bound method. We also propose an efficient online power allocation scheme and a naive online power allocation scheme for buffer-aided link adaptive relaying. Our results show that link adaptive relaying provides performance improvement over conventional relaying at the expense of a higher computational complexity.

cs.IT↗

arXiv2011

Cooperative Diversity with Mobile Nodes: Capacity Outage Rate and Duration

The outage probability is an important performance measure for cooperative diversity schemes. However, in mobile environments, the outage probability does not completely describe the behavior of cooperative diversity schemes since the mobility of the involved nodes introduces variations in the channel gains. As a result, the capacity outage events are correlated in time and second-order statistical parameters of the achievable information-theoretic capacity such as the average capacity outage rate (AOR) and the average capacity outage duration (AOD) are required to obtain a more complete description of the properties of cooperative diversity protocols. In this paper, assuming slow Rayleigh fading, we derive exact expressions for the AOR and the AOD of three well-known cooperative diversity protocols: variable-gain amplify-and-forward, decode-and-forward, and selection decode-and-forward relaying. Furthermore, we develop asymptotically tight high signal-to-noise ratio (SNR) approximations, which offer important insights into the influence of various system and channel parameters on the AOR and AOD. In particular, we show that on a double-logarithmic scale, similar to the outage probability, the AOR asymptotically decays with the SNR with a slope that depends on the diversity gain of the cooperative protocol, whereas the AOD asymptotically decays with a slope of -1/2 independent of the diversity gain.

cs.IT↗

arXiv2011

The Diversity Potential of Relay Selection with Practical Channel Estimation

We investigate the diversity order of decode-and-forward relay selection in Nakagami-m fading, in cases where practical channel estimation techniques are applied. In this respect, we introduce a unified model for the imperfect channel estimates, where the effects of noise, time-varying channels, and feedback delays are jointly considered. Based on this model, the correlation between the actual and the estimated channel values, ρ, is expressed as a function of the signal-to-noise ratio (SNR), yielding closed-form expressions for the overall outage probability as a function of ρ. The resulting diversity order and power gain reveal a high dependence of the performance of relay selection on the high SNR behavior of ρ, thus shedding light onto the effect of channel estimation on the overall performance. It is shown that when the channel estimates are not frequently updated in applications involving time-varying channels, or when the amount of power allocated for channel estimation is not sufficiently high, the diversity potential of relay selection is severely degraded. In short, the main contribution of this paper lies in answering the following question: How fast should ρtend to one, as the SNR tends to infinity, so that relay selection does not experience any diversity loss?

cs.IT↗

arXiv2011

Protocols for Relay-Assisted Free-Space Optical Systems

We investigate transmission protocols for relay-assisted free-space optical (FSO) systems, when multiple parallel relays are employed and there is no direct link between the source and the destination. As alternatives to all-active FSO relaying, where all the available relays transmit concurrently, we propose schemes that select only a single relay to participate in the communication between the source and the destination in each transmission slot. This selection is based on the channel state information (CSI) obtained either from all or from some of the FSO links. Thus, the need for synchronizing the relays' transmissions is avoided and the slowly varying nature of the atmospheric channel is exploited. For both relay selection and all-active relaying, novel closed-form expressions for their outage performance are derived, assuming the versatile Gamma-Gamma channel model. Furthermore, based on the derived analytical results, the problem of allocating the optical power resources to the FSO links is addressed, and optimum and suboptimum solutions are proposed. Numerical results are provided for equal and non-equal length FSO links, which illustrate the outage behavior of the considered relaying protocols and demonstrate the significant performance gains offered by the proposed power allocation schemes.

cs.IT↗

arXiv2011

Buffers Improve the Performance of Relay Selection

We show that the performance of relay selection can be improved by employing relays with buffers. Under the idealized assumption that no buffer is full or empty, the best source-relay and the best relay-destination channels can be simultaneously exploited by selecting the corresponding relays for reception and transmission, respectively. The resulting relay selection scheme is referred to as max-max relay selection (MMRS). Since for finite buffer sizes, empty and full buffers are practically unavoidable if MMRS is employed, we propose a hybrid relay selection (HRS) scheme, which is a combination of conventional best relay selection (BRS) and MMRS. We analyze the outage probabilities of MMRS and HRS and show that both schemes achieve the same diversity gain as conventional BRS and a superior coding gain. Furthermore, our results show that for moderate buffer sizes (e.g. 30 packets) HRS closely approaches the performance of idealized MMRS and the performance gain compared to BRS approaches 3 dB as the number of relays increases.

cs.IT↗

arXiv2009

Selective Cooperative Relaying over Time-Varying Channels

In selective cooperative relaying only a single relay out of the set of available relays is activated, hence the available power and bandwidth resources are efficiently utilized. However, implementing selective cooperative relaying in time-varying channels may cause frequent relay switchings that deteriorate the overall performance. In this paper, we study the rate at which a relay switching occurs in selective cooperative relaying applications in time-varying fading channels. In particular, we derive closed-form expressions for the relay switching rate (measured in Hz) for opportunistic relaying (OR) and distributed switch and stay combining (DSSC). Additionally, expressions for the average relay activation time for both of the considered schemes are also provided, reflecting the average time that a selected relay remains active until a switching occurs. Numerical results manifest that DSSC yields considerably lower relay switching rates than OR, along with larger average relay activation times, rendering it a better candidate for implementation of relay selection in fast fading environments.

cs.IT↗

arXiv2009

Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of Network Coding

A common assumption in the existing network coding literature is that the users are cooperative and non-selfish. However, this assumption can be violated in practice. In this paper, we analyze inter-session network coding in a wired network using game theory. We assume selfish users acting strategically to maximize their own utility, leading to a resource allocation game among users. In particular, we study the well-known butterfly network topology where a bottleneck link is shared by several network coding and routing flows. We prove the existence of a Nash equilibrium for a wide range of utility functions. We show that the number of Nash equilibria can be large (even infinite) for certain choices of system parameters. This is in sharp contrast to a similar game setting with traditional packet forwarding where the Nash equilibrium is always unique. We then characterize the worst-case efficiency bounds, i.e., the Price-of-Anarchy (PoA), compared to an optimal and cooperative network design. We show that by using a novel discriminatory pricing scheme which charges encoded and forwarded packets differently, we can improve the PoA. However, regardless of the discriminatory pricing scheme being used, the PoA is still worse than for the case when network coding is not applied. This implies that, although inter-session network coding can improve performance compared to ordinary routing, it is significantly more sensitive to users' strategic behaviour. For example, in a butterfly network where the side links have zero cost, the efficiency can be as low as 25%. If the side links have non-zero cost, then the efficiency can further reduce to only 20%. These results generalize the well-known result of guaranteed 67% worst-case efficiency for traditional packet forwarding networks.

cs.IT↗

arXiv2006

Error Rate Analysis for Coded Multicarrier Systems over Quasi-Static Fading Channels

Several recent standards such as IEEE 802.11a/g, IEEE 802.16, and ECMA Multiband Orthogonal Frequency Division Multiplexing (MB-OFDM) for high data-rate Ultra-Wideband (UWB), employ bit-interleaved convolutionally-coded multicarrier modulation over quasi-static fading channels. Motivated by the lack of appropriate error rate analysis techniques for this popular type of system and channel model, we present two novel analytical methods for bit error rate (BER) estimation of coded multicarrier systems operating over frequency-selective quasi-static channels with non-ideal interleaving. In the first method, the approximate performance of the system is calculated for each realization of the channel, which is suitable for obtaining the outage BER performance (a common performance measure for e.g. MB-OFDM systems). The second method assumes Rayleigh distributed frequency-domain subcarrier channel gains and knowledge of their correlation matrix, and can be used to directly obtain the average BER performance. Both methods are applicable to convolutionally-coded interleaved multicarrier systems employing Quadrature Amplitude Modulation (QAM), and are also able to account for narrowband interference (modeled as a sum of tone interferers). To illustrate the application of the proposed analysis, both methods are used to study the performance of a tone-interference-impaired MB-OFDM system.

cs.IT↗