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

As cellular networks are turning into a platform for ubiquitous data access, cellular operators are facing a severe data capacity crisis due to the exponential growth of traffic generated by mobile users. In this work, we investigate the benefits of sharing infrastructure and spectrum among two cellular operators. Specifically, we provide a multi-cell analytical model using stochastic geometry to identify the performance gain under different sharing strategies, which gives tractable and accurate results. To validate the performance using a realistic setting, we conduct extensive simulations for a multi-cell OFDMA system using real base station locations. Both analytical and simulation results show that even a simple cooperation strategy between two similar operators, where they share spectrum and base stations, roughly quadruples capacity as compared to the capacity of a single operator. This is equivalent to doubling the capacity per customer, providing a strong incentive for operators to cooperate, if not actually merge.

The urge to merge: When cellular service providers pool capacity

The problem of scheduling impatient customers in a non-preemptive G/GI/1 queue is considered. Every customer has a random deadline to the beginning of its service. Given the distribution of the customer deadlines (rather than their exact values), a scheduling policy decides the customer service order and also which customer(s) to reject. The objective is to find an optimal policy which maximizes the number of customers served before their deadlines. It is shown that LIFO (last-in first-out) is an optimal service order when the deadlines are i.i.d. (independently identically distributed) random variables with a concave cumulative distribution function. There is an optimal policy in the LIFO-TO (time-out) class, as defined by the authors. For the M/GI/1 queue, it is proved that unforced idle times are not allowed under this optimal policy. It is also shown that the optimal LIFO-TO policy assigns a fixed critical time (i.e., its maximum waiting time) to every customer. When the customer waiting times are unknown, the optimal policy for an M/M/1 queue becomes the LIFO-PO (push-out) policy, with a fixed buffer size used as a rejection threshold. >

Queueing performance with impatient customers

Real-time multimedia transport has stringent bandwidth, delay, and loss requirements. Supporting this application in current wireless ad hoc networks is a challenge. Such networks are characterized with frequent link failures, as well as congestion. Consequently, data packets are dropped when a link fails or congestion occurs, resulting in low received quality. In addition, a realtime multimedia service may be unavailable when a particular server is unreachable. In this article, we make the case for using multipath transport for realtime multimedia services in wireless ad hoc networks, which provides a unified solution to the above problems. We review existing work on multipath multimedia transport, and discuss the advantages, as well as related issues, of using multipath transport for realtime multimedia transport.

The case for multipath multimedia transport over wireless ad hoc networks

In multicast/broadcast services over infrastructure- based/cellular wireless networks (e.g. 3G cellular networks, WiMax, DVB), data is transmitted to multiple recipients from an access point/base station. Multicast greatly improves the network efficiency to distribute data to multiple recipients as compared to multiple unicast sessions of the same data to each receiver individually, by taking advantage of the shared nature of the wireless medium. However it is difficult to guarantee the reception reliability of multiple multicast/broadcast recipients because the wireless medium is error prone and each receiver experiences different channel conditions. An additional difficulty is that multicast/broadcast services in many networks such as 3G multimedia multicast services do not provide a reverse communications channel for the receivers to request the retransmission of lost data packets. This research proposes a novel method to provide QoS support by using an assistant network to recover the loss of multicast data in the principal network. Wireless devices are connected to the principal network to receive the multicast data. A wireless device may lose some of the multicast data sent over the principal network. The wireless devices form an assistant network to recover the lost multicast data cooperatively from their peers. The performance of this recovery mechanism has been investigated using extensive simulation experiments.

Cooperative Recovery in Heterogeneous Mobile Networks

Due to massive available spectrum in the millimeter wave (mmWave) bands, cellular systems in these frequencies may provides orders of magnitude greater capacity than networks in conventional lower frequency bands. However, due to high susceptibility to blocking, mmWave links can be extremely intermittent in quality. This combination of high peak throughputs and intermittency can cause significant challenges in end-to-end transport-layer mechanisms such as TCP. This paper studies the particularly challenging problem of bufferbloat. Specifically, with current buffering and congestion control mechanisms, high throughput — high variable links can lead to excessive buffers incurring long latency. In this paper, we capture the performance trends obtained while adopting two potential solutions that have been proposed in the literature: Active queue management (AQM) and dynamic receive window. We show that, over mmWave links, AQM mitigates the latency but cannot deliver high throughput. The main reason relies on the fact that the current congestion control was not designed to cope with high data rates with sudden change. Conversely, the dynamic receive window approach is more responsive and therefore supports higher channel utilization while mitigating the delay, thus representing a viable solution.

Shivendra S. Panwar

Papers

The urge to merge: When cellular service providers pool capacity

Queueing performance with impatient customers

The case for multipath multimedia transport over wireless ad hoc networks

Cooperative Recovery in Heterogeneous Mobile Networks

TCP dynamics over mmwave links