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

Transporting multimedia data over ad hoc networks is a challenging problem. However, the mesh topology of ad hoc networks implies the existence of multiple paths between two nodes. In our previous work, we have shown that path diversity provides an effective means of combating transmission errors and topology changes that are typical in ad hoc networks. Moreover, data partitioning techniques, such as striping and thinning, have been demonstrated to improve the queueing performance of realtime data. Recognizing the advantages of these techniques, as well as the increasing need of video services in ad hoc networks, we propose a new transport protocol to support multipath transport of realtime data. The new protocol, called multiflow realtime transport protocol (MRTP), provides a convenient vehicle for realtime applications to partition and transmit data using multiple flows. Analysis results from a bottleneck mobile node and simulation results from multiple path video transport over a 16-node ad hoc network illustrate the benefits of MRTP.

/pdf/mrtp-a-multiflow-realtime-transport-protocol-for-ad-hoc-knz37bqtno.pdf

MRTP: a multiflow realtime transport protocol for ad hoc networks

Recent advances in self-interference cancellation enable radios to transmit and receive on the same frequency at the same time. Such a full duplex radio is being considered as a potential candidate for the next generation of wireless networks due to its ability to increase the spectral efficiency of wireless systems. In this paper, the performance of full duplex radio in small cellular systems is analyzed by assuming full duplex capable base stations and half duplex user equipment. However, using only full duplex base stations increases interference leading to outage. We therefore propose a mixed multi-cell system, composed of full duplex and half duplex cells. A stochastic geometry based model of the proposed mixed system is provided, which allows us to derive the outage and area spectral efficiency of such a system. The effect of full duplex cells on the performance of the mixed system is presented under different network parameter settings. We show that the fraction of cells that have full duplex base stations can be used as a design parameter by the network operator to target an optimal tradeoff between area spectral efficiency and outage in a mixed system.

Throughput and Coverage for a Mixed Full and Half Duplex Small Cell Network

With the increased popularity of mobile multimedia services, efficient and robust video multicast strategies are of critical importance. In a conventional multicast system, the source station transmits at the base rate of the underlying network so that all the nodes can receive the data correctly. The performance of such a multicast system is limited by the node with the worst channel conditions, which usually corresponds to the nodes at the edge of the multicast coverage range. To overcome this problem, we propose a two-hop cooperative transmission scheme where in the first hop the source station transmits the packets and the nodes who receive the packets forward the packets simultaneously in the second hop using Randomized Distributed Space Time Codes (R-DSTC). We further integrate this randomized cooperative transmission with layered video coding to provide users different video quality based on their channel conditions. The performance of the system is evaluated and compared with a conventional multicast system. Our results show that the proposed cooperative system significantly improves the performance compared to conventional multicast.

Cooperative Layered Video Multicast Using Randomized Distributed Space Time Codes

Multipath transport provides higher usable bandwidth for a session. It has also been shown to provide load balancing and error resilience for end-to-end multimedia sessions. Two key issues in the use of multiple paths are 1) how to minimize the end-to-end delay, which now includes the delay along the paths and the resequencing delay at the receiver, and 2) how to select paths. This paper presents an analytical framework for the optimal partitioning of real-time multimedia traffic that minimizes the total end-to-end delay. Specifically, it formulates optimal traffic partitioning as a constrained optimization problem using deterministic network calculus and derives its closed-form solution. Compared with previous work, the proposed scheme is simpler to implement and enforce. This analysis also greatly simplifies the solution to the path selection problem as compared to previous efforts. Analytical results show that for a given flow and a set of paths, a minimal subset can be chosen to achieve the minimum end-to-end delay with O(N) time, where N is the number of available paths. The selected path set is optimal in the sense that adding any rejected path to the set will only increase the end-to-end delay.

On minimizing end-to-end delay with optimal traffic partitioning

Virtual output queuing is widely used by fixed-length high-speed switches to overcome head-of-line blocking. This is done by means of matching algorithms. Maximum matching algorithms have good performance, but their implementation complexity is quite high. Maximal matching algorithms need speedup to guarantee good performance. Iterative matching schemes, such as iSLIP and DRRM, use multiple iterations to converge on a maximal match.. The objective of matching algorithms is to reduce the matching overhead for each time slot. The paper presents exhaustive service matching as a way to amortize the cost of a match over multiple time slots, thus significantly improving switch performance. In an exhaustive service matching switch, cells belonging to the same packet are transferred to the output continuously, which leads to good packet delay performance and simplifies the implementation of packet reassembly. To avoid unfairness under some extremely unbalanced traffic pattern, limited service matching and exhaustive service matching with Hamiltonian walk (EMHW) are presented. We show that limited service matching achieves better fairness under unbalanced traffic patterns, and in some cases improves the delay performance, while retaining low implementation complexity and a scalable architecture. We prove that EMHW is stable under all admissible traffic. All these schemes can be applied to existing matching algorithms, such as iSLIP and DRRM, to achieve high switching efficiency with low implementation complexities.

Shivendra S. Panwar

Papers

MRTP: a multiflow realtime transport protocol for ad hoc networks

Throughput and Coverage for a Mixed Full and Half Duplex Small Cell Network

Cooperative Layered Video Multicast Using Randomized Distributed Space Time Codes

On minimizing end-to-end delay with optimal traffic partitioning

Exhaustive service matching algorithms for input queued switches