Searcharxiv⌕ Search

arXiv subjects

Hirley Alves

Publications and source records attributed to Hirley Alves.

At least 109 records · Page 6Linked to original sources

Performance of Non-orthogonal Multiple Access under Finite Blocklength

In this paper, we present a finite-block-length comparison between the orthogonal multiple access (OMA) scheme and the non-orthogonal multiple access (NOMA) for the uplink channel. First, we consider the Gaussian channel, and derive the closed form expressions for the rate and outage probability. Then, we extend our results to the quasi-static Rayleigh fading channel. Our analysis is based on the recent results on the characterization of the maximum coding rate at finite block-length and finite block-error probability. The overall system throughput is evaluated as a function of the number of information bits, channel uses and power. We find what would be the respective values of these different parameters that would enable throughput maximization. Furthermore, we analyze the system performance in terms of reliability and throughput when applying the type-I ARQ protocol with limited number of retransmissions. The throughput and outage probability are evaluated for different blocklengths and number of information bits. Our analysis reveals that there is a trade-off between reliability and throughput in the ARQ. While increasing the number of retransmissions boosts reliability by minimizing the probability of reception error, it results in more delay which decreases the throughput. Nevertheless, the results show that NOMA always outperforms OMA in terms of throughput, reliability and latency regardless of the users priority or the number of retransmissions in both Gaussian and fading channels.

cs.IT↗

Effective Capacity and Power Allocation for Machine-Type Communication

Effective capacity (EC) determines the maximum communication rate subject to a particular delay constraint. In this work, we analyze the EC of ultra reliable Machine Type Communication (MTC) networks operating in the finite blocklength (FB) regime. First, we present a closed form approximation for EC in quasi-static Rayleigh fading channels. Our analysis determines the upper bounds for EC and delay constraint when varying transmission power. Finally, we characterize the power-delay trade-off for fixed EC and propose an optimum power allocation scheme which exploits the asymptotic behavior of EC in the high SNR regime. The results illustrate that the proposed scheme provides significant power saving with a negligible loss in EC.

cs.IT↗

Energy Internet via Packetized Management: Enabling Technologies and Deployment Challenges

This paper investigates the possibility of building the Energy Internet via a packetized management of non-industrial loads. The proposed solution is based on the cyber-physical implementation of energy packets where flexible loads send use requests to an energy server. Based on the existing literature, we explain how and why this approach could scale up to interconnected micro-grids, also pointing out the challenges involved in relation to the physical deployment of electricity network. We then assess how machine-type wireless communications, as part of 5G and beyond systems, will achieve the low latency and ultra reliability needed by the micro-grid protection while providing the massive coverage needed by the packetized management. This more distributed grid organization also requires localized governance models. We cite few existing examples as local markets, energy communities and micro-operator that support such novel arrangements. We close the paper by providing an overview of ongoing activities that support the proposed vision and possible ways to move forward.

eess.SY↗

Performance Analysis of Ultra-Reliable Short Message Decode and Forward Relaying Protocols

Machine-Type Communication (MTC) is a rapidly growing technology which covers a broad range of automated applications and propels the world into a fully connected society. Two new use cases of MTC are mMTC and URLLC, where mMTC support a large number of devices with high reliability and low rate connectivity while URLLC refers to excessively low outage probability under very stringent latency constraint. Herein, we examine the URLLC through three cooperative schemes, namely dual-hop DF, SC and MRC, and compare to direct transmission under Rayleigh fading. We compare the performance of studied cooperative protocols under two distinct power constraints with respect to latency and energy efficiency. Moreover, we illustrate the impact of coding rate on the probability of successful transmission in ultra-reliable region in addition to the effect of power allocation on the outage probability. We also provide the performance analysis of cooperative schemes in terms of energy efficiency and latency requirements.

cs.IT↗

Optimum Transmission Rate in Fading Channels with Markovian Sources and QoS Constraints

This paper evaluates the performance of reliability and latency in machine type communication networks, which composed of single transmitter and receiver in the presence of Rayleigh fading channel. The source's traffic arrivals are modeled as Markovian processes namely Discrete-Time Markov process, Fluid Markov process, and Markov Modulated Poisson process, and delay/buffer overflow constraints are imposed. Our approach is based on the reliability and latency outage probability, where transmitter not knowing the channel condition, therefore the transmitter would be transmitting information over the fixed rate. The fixed rate transmission is modeled as a two state Discrete time Markov process, which identifies the reliability level of wireless transmission. Using effective bandwidth and effective capacity theories, we evaluate the trade-off between reliability-latency and identify QoS requirement. The impact of different source traffic originated from MTC devices under QoS constraints on the effective transmission rate are investigated.

