Sorry, you need to enable JavaScript to visit this website.

Dual-polarized (DP) faster-than-Nyquist (FTN) transmission using higher-order modulation (HoM) schemes can significantly increase the spectral efficiency (SE) of the existing wireless backhaul links. However, FTN transmissions introduce inter-symbol interference (ISI), antenna polarization multiplexing suffers from cross-polarization interference (XPI) and HoM makes a communication system vulnerable to phase noise (PN) distortions.

This paper studies a multi-source “age of information”
problem in multi-hop wireless networks with packetized
status updates and explicit channel contention. Specifically, the
scenario considered in this paper assumes that each node in the
network is a both a source and a monitor of information. Nodes
take turns broadcasting their information to other nodes in the
network while also maintaining tables of status updates for the
information received from all other nodes in the network. Lower

Age of Information (AoI), measures the time elapsed since the last received information packet was generated at the source. We consider the problem of AoI minimization for single-hop flows in a wireless network, under pairwise interference constraints and time varying channel. We consider simple, yet broad, class of distributed scheduling policies, in which a transmission is attempted over each link with a certain attempt probability. We obtain an interesting relation between the optimal attempt probability and the optimal AoI of the link, and its neighboring links.

Public Safety Networks (PSN) are expected to provide resilient communication paradigms under disaster recovery scenarios. Towards providing an energy efficient solution an UAV-supported multi-level architecture is employed where user equipments (UEs) are grouped together in clusters.

In this work, we consider multi-group multicast transmissions with different types of service messages in an overloaded multicarrier system, where the number of transmitter antennas is insufficient to mitigate all inter-group interference. We show that employing a rate-splitting based multiuser beamforming approach enables a simultaneous delivery of the multiple service messages over the same time-frequency resources in a non-orthogonal fashion.

In this paper, distributed learning is studied using the approach of coreset. In the context of classification, an algorithm of coreset construction is proposed to reduce the redundancy of data and thus the communication requirement, similarly to source coding in traditional data communications. It is shown that the coreset based boosting has a high convergence rate and small sample complexity. Moreover, it is robust to adversary distribution, thus leading to potential applications in distributed learning systems.