In this paper, we consider a wireless-powered cooperative communication network consisting of one hybrid access-point (AP), one source, and one relay. In contrast to conventional cooperative networks, the source and relay in the considered network have no embedded energy supply. They need to rely on the energy harvested from the signals broadcasted by the AP for their cooperative information transmission. Based on this three-node reference model, we propose a harvest-then-cooperate (HTC) protocol, in which the source and relay harvest energy from the AP in the downlink and work cooperatively in the uplink for the source's information transmission. Considering a delay-limited transmission mode, the approximate closed-form expression for the average throughput of the proposed protocol is derived over Rayleigh fading channels. Subsequently, this analysis is extended to the multi-relay scenario, where the approximate throughput of the HTC protocol with two popular relay selection schemes is derived. The asymptotic analyses for the throughput performance of the considered schemes at high signal-to-noise radio are also provided. All theoretical results are validated by numerical simulations. The impacts of the system parameters, such as time allocation, relay number, and relay position, on the throughput performance are extensively investigated.
4 November 2011 in IEEE Transactions on Signal Processing
In this paper, we propose and analyze a generalized construction of distributed network codes for a network consisting of M users sending independent information to a common base station through independent block fading channels. The aim is to increase the diversity order of the system without reducing its throughput. The proposed scheme, called generalized dynamic-network codes (GDNC), is a generalization of the dynamic-network codes (DNC) recently proposed by Xiao and Skoglund. The design of the network codes that maximize the diversity order is recognized as equivalent to the design of linear block codes over a nonbinary finite field under the Hamming metric. We prove that adopting a systematic generator matrix of a maximum distance separable block code over a sufficiently large finite field as the network transfer matrix is a sufficient condition for full diversity order under link failure model. The proposed generalization offers a much better tradeoff between rate and diversity order compared to the DNC. An outage probability analysis showing the improved performance is carried out, and computer simulations results are shown to agree with the analytical results.
This work considers the problem of radio resource sharing between enhanced mobile broadband (eMBB) and ultra-reliable and low latency communications (URLLC), two heterogeneous 5G services. More specifically, we propose the use of a max-matching diversity (MMD) algorithm to properly allocate the channels to the eMBB users, considering both heterogeneous orthogonal multiple access (H-OMA) and heterogeneous non-orthogonal multiple access (H-NOMA) network slicing strategies. Our results indicate that MMD can simultaneously improve the eMBB achievable rate and the URLLC reliability regardless the network slicing strategy adopted.
5 August 2014 in IEEE Transactions on Signal Processing
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.
Age of Information (AoI) has turned to be an outright metric to evaluate information freshness in Internet of Things (IoT) networks. In this work, we evaluate the average AoI of an uplink IoT monitoring network where multiple end devices have independent status updates to transmit to a common access point (AP). More specifically, we propose the so-called successive interference cancellation (SIC)-aided age-independent random access (AIRA-SIC) scheme, where the AP performs SIC aiming at recovering collisions of multiple packets that are transmitted simultaneously by different devices in a slotted ALOHA fashion. Our results show that the proposed scheme not only achieves considerably lower AoI levels than the standard AIRA but also outperforms a recently proposed threshold-based age-dependent random access (ADRA) scheme, where the channel access probability (CAP) of each device is dynamically adapted based on each devices’ AoI. Finally, we provide some insights on the optimal CAP that minimizes the network average AoI, as well on the influence of imperfect channel state information (CSI) in the performance of the proposed scheme.
In this paper, we investigate the problem of heterogeneous service coexistence in the scope of 5G and beyond (B5G) networks, where multiple ultra-reliable low-latency communication (URLLC) and enhanced mobile broadband (eMBB) users are connected to a common base station (BS), sharing physical network resources. In contrast to the orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) usually adopted in literature, in this work we employ rate splitting multiple access (RSMA) for URLLC transmission, where a URLLC device splits its message into two sub-messages with partial transmission power, which are potentially recovered at the BS by means of successive interference cancellation (SIC). To study the performance of such methods in the presence of eMBB users, we consider both orthogonal and non-orthogonal network slicing approaches to share the network resources between heterogeneous user profiles with diverse requirements. As a result, we show that, in general, RSMA presents an improved performance in terms of sum-rate and reliability, even when transmitting concurrently with eMBB users. Finally, our results also show that the URLLC sum-rate can be increased by properly adjusting the rate splitting factor based on the average signal-to-noise ratio (SNR), not being necessary instantaneous channel state information (CSI).