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

FOR COMMUNICATIONS NETWORKS, bandwidth has long been king. With every generation of fiber optic, cellular, or Wi-Fi technology has come a jump in throughput that has enriched our online lives. Twenty years ago we were merely exchanging texts on our phones, but we now think nothing of streaming videos from YouTube and Netflix. No wonder, then, that video now consumes up to 60 percent of Internet bandwidth. If this trend continues, we might yet see full-motion holography delivered to our mobiles—a techie dream since Princess Leia's plea for help in Star Wars. • Recently, though, high bandwidth has begun to share the spotlight with a different metric of merit: low latency. The amount of latency varies drastically depending on how far in a network a signal travels, how many routers it passes through, whether it uses a wired or wireless connection, and so on. The typical latency in a 4G network, for example, is 50 milliseconds. Reducing latency to 10 milliseconds, as 5G and Wi-Fi are currently doing, opens the door to a whole slew of applications that high bandwidth alone cannot. With virtual-reality headsets, for example, a delay of more than about 10 milliseconds in rendering and displaying images in response to head movement is very perceptible, and it leads to a disorienting experience that is for some akin to seasickness. • Multiplayer games, autonomous vehicles, and factory robots also need extremely low latencies. Even as 5G and Wi-Fi make 10 milliseconds the new standard for latency, researchers, like my group at New York University's NYU Wireless research center, are already working hard on another order-of-magnitude reduction, to about 1 millisecond or less. • Pushing latencies down to 1 millisecond will require reengineering every step of the communications process. In the past, engineers have ignored sources of minuscule delay because they were inconsequential to the overall latency. Now, researchers will have to develop new methods for encoding, transmitting, and routing data to shave off even the smallest sources of delay. And immutable laws of physics—specifically the speed of light—will dictate firm restrictions on what networks with 1-millisecond latencies will look like. There's no one-size-fits-all technique that will enable these extremely low-latency networks. Only by combining solutions to all these sources of latency will it be possible to build networks where time is never wasted.

Breaking the millisecond barrier: Robots and self-driving cars will need completely reengineered networks

The main objective of the future broadband integrated services network is the accommodation of a variety of services with different traffic characteristics and Quality of Service (QoS) requirements. This indicates that the network should provide special mechanisms in order to prioritize the access to resources, such as link capacity and buffer space. For services with strict loss and/or delay requirements, the network must be able to reserve and share resources to regulate the QoS of those services. As a general example, traditional data traffic (file transfer, e-mail) has a strict loss requirement but is relatively insensitive to delay, while real-time traffic (video, voice) can tolerate some loss at the expense of strict delay requirements. Network nodes (switches, routers, etc.) are being designed to accommodate at least these two types of service classes. We initially studied the performance of sharing buffer space and link capacity between two sessions, the traffic of which is modeled by two independent general Markov-Modulated Fluid Process (MMFP) sources. We also generalize our analysis to the case of multiple sessions. For scheduling we use the Generalized Processor Sharing (GPS) policy, which guarantees a minimum link capacity allocation to each session, and thus allows for maintaining different QoS in terms of loss probability and delay. GPS can be approximately implemented using Weighted Fair Queueing, Weighted Round Robin, and other improved variants of these designs. Among buffer management policies assigning buffer space priority when the shared buffer is full, we focus on simple complete buffer sharing (CS + GPS), and complete buffer sharing with virtual buffer partitioning (VP + GPS). With the latter policy a minimum buffer space is dynamically guaranteed to both classes. Analytical results are obtained for the queue occupancy distributions from which throughput, loss probability and delay distributions can be derived. Case studies show that the analytical results closely approximate the results obtained by simulations. Using the CS + GPS and VP + GPS allocation schemes considerable reduction of the required capacity was observed in the buffer sizes of interest, as compared to fixed priority systems with partitioned buffer space or link capacity. This implies that the admissible region of connections can be increased by exploiting this feature of such priority schemes. VP + GPS has the additional advantage of fairly controlling the QoS of asymmetric sources, especially at high system loads.

Stochastic analysis of joint buffer management and service scheduling in high-speed network nodes

In a paper titled Can I add a VoIP call?(1), the authors calculate the maximum number of VoIP calls that a WiFi (VoFi) network can support. In this paper we extend their analysis to calculate the maximum number of VoFi calls when two-hop forwarding is used in order to avoid rate adaptation at nodes with reduced received signal strength. We calculate this number for different combinations of data rates for slow node transmissions and potential two-hop transmissions. These calculations demonstrate that the use of two-hop forwarding increases the maximum number of VoIP calls in a multi-rate 802.11b network. We validate the analysis by means of simulation of G711 codec sources in a 802.11b network. Even though the earlier discussions focus on specific combinations of high data rate two-hop and low data rate one-hop transmissions in an 802.11b network, we conclude the paper by calculating the maximum number of VoIP calls that can be supported with uniform node distri- bution in 802.11b and 802.11g networks. These calculations show a significant increase in the number of VoIP calls when two-hop forwarding is used in an 802.11g network. This sig- nificant increase is due to the higher data rates and the low PHY overhead of the 802.11g MAC.

When two-hop meets VoFi

The IEEE 802.11e protocol is designed to enhance the QoS capability of wireless local area networks (WLAN). In this paper, we propose a multidimensional Markov model for the 802.11e enhanced distributed coordination function (EDCF) mode and compute the maximum sustainable throughput and service delay distribution for each priority class when under heavy load. Since the QoS mechanisms and their associated parameters in IEEE 802.11e interact with each other in a complex way, it is important to model the aggregate effect of all the mechanisms. The approach we present does so and therefore provides an analytical approach to pick the parameter values associated with EDCF to meet the QoS requirements of each priority.

An analytical model for the IEEE 802.11e EDCF

An objective of the next generation network is the accommodation of services with different QoS requirements. This indicates that the network should provide special mechanisms in order to prioritize the access to network node resources, such as link capacity and buffer space. We studied the performance of sharing buffer space and link capacity between sessions, the traffic of which is modeled by independent general Markov-modulated fluid process (MMFP) sources. For scheduling we use the generalized processor sharing (GPS) policy, and improve previous upper bounds on the queue occupancy distributions. As an example of combining GPS with buffer management we apply our results to complete buffer sharing with virtual partitioning (VP+GPS). We also derive results on the resource allocation trade-off, with applications in traffic management and admission control.

Shivendra S. Panwar

Papers

Breaking the millisecond barrier: Robots and self-driving cars will need completely reengineered networks

Stochastic analysis of joint buffer management and service scheduling in high-speed network nodes

When two-hop meets VoFi

An analytical model for the IEEE 802.11e EDCF

Quality of service analysis of shared buffer management policies combined with generalized processor sharing