arXiv subjects

Richard Demo Souza

Publications and source records attributed to Richard Demo Souza.

50 records · Page 3Linked to original sources

arXiv2019

Statistical Analysis of Multiple Antenna Strategies for Wireless Energy Transfer

Wireless Energy Transfer (WET) is emerging as a potential solution for powering small energy-efficient devices. We propose strategies that use multiple antennas at a power station, which wirelessly charges a large set of single-antenna devices. Proposed strategies operate without Channel State Information (CSI) and we attain the distribution and main statistics of the harvested energy under Rician fading channels with sensitivity and saturation energy harvesting (EH) impairments. A switching antenna strategy, where a single antenna with full power transmits at a time, provides the most predictable energy source, and it is particularly suitable for powering sensor nodes with highly sensitive EH hardware operating under non-LOS (NLOS) conditions; while other WET schemes perform alike or better in terms of the average harvested energy. Under NLOS switching antennas is the best, while when LOS increases transmitting simultaneously with equal power in all antennas is the most beneficial. Moreover, spatial correlation is not beneficial unless the power station transmits simultaneously through all antennas, raising a trade-off between average and variance of the harvested energy since both metrics increase with the spatial correlation. Moreover, the performance gap between CSI-free and CSI-based strategies decreases quickly as the number of devices increases.

cs.IT↗

arXiv2019

In-Band Pilot Overhead in Ultra-Reliable Low Latency Decode and Forward Relaying

In URLLC the performance of short message communications highly depends on the training sequence length due to the stringent latency and reliability requirements. In this paper, we study the performance of cooperative and non-cooperative transmissions under imperfect channel estimation and Rayleigh fading for URLLC. We assume a peak power constraint on pilot symbols in addition to the average power constraint which is used for comparison purposes. We obtain the optimal training length as a function of blocklength and power constraint factor to meet the URLLC requirements. Moreover, the simulation results show the impact of pilot overhead on reliability, latency, and goodput of cooperative communications compared to pointto-point transmission

cs.IT↗

arXiv2018

Finite Blocklength Communications in Smart Grids for Dynamic Spectrum Access and Locally Licensed Scenarios

This work focuses on the performance analysis of short blocklength communication with application in smart grids. We use stochastic geometry to compute in closed form the success probability of a typical message transmission as a function of its size (i.e. blocklength), the number of information bits and the density of interferers. Two different scenarios are investigated: (i) dynamic spectrum access where the licensed and unlicensed users, share the uplink channel frequency band and (ii) local licensing approach using the so called micro operator, which holds an exclusive license of its own. Approximated outage probability expression is derived for the dynamic spectrum access scenario, while a closed-form solution is attained for the micro-operator. The analysis also incorporates the use of retransmissions when messages are detected in error. Our numerical results show how reliability and delay are related in either scenarios.

cs.IT↗

arXiv2018

Maximum Secrecy Throughput of MIMOME FSO Communications with Outage Constraints

In this work, we consider a scenario where two multiple-aperture legitimate nodes (Alice and Bob) communicate by means of Free-Space Optical (FSO) communication in the presence of a multiple-aperture eavesdropper (Eve), which is subject to pointing errors. Two different schemes are considered depending on the availability of channel state information (CSI) at Alice: i) the adaptive scheme, where Alice possesses the instantaneous CSI with respect to Bob; ii) the fixed-rate scheme, where such information is not available at Alice. The performance of the aforementioned schemes is evaluated in terms of a recently proposed metric named effective secrecy throughput (EST), which encompasses both the reliability and secrecy constraints. By constraining the system to operate below a given maximum allowed secrecy outage probability, we evaluate the EST analytically and through numerical results, showing that the use of multiple apertures at Alice is very important towards achieving the optimal EST.

cs.IT↗

arXiv2018

Hybrid Wired-Wireless Backhaul Solutions for Heterogeneous Ultra-Dense Networks

Wireless networks are becoming extremely pervasive while traffic demand is ever increasing. In order to cope with the forecast increase in traffic volume for the upcoming years, as well as the number of connected devices, new technologies, practices and spectrum rearrangements are required. In this context, a key question arises: how to provide extensive backhaul connectivity and capacity for pervasive ultra dense networks? The answer is rather complex, if feasible. To shed some light into this issue we overview potential technologies, either wired or wireless, and identify technical challenges. Moreover, we evaluate an illustrative scenario of a ultra-dense network that operates with hybrid wired-wireless backhaul. We assume multiple radio access technologies at small and macro base stations (BSs), and we discuss optimal traffic splitting and routing solutions for different topologies and traffic profiles.

cs.NI↗

arXiv2018

Ultra-Reliable Short Message Cooperative Relaying Protocols under Nakagami-m Fading

In the next few years, the development of wireless communication systems propel the world into a fully connected society where the Machine-type Communications (MTC) plays a substantial role as key enabler in the future cellular systems. MTC is categorized into mMTC and uMTC, where mMTC provides the connectivity to massive number of devices while uMTC is related to low latency and ultra-high reliability of the wireless communications. This paper studies uMTC with incremental relaying technique, where the source and relay collaborate to transfer the message to a destination. In this paper, we compare the performance of two distinct cooperative relaying protocols with the direct transmission under the finite blocklength (FB) regime. We define the overall outage probability in each relaying scenario, supposing Nakagami-m fading. We show that cooperative communication outperforms direct transmission under the FB regime. In addition, we examine the impact of fading severity and power allocation factor on the outage probability and the minimum delay required to meet the ultra-reliable communication requirements. Moreover, we provide the outage probability in closed form.

cs.IT↗

arXiv2017

