Localization is a key feature of future Sixth Generation (6G) networks with foreseen accuracy requirements down to the millimeter level, to enable novel applications in the fields of telesurgery, high-precision manufacturing, and others. Currently, such accuracy requirements are only achievable with specialized or highly resource-demanding systems, rendering them impractical for more wide-spread deployment. In this paper, we present the first system that enables low-complexity and low-bandwidth absolute 3D localization with millimeter-level accuracy in generic wireless networks. It performs a carrier phase-based wireless localization refinement of an initial location estimate based on successive location-likelihood optimization across multiple bands. Unlike previous phase unwrapping methods, our solution is one-shot. We evaluate its performance collecting ∼ 350, 000 measurements, showing an improvement of more than one order of magnitude over classical localization techniques. Finally, we will open-source the low-cost, modular FR3 front-end that we developed for the experimental campaign.

This paper discusses the geometrical features and wideband performance of the beam with maximal ratio combining coefficients for a generic multi-antenna receiver. In particular, in case the channel is a linear combination of plane waves, we show that such a beam can be decomposed in a linear combination of beams pointed in the direction of each plane wave, and we compute how many directions can be effectively utilized. This highlights that such a beam is better exploiting the spatial diversity provided by the channel, and therefore it is expected to be more robust to disruptions. Moreover, we compute the achieved Signal-to-Noise-Ratio for a wideband receiver, showing that it is wthin 2dB of the one of other methods. Finally, we provide some insights on the robustness of the method by simulating the impact of the blockage of one multipath components.

The evolution of 5G and Beyond networks has enabled new applications with stringent end-to-end latency requirements, but providing reliable low-latency service with high throughput over public wireless networks is still a significant challenge. One of the possible ways to solve this is to exploit path diversity, encoding the information flow over multiple streams across parallel links. The challenge presented by this approach is the design of joint coding and scheduling algorithms that adapt to the state of links to take full advantage of path diversity. In this paper, we address this problem for a synchronous traffic source that generates data blocks at regular time intervals (e.g., a video with constant frame rate) and needs to deliver each block within a predetermined deadline. We first develop a closed-form performance analysis in the simple case of two parallel servers without any buffering and single-packet blocks, and propose a model for the general problem based on a Markov Decision Process (MDP). We apply policy iteration to obtain the coding and scheduling policy that maximizes the fraction of source blocks delivered within the deadline: our simulations show the drawbacks of different commonly applied heuristic solutions, drawing general design insights on the optimal policy.

This paper presents a spectrum-edge detection algorithm for initial cell-search in Long-Term Evolution (LTE) wireless networks. The algorithm consists of three steps. First, we roughly identify possible edges in the spectrum. Then, we confirm these “candidate” edges by means of a threshold on the local average spectrum. Finally, the center frequency is precisely determined by searching a pair of edges located at a distance approximately equal to a possible bandwidth of the LTE transmission. Based on tests with field signals, the proposed algorithm is much faster than the conventional sequential cell-search algorithm, where the signal is demodulated for a candidate center frequency and minimum bandwidth: if demodulation is not successful a new candidate center frequency is tried.