The vision of next generation 5G wireless communications lies in providing very high data rates (typically of Gbps order), extremely low latency, manifold increase in base station capacity, and significant improvement in users’ perceived quality of service (QoS), compared to current 4G LTE networks. Ever increasing proliferation of smart devices, introduction of new emerging multimedia applications, together with an exponential rise in wireless data (multimedia) demand and usage is already creating a significant burden on existing cellular networks. 5G wireless systems, with improved data rates, capacity, latency, and QoS are expected to be the panacea of most of the current cellular networks’ problems. In this survey, we make an exhaustive review of wireless evolution toward 5G networks. We first discuss the new architectural changes associated with the radio access network (RAN) design, including air interfaces, smart antennas, cloud and heterogeneous RAN. Subsequently, we make an in-depth survey of underlying novel mm-wave physical layer technologies, encompassing new channel model estimation, directional antenna design, beamforming algorithms, and massive MIMO technologies. Next, the details of MAC layer protocols and multiplexing schemes needed to efficiently support this new physical layer are discussed. We also look into the killer applications, considered as the major driving force behind 5G. In order to understand the improved user experience, we provide highlights of new QoS, QoE, and SON features associated with the 5G evolution. For alleviating the increased network energy consumption and operating expenditure, we make a detail review on energy awareness and cost efficiency. As understanding the current status of 5G implementation is important for its eventual commercialization, we also discuss relevant field trials, drive tests, and simulation experiments. Finally, we point out major existing research issues and identify possible future research directions.

Next Generation 5G Wireless Networks: A Comprehensive Survey

Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Fundamentals of Queueing Theory

https://www.cs.montana.edu/courses/csci566/Ref/WMSN-Survey.pdf

A survey on wireless multimedia sensor networks

This article focuses on the compressed representations of pictures. The representation does not affect how many bits get from the Web server to the laptop, but it determines the usefulness of the bits that arrive. Many different representations are possible, and there is more involved in their choice than merely selecting a compression ratio. The techniques presented represent a single information source with several chunks of data ("descriptions") so that the source can be approximated from any subset of the chunks. By allowing image reconstruction to continue even after a packet is lost, this type of representation can prevent a Web browser from becoming dormant.

/pdf/multiple-description-coding-compression-meets-the-network-8n6rpegvwp.pdf

Multiple description coding: compression meets the network

This document provides updates to IEEE Std 802.16's MIB for the MAC, PHY and asso- ciated management procedures in order to accommodate recent extensions to the standard.

IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems Draft Amendment: Management Information Base Extensions

Next generation cellular networks will rely heavily on mmWave and THz spectrum for the abundantly available bandwidth. However, these frequencies suffer from high path and penetration losses. One way to improve the performance is network densification which comes with higher operational cost. To reduce the operational cost of Base Station (BS) deployment, the 3GPP has proposed the Integrated Access and Backhaul (IAB) architecture. Nonetheless, when a handover does occur in IAB networks, even with minimal handover time, the traffic that is already en route to the UE is delayed, as the new serving BS must retrieve the packets from either the previous serving BS or the core. To address these challenges, we propose Fast Wireless Backhaul (FWB), a new wireless backhaul solution. FWB takes advantage of the multi-connectivity of UEs and the high-capacity low-cost wireless backhaul promised by IAB to reduce latency and increase reliability in case of unexpected blockages on the wireless signal path. In FWB, the BSs serving the UE participate in a multicast tree, and receive all packets designated for the UE, but only one BS transmits packets to the UE. In the event of a link failure between the UE and the serving BS, another BS takes over to maintain the data plane connection, without first having to retrieve undelivered downlink packets. We believe our architecture can enable mission critical applications with stringent latency and reliability requirements.

Fast Wireless Backhaul: A Multi-Connectivity Enabled mmWave Cellular System

Opportunistic communications through wireless ad-hoc mesh networks have been thoroughly studied in the context of military infrastructureless deployments, sensor networks and even human-centered pervasive networking. However, due to the lack of a model that accurately computes the probability distribution of the delay, we usually content ourselves with the mean values. Such an approach can limit both the ability to predict the system's behavior and the ways to affect it. In this paper, we present an analytical framework that allows us to estimate the probability distribution of the delay as a function of the field size, the number of participating users and the movement model. In addition, the short computational time, as compared to simulations, allows us to analyze systems that would otherwise be infeasible, due to their size. The derived delay probability distribution can help us decide whether opportunistic networking can be practically used in, e.g., dense vehicular environments, highly volatile mesh networks, or even predicting a successful marketing campaign. We validate the analytical results against a simulation of the presented model. Furthermore, we created a second, highly sophisticated and realistic, simulation, in order to verify the validity of the observed trends in almost-real-life situations.