Comments on "Finite-SNR Diversity-Multiplexing Tradeoff for Network Coded Cooperative OFDMA Systems"

In the paper "Finite-SNR Diversity-Multiplexing Tradeoff for Network Coded Cooperative OFDMA Systems', the authors adopt a recently proposed subcarrier allocation algorithm aiming at providing optimal frequency diversity to an OFDMA-based network with network-coded cooperation (NCC), where $P$ source nodes transmit independent information to a common destination with the help of $M$ relay nodes, in a frequency-selective channel with $L$ coherence blocks. However, the analysis of the so-called NCC-OFDMA scheme proposed in the aforementioned paper assumes that the subcarrier allocation algorithm is capable of providing full frequency diversity to all the links in the network, which generally does not hold in practice since the allocation is optimal only from the perspective of a single destination. Therefore, in this note we reevaluate the outage probability of the NCC-OFDMA under a more realistic scenario where only the messages addressed to the destination are benefited with the full frequency diversity provided by the subcarrier allocation algorithm, showing that the diversity order is decreased from $L(M+1)$ to $M+L$.

cs.IT↗

arXiv2017

On the Secure Energy Efficiency of TAS/MRC with Relaying and Jamming Strategies (Extended Version)

In this paper we investigate the secure energy efficiency (SEE) in a cooperative scenario where all nodes are equipped with multiple antennas. Moreover, we employ secrecy rate and power allocation at Alice and at the relay in order to maximize the SEE, subjected to a constraint in terms of a minimal required secrecy outage probability. Only the channel state information (CSI) with respect to the legitimate nodes is available. Then, we compare the Artificial-Noise (AN) scheme with CSI-Aided Decode-and-Forward (CSI-DF), which exploits the CSI to choose the best communication path (direct or cooperative). Our results show that CSI-DF outperforms AN in terms of SEE in most scenarios, except when Eve is closer to the relay or with the increase of antennas at Eve. Additionally, we also show that the maximization of SEE implies in an optimal number of antennas to be used at each node, which is due to the trade-off between secure throughput and power consumption.

cs.CR↗

arXiv2017

Ultra-Reliable Short-Packet Communications with Wireless Energy Transfer

We analyze and optimize a wireless system with energy transfer in the downlink and information transfer in the uplink, under quasi-static Nakagami-m fading. We consider ultra-reliable communication scenarios representative of the fifth-generation of wireless systems, with strict error and latency requirements. The error probability and delay are investigated, and an approximation for the former is given and validated through simulations. The numerical results demonstrate that there are optimum numbers of channels uses for both energy and information transfer for a given message length.

cs.IT↗

arXiv2017

Ultra Reliable Short Message Relaying with Wireless Power Transfer

We consider a dual-hop wireless network where an energy constrained relay node first harvests energy through the received radio-frequency signal from the source, and then uses the harvested energy to forward the source's information to the destination node. The throughput and delay metrics are investigated for a decode-and-forward relaying mechanism at finite blocklength regime and delay-limited transmission mode. We consider ultra-reliable communication scenarios under discussion for the next fifth-generation of wireless systems, with error and latency constraints. The impact on these metrics of the blocklength, information bits, and relay position is investigated.

cs.IT↗

arXiv2014

On the Secrecy of Interference-Limited Networks under Composite Fading Channels

This paper deals with the secrecy capacity of the radio channel in interference-limited regime. We assume that interferers are uniformly scattered over the network area according to a Point Poisson Process and the channel model consists of path-loss, log-normal shadowing and Nakagami-m fading. Both the probability of non-zero secrecy capacity and the secrecy outage probability are then derived in closed-form expressions using tools of stochastic geometry and higher-order statistics. Our numerical results show how the secrecy metrics are affected by the disposition of the desired receiver, the eavesdropper and the legitimate transmitter.

cs.IT↗

arXiv2014

Time-Switching Uplink Network-Coded Cooperative Communication with Downlink Energy Transfer

In this work, we consider a multiuser cooperative wireless network where the energy-constrained sources have independent information to transmit to a common destination, which is assumed to be externally powered and responsible for transferring energy wirelessly to the sources. The source nodes may cooperate, under either decode-and-forward or network coding-based protocols. Taking into account the fact that the energy harvested by the source nodes is a function of the fading realization of inter-user channels and user-destination channels, we obtain a closed-form approximation for the system outage probability, as well as an approximation for the optimal energy transfer period that minimizes such outage probability. It is also shown that, even though the achievable diversity order is reduced due to wireless energy transfer process, it is very close to the one achieved for a network without energy constraints. Numerical results are also presented to validate the theoretical results.

cs.IT↗

arXiv2014

Secrecy Outage Probability of Network-Coded Cooperative Communication

We evaluate the secrecy performance of a multiple access cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, on the top of improving the error performance of the legitimate communication, already demonstrated in the literature. Network coding is leveraged by assuming that the legitime cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Different scenarios with and without channel state information (CSI) at the transmitter side are evaluated. The effectiveness of the proposed schemes is evaluated in terms of secrecy outage probability through theoretic and numerical analyses. It is shown that, even when the legitimate transmitters do not have any CSI, the secrecy can be increased through the use of network coding when compared to the direct transmission and traditional cooperative techniques.

cs.IT↗

arXiv2008

Overlay Cognitive Radio in Wireless Mesh Networks

In this paper we apply the concept of overlay cognitive radio to the communication between nodes in a wireless mesh network. Based on the overlay cognitive radio model, it is possible to have two concurrent transmissions in a given interference region, where usually only one communication takes place at a given time. We analyze the cases of wireless mesh networks with regular and random topologies. Numerical results show that considerable network capacity gains can be achieved.

cs.IT↗