cs.IT↗

Statistical QoS provisioning for MTC Networks under Finite Blocklength

This paper analyzes the effective capacity of delay constrained machine type communication (MTC) networks operating in the finite blocklength regime. First, we derive a closed-form mathematical approximation for the effective capacity in quasi-static Rayleigh fading channels. We characterize the optimum error probability to maximize the concave effective capacity function with reliability constraint and study the effect of signal-to-interference-plus-noise ratio (SINR) variations for different delay constraints. The trade off between reliability and effective capacity maximization reveals that we can achieve higher reliability with limited sacrifice in effective capacity specially when the number of machines is small. Our analysis reveals that SINR variations have less impact on effective capacity for strict delay constrained networks. We present an exemplary scenario for massive MTC access to analyze the interference effect proposing three methods to restore the effective capacity for a certain node which are power control, graceful degradation of delay constraint and joint compensation. Joint compensation combines both power control and graceful degradation of delay constraint, where we perform maximization of an objective function whose parameters are determined according to delay and SINR priorities. Our results show that networks with stringent delay constraints favor power controlled compensation and compensation is generally performed at higher costs for shorter packets.

cs.IT↗

Rate Control under Finite Blocklength for Downlink Cellular Networks with Reliability Constraints

Coming cellular systems are envisioned to open up to new services and applications with high reliability and low latency requirements. In this paper we focus on the rate allocation problem in downlink cellular networks with Rayleigh fading and stringent reliability constraints. We propose a rate control strategy to cope with those requirements making use only of topological characteristics of the scenario, the reliability constraint and the number of antennas that are available at the receiver side. Numerical results show the feasibility of the ultra-reliable operation when the number of antennas increases, and also that our results remain valid even when operating at short blocklength as far as the amount of information to be transmitted is not too small.

cs.NI↗

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↗

Aggregation and Resource Scheduling in Machine-type Communication Networks: A Stochastic Geometry Approach

Data aggregation is a promising approach to enable massive machine-type communication (mMTC). This paper focuses on the aggregation phase where a massive number of machine-type devices (MTDs) transmit to aggregators. By using non-orthogonal multiple access (NOMA) principles, we allow several MTDs to share the same orthogonal channel in our proposed hybrid access scheme. We develop an analytical framework based on stochastic geometry to investigate the system performance in terms of average success probability and average number of simultaneously served MTDs, under imperfect successive interference cancellation (SIC) at the aggregators, for two scheduling schemes: random resource scheduling (RRS) and channel-aware resource scheduling (CRS). We identify the power constraints on the MTDs sharing the same channel to attain a fair coexistence with purely orthogonal multiple access (OMA) setups, then power control coefficients are found so that these MTDs perform with similar reliability. We show that under high access demand, the hybrid scheme with CRS outperforms the OMA setup by simultaneously serving more MTDs with reduced power consumption.

cs.IT↗

Energy Efficiency of an Unlicensed Wireless Network in the Presence of Retransmissions

This paper analysis the energy efficiency of an unlicensed wireless network in which retransmission is possible if the transmitted message is decoded in outage. A wireless sensor network is considered in which the sensor nodes are unlicensed users of a wireless network which transmit its data in the uplink channel used by the licensed users. Poisson point process is used to model the distributions of the nodes and the interference caused by the licensed users for the sensor nodes. After finding the optimal throughput in the presence of retransmissions, we focus on analyzing the total power consumption and energy efficiency of the network and how retransmissions, network density and outage threshold affects the energy efficiency of the network.

cs.IT↗

Increasing the Throughput of an Unlicensed Wireless Network through Retransmissions

This paper analyzes the throughput of an unlicensed wireless network where messages decoded in outage may be retransmitted. We assume that some wireless devices such as sensors are the unlicensed users, which communicate in the licensed uplink channel. In this case, the licensed users that interfere with the unlicensed transmissions devices are mobile devices whose spatial distribution are assumed to follow a Poisson point process with respect to a reference unlicensed link. We investigate how the number of allowed retransmissions and the spectrum efficiency jointly affect the throughput in [bits/s/Hz] of a reference unlicensed link for different licensed network densities, constrained by a given required error rate. The optimal throughput is derived for this case as a function of the network density. We also prove that the optimal constrained throughput can always reach the unconstrained optimal value. Our numerical results corroborate those of the analytical findings, also illustrating how the number of allowed retransmissions that leads to the optimal throughput changes with the error rate requirements.