Spreading the message: Defining the delay distribution in opportunistic communications

The 3GPP has standardized the 5G New Radio (NR) sidelink (SL) technology that enables direct device-to-device communications. SL will be key in realizing several high-speed, low-latency vehicle-to-everything (V2X) applications, such as automated driving. To meet these applications’ high data rate requirements, operating SL at mmWave and sub-THz frequencies will be essential. However, the current SL design primarily caters to sub-6 GHz frequencies and does not consider the directionality of transmissions at high frequencies. For Mode 2 of SL, where SL UEs perform sensing-based autonomous resource selection, this results in hidden node interference due to the transmit (Tx) UE’s inability to sense transmissions not aligned with the primary direction of communication. We propose paired transmission and sensing of sidelink control information (SCI), whereby SL Tx UEs transmit and receive SCI in an additional paired direction directly opposite to the primary direction. This helps eliminate hidden node interference while reducing the number of exposed nodes. Simulations in NR V2X highway deployments show that the paired scheme improves the average packet reception ratio (PRR) by 27% over the state-of-the-art at the highest traffic loads. We also propose enhanced transmit power control strategies to minimize interference between concurrent SL transmissions. This enables better resource reuse and further improves performance, with our combined solution achieving at least 95% average PRR in all scenarios. Finally, we present a stochastic geometry-based analytical model for a single-lane highway V2X network and validate it against simulation results. Our model provides insights into the reliability and capacity of high-frequency SL networks.

https://ieeexplore.ieee.org/ielx7/6287639/6514899/10184305.pdf

Enhanced Distributed Resource Selection and Power Control for High Frequency NR V2X Sidelink

The single-chip crosspoint-queued (CQ) switch is a compact switching architecture that has all its buffers placed at the crosspoints of input and output lines. Scheduling is also performed inside the switching core, and does not rely on latency-limited communications with input or output line-cards. Compared with other legacy switching architectures, the CQ switch has the advantages of high throughput, minimal delay, low scheduling complexity, and no speedup requirement. However, the crosspoint buffers are small and segregated, thus how to efficiently use the buffers and avoid packet drops remains a major problem that needs to be addressed. In this paper, we consider load balancing, deflection routing, and buffer pooling for efficient buffer sharing in the CQ switch. We also design scheduling algorithms to maintain the correct packet order even while employing multi-path switching and resolve contentions caused by multiplexing. All these techniques require modest hardware modifications and memory speedup in the switching core, but can greatly boost the buffer utilizations by up to 10 times and reduce the packet drop rates by one to three orders of magnitude. Extensive simulations and analyses have been done to demonstrate the advantages of the proposed buffering and scheduling techniques in various aspects. By pushing the on-chip memory to the limit of current ASIC technology, we show that a cell drop rate of 10e-8, which is low enough for practical uses, can be achieved under real Internet traffic traces corresponding to a load of 0.9.

Technical Report: Efficient Buffering and Scheduling for a Single-Chip Crosspoint-Queued Switch

In 5G systems, a predefined codebook with a limited number of beams is used during the initial access and beam management procedures to establish and maintain the connection between the users and the network. At 5G mmimeter wave (mmWave) frequencies, due to the very narrow and directional beams obtained by beamforming, intelligently designing a codebook with a limited number of beams is crucial to avoid coverage holes. We formulate an optimization problem for the beam-codebook design to maximize the coverage probability, which is a quadratically-constrained mixed-integer problem. We propose a set of data-driven codebook design algorithms to solve the optimization problem, which, for a given codebook size constraint, adapts the codebook to the deployment scenario using the provided input channel data. For a sample deployment scenario, we show that as the codebook size increases, the proposed algorithms converge to the upper bound in terms of the coverage probability much faster than several benchmark algorithms. Hence, the proposed algorithms can achieve the coverage levels of benchmark algorithms with a much smaller codebook size. This can significantly reduce the initial access, beam management, and handover delays, which in turn provide higher data rates, lower latency, and lower interruption times.

Shivendra S. Panwar

Papers

Fast Wireless Backhaul: A Multi-Connectivity Enabled mmWave Cellular System

Spreading the message: Defining the delay distribution in opportunistic communications

Enhanced Distributed Resource Selection and Power Control for High Frequency NR V2X Sidelink

Technical Report: Efficient Buffering and Scheduling for a Single-Chip Crosspoint-Queued Switch

Data-Driven Beamforming Codebook Design to Improve Coverage in Millimeter Wave Networks