arXiv subjects

Nuno K. Pratas

Publications and source records attributed to Nuno K. Pratas.

24 records · Page 2Linked to original sources

arXiv2015

Aggregation and Trunking of M2M Traffic via D2D Connections

Machine-to-Machine (M2M) communications is one of the key enablers of the Internet of Things (IoT). Billions of devices are expected to be deployed in the next future for novel M2M applications demanding ubiquitous access and global connectivity. In order to cope with the massive number of machines, there is a need for new techniques to coordinate the access and allocate the resources. Although the majority of the proposed solutions are focused on the adaptation of the traditional cellular networks to the M2M traffic patterns, novel approaches based on the direct communication among nearby devices may represent an effective way to avoid access congestion and cell overload. In this paper, we propose a new strategy inspired by the classical Trunked Radio Systems (TRS), exploiting the Device-to-Device (D2D) connectivity between cellular users and Machine-Type Devices (MTDs). The aggregation of the locally generated packets is performed by a user device, which aggregates the machine-type data, supplements it with its own data and transmits all of them to the Base Station. We observe a fundamental trade-off between latency and the transmit power needed to deliver the aggregate traffic, in a sense that lower latency requires increase in the transmit power.

cs.NI↗

arXiv2014

Zero-Outage Cellular Downlink with Fixed-Rate D2D Underlay

Two of the emerging trends in wireless cellular systems are Device-to-Device (D2D) and Machine-to-Machine (M2M) communications. D2D enables efficient reuse of the licensed spectrum to support localized transmissions, while M2M connections are often characterized by fixed and low transmission rates. D2D connections can be instrumental in localized aggregation of uplink M2M traffic to a more capable cellular device, before being finally delivered to the Base Station (BS). In this paper we show that a fixed M2M rate is an enabler of efficient Machine-Type D2D underlay operation taking place simultaneously with another \emph{downlink} cellular transmission. In the considered scenario, a BS $B$ transmits to a user $U$, while there are $N_M$ Machine-Type Devices (MTDs) attached to $U$, all sending simultaneously to $U$ and each using the same rate $R_M$. While assuming that $B$ knows the channel $B-U$, but not the interfering channels from the MTDs to $U$, we prove that there is a positive downlink rate that can always be decoded by $U$, leading to zero-outage of the downlink signal. This is a rather surprising consequence of the features of the multiple access channel and the fixed rate $R_M$. We also consider the case of a simpler, single-user decoder at $U$ with successive interference cancellation. However, with single-user decoder, a positive zero-outage rate exists only when $N_M=1$ and is zero when $N_M>1$. This implies that joint decoding is instrumental in enabling fixed-rate underlay operation.

cs.IT↗

arXiv2013

Analysis of the LTE Access Reservation Protocol for Real-Time Traffic

LTE is increasingly seen as a system for serving real-time Machine-to-Machine (M2M) communication needs. The asynchronous M2M user access in LTE is obtained through a two-phase access reservation protocol (contention and data phase). Existing analysis related to these protocols is based on the following assumptions: (1) there are sufficient resources in the data phase for all detected contention tokens, and (2) the base station is able to detect collisions, i.e., tokens activated by multiple users. These assumptions are not always applicable to LTE - specifically, (1) due to the variable amount of available data resources caused by variable load, and (2) detection of collisions in contention phase may not be possible. All of this affects transmission of real-time M2M traffic, where data packets have to be sent within a deadline and may have only one contention opportunity. We analyze the features of the two-phase LTE reservation protocol and derive its throughput, i.e., the number of successful transmissions in the data phase, when assumptions (1) and (2) do not hold.

cs.IT↗

arXiv2013

Low-Rate Machine-Type Communication via Wireless Device-to-Device (D2D) Links

Wireless cellular networks feature two emerging technological trends. The first is the direct Device-to-Device (D2D) communications, which enables direct links between the wireless devices that reutilize the cellular spectrum and radio interface. The second is that of Machine-Type Communications (MTC), where the objective is to attach a large number of low-rate low-power devices, termed Machine-Type Devices (MTDs) to the cellular network. MTDs pose new challenges to the cellular network, one if which is that the low transmission power can lead to outage problems for the cell-edge devices. Another issue imminent to MTC is the \emph{massive access} that can lead to overload of the radio interface. In this paper we explore the opportunity opened by D2D links for supporting MTDs, since it can be desirable to carry the MTC traffic not through direct links to a Base Station, but through a nearby relay. MTC is modeled as a fixed-rate traffic with an outage requirement. We propose two network-assisted D2D schemes that enable the cooperation between MTDs and standard cellular devices, thereby meeting the MTC outage requirements while maximizing the rate of the broadband services for the other devices. The proposed schemes apply the principles Opportunistic Interference Cancellation and the Cognitive Radio's underlaying. We show through analysis and numerical results the gains of the proposed schemes.

cs.IT↗

arXiv2012

Joint Estimation and Contention-Resolution Protocol for Wireless Random Access

We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation of the number of users and resolution of their transmissions. The users independently access the wireless link on a slot basis with a predefined probability, resulting in a distribution of user transmissions over slots, based on which the estimation and contention resolution are performed. Specifically, the contention resolution is performed using successive interference cancellation which, coupled with the use of the optimized access probabilities, enables throughputs that are substantially higher than the traditional slotted ALOHA-like protocols. The key feature of the proposed protocol is that the round durations are not a priori set and they are terminated when the estimation/contention-resolution performance reach the satisfactory levels.

cs.IT↗

arXiv2012

Code-Expanded Random Access for Machine-Type Communications

The random access methods used for support of machine-type communications (MTC) in current cellular standards are derivatives of traditional framed slotted ALOHA and therefore do not support high user loads efficiently. Motivated by the random access method employed in LTE, we propose a novel approach that is able to sustain a wide random access load range, while preserving the physical layer unchanged and incurring minor changes in the medium access control layer. The proposed scheme increases the amount of available contention resources, without resorting to the increase of system resources, such as contention sub-frames and preambles. This increase is accomplished by expanding the contention space to the code domain, through the creation of random access codewords. Specifically, in the proposed scheme, users perform random access by transmitting one or none of the available LTE orthogonal preambles in multiple random access sub-frames, thus creating access codewords that are used for contention. In this way, for the same number of random access sub-frames and orthogonal preambles, the amount of available contention resources is drastically increased, enabling the support of an increased number of MTC users. We present the framework and analysis of the proposed code-expanded random access method and show that our approach supports load regions that are beyond the reach of current systems.

cs.IT↗