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

Low latency TCP congestion control (CC) is a key enabler of delay-sensitive applications such as cloud gaming, remote driving, and virtual/augmented reality(VR/AR). In recent years, TCP BBR has emerged as a popular choice for low latency CC, with it already having widespread adoption. However, a critical question that needs to be studied is how BBR will coexist with the current most dominant CC protocol on the internet, i.e., TCP Cubic. A recently published study proposed a mathematical model for the coexistence of TCP BBR and TCP Cubic. This study on BBR dominance predicted that the internet will reach a stable mixed distribution of BBR and Cubic flows, resulting in a Nash Equilibrium where no traffic will have any incentive to switch between BBR and Cubic. This work presents a fully reproducible experiment on an open-access networking testbed that replicates the major experiments from the BBR dominance study. In addition to reproducing the original results, we further show that the predictions of the proposed model do not hold up in specific scenarios that are highly relevant to today’s lowlatency networks. Our work motivates future work to improve the analysis of BBR and Cubic’s coexistence. We also share all artifacts necessary to reproduce our experiment to help other researchers easily replicate this study and to further use it as a baseline for their research on low latency CC.

Some of the Internet may be heading towards BBR dominance: an experimental study

In this paper, a modern system-theoretic approach is applied to analyze the dynamics of epidemic networks with time-varying population. Specifically, cooperative system theory, nonnegative matrix theory and large-scale system theory are jointly invoked to study the global asymptotic stability of an equilibrium of interest. The obtained results may provide biologically-meaningful measures for how to control the disease and explain why the disease fades out in the population. An explicit estimate is given to describe how the recovery rate affects the epidemic level.

A system-theoretic approach for epidemic networks with time-varying population

Multimedia Quality-of-Service Support in IEEE 802.11 Standards

Full duplex (FD) communication enables simultaneous transmission and reception on the same frequency band. Though it has the potential of doubling the throughput on isolated links, in reality, higher interference and asymmetric traffic demands in the uplink and downlink could significantly reduce the gains of FD operations. In this paper, we consider the application of FD operation in self-backhauled small cells, where multiple FD capable small cell base stations (SBS) are wirelessly backhauled by a FD capable macro-cell BS (MBS). To increase the capacity of the backhaul link, the MBS is equipped with multiple antennas to enable space division multiple access (SDMA). A scheduling method using back-pressure algorithm and geometric programming is proposed for link selection and interference mitigation. Simulation results show that with FD SDMA backhaul links, the proposed scheduler almost doubles throughput under asymmetric traffic demand and various network conditions.

Capacity Analysis for Full Duplex Self-backhauled Small Cells

Due to the greater path loss, shadowing, and increased effect of blockage in millimeter wave cellular networks, base station sharing among network service providers has the potential to significantly improve overall network capacity. However, a service provider may find that despite the technical gains, sharing actually reduces its profits because it makes price competition between service providers tougher. In this work, a weighted scheduling algorithm is described, which gives greater control over how the airtime resource is allocated within a shared cell. It is shown that, under certain market conditions, there exist scheduling weights such that base station sharing is more profitable than not sharing for both service providers in a duopoly market, while still achieving almost as much network capacity as in a conventional base station sharing scenario. Thus, both technical and economic benefits of base station sharing may be realized simultaneously.

Shivendra S. Panwar

Papers

Some of the Internet may be heading towards BBR dominance: an experimental study

A system-theoretic approach for epidemic networks with time-varying population

Multimedia Quality-of-Service Support in IEEE 802.11 Standards

Capacity Analysis for Full Duplex Self-backhauled Small Cells

Capturing Capacity and Profit Gains with Base Station Sharing in mmWave Cellular Networks