cs.IT↗

Long-range Low-power Wireless Networks and Sampling Strategies in Electricity Metering

This paper studies a specific low-power wireless technology capable of reaching a long range, namely LoRa. Such a technology can be used by different applications in cities involving many transmitting devices while requiring loose communication constrains. We focus on electricity grids, where LoRa end-devices are smart-meters that send the average power demanded by their respective households during a given period. The successfully decoded data by the LoRa gateway are used by an aggregator to reconstruct the daily households' profiles. We show how the interference from concurrent transmissions from both LoRa and non-LoRa devices negatively affect the communication outage probability and the link effective bit-rate. Besides, we use actual electricity consumption data to compare time-based and event-based sampling strategies, showing the advantages of the latter. We then employ this analysis to assess the gateway range that achieves an average outage probability that leads to a signal reconstruction with a given requirement. We also discuss that, although the proposed analysis focuses on electricity metering, it can be easily extended to any other smart city application with similar requirements, like water metering or traffic monitoring.

eess.SP↗

Event-based Electricity Metering: An Autonomous Method to Determine Transmission Thresholds

This paper provides an in-depth analysis of the event-based metering strategy proposed by Simonov et al. This strategy is an alternative to the traditional periodic (time-based) metering where the power demand is averaged in fixed time periods (e.g. every 15 minutes). The event-based approach considers two thresholds that trigger an event, one related to the (instantaneous) power demanded, other to the accumulated energy consumed. The original work assumed these thresholds fixed for the measurements. Our present contribution relaxes this assumption by proposing a method to set the thresholds from the percentage of the peak power consumption over the period under analysis. This approach, in contrast to the time-based and the fixed thresholds, better captures the actual power demanded when different households with diverse power demand profiles are studied. In this sense, our method provides a more efficient way to store electricity demand data while maintaining the estimation error (in relation to the real-time power demand) under acceptable values. Numerical examples are presented to illustrate the advantage and possible drawbacks of the proposed method.

eess.SY↗

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↗

Demand Control Management in Micro-grids: The Impact of Different Policies and Communication Network Topologies

This work studies how the communication network between proactive consumers affects the power utilization and fairness in a simplified direct-current micro-grid model, composed by three coupled layers: physical (an electric circuit that represents a micro-grid), communication (a peer-to-peer network within the micro-grid) and regulatory (individual decision strategies). Our results show that, for optimal power utilization and fairness, a global knowledge about the system is needed, demonstrating the importance of a micro-grid aggregator to inform about the power consumption for different time periods.

cs.MA↗

Ultra Reliable Communication via Opportunistic ARQ Transmission in Cognitive Networks

This paper presents a novel opportunistic spectrum sharing scheme that applies ARQ protocol to achieve ultra reliability in the finite blocklength regime. A primary user shares its licensed spectrum to a secondary user, where both communicate to the same base station. The base station applies ARQ with the secondary user, which possess a limited number of trials to transmit each packet. We resort to the interweave model in which the secondary user senses the primary user activity and accesses the channel with access probabilities which depend on the primary user arrival rate and the number of available trials. We characterize the secondary user access probabilities and transmit power in order to achieve target error constraints for both users. Furthermore, we analyze the primary user performance in terms of outage probability and delay. The results show that our proposed scheme outperforms the open loop and non-opportunistic scenarios in terms of secondary user transmit power saving and primary user reliability.

cs.IT↗

On the Effective Energy Efficiency of Ultra-reliable Networks in the Finite Blocklength Regime

Effective Capacity (EC) indicates the maximum communication rate subject to a certain delay constraint while effective energy efficiency (EEE) denotes the ratio between EC and power consumption. In this paper, we analyze the EEE of ultra-reliable networks operating in the finite blocklength regime. We obtain a closed form approximation for the EEE in Rayleigh block fading channels as a function of power, error probability, and delay. We show the optimum power allocation strategy for maximizing the EEE in finite blocklength transmission which reveals that Shannon's model underestimates the optimum power when compared to the exact finite blocklength model. Furthermore, we characterize the buffer constrained EEE maximization problem for different power consumption models. The results show that accounting for empty buffer probability (EBP) and extending the maximum delay tolerance jointly enhance the EC and EEE.

cs.IT↗

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↗