Enabling Technologies for Ultra-Reliable and Low Latency Communications: From PHY and MAC Layer Perspectives

© 1998-2012 IEEE. Future 5th generation networks are expected to enable three key services-enhanced mobile broadband, massive machine type communications and ultra-reliable and low latency communications (URLLC). As per the 3rd generation partnership project URLLC requirements, it is expected that the reliability of one transmission of a 32 byte packet will be at least 99.999% and the latency will be at most 1 ms. This unprecedented level of reliability and latency will yield various new applications, such as smart grids, industrial automation and intelligent transport systems. In this survey we present potential future URLLC applications, and summarize the corresponding reliability and latency requirements. We provide a comprehensive discussion on physical (PHY) and medium access control (MAC) layer techniques that enable URLLC, addressing both licensed and unlicensed bands. This paper evaluates the relevant PHY and MAC techniques for their ability to improve the reliability and reduce the latency. We identify that enabling long-term evolution to coexist in the unlicensed spectrum is also a potential enabler of URLLC in the unlicensed band, and provide numerical evaluations. Lastly, this paper discusses the potential future research directions and challenges in achieving the URLLC requirements

Reinforcement Learning Approaches to Improve Spatial Reuse in Wireless Local Area Networks

The ubiquitous deployment of IEEE 802.11 based Wireless Local Area Networks (WLANs) or WiFi networks has resulted in dense deployments of Access Points (APs) in an effort to provide wireless links with high data rates to users. This, however, causes APs and users/stations to experience a higher interference level. This is because of the limited spectrum in which WiFi networks operate, resulting in multiple APs operating on the same channel. This in turn affects the signal-tonoise-plus interference ratio (SINR) at APs and users, leading to low data rates that limit their quality of service (QoS). To improve QoS, interference management is critical. To this end, a key metric of interest is spatial reuse. A high spatial reuse means multiple transmissions are able to transmit concurrently, which leads to a high network capacity. One approach to optimize spatial reuse is by tuning the clear channel access (CCA) threshold employed by the carrier sense multiple access with collision avoidance (CSMA/CA) medium access control (MAC) protocol. Specifically, the CCA threshold of a node determines whether it is allowed to transmit after sensing the channel. A node may increase its CCA threshold, causing it to transmit even when there are other ongoing transmissions. Another parameter to be tuned is transmit power. This helps a transmitting node lower its interference to neighboring cells, and thus allows nodes in these neighboring cells to transmit as well. Apart from that, channel bonding can be applied to improve transmission rate. In particular, by combining/aggregating multiple channels together, the resulting channel has a proportionally higher data rate than the case without channel bonding. However, the issue of spatial reuse remains the same whereby the focus is to maximize the number of concurrent transmissions across multiple channels

Modeling, Analysis and Design for Carrier Aggregation in Heterogeneous Cellular Networks

Carrier aggregation (CA) and small cells are two distinct features of next-generation cellular networks. Cellular networks with small cells take on a very heterogeneous characteristic, and are often referred to as HetNets. In this paper, we introduce a load-aware model for CA-enabled \textit{multi}-band HetNets. Under this model, the impact of biasing can be more appropriately characterized; for example, it is observed that with large enough biasing, the spectral efficiency of small cells may increase while its counterpart in a fully-loaded model always decreases. Further, our analysis reveals that the peak data rate does not depend on the base station density and transmit powers; this strongly motivates other approaches e.g. CA to increase the peak data rate. Last but not least, different band deployment configurations are studied and compared. We find that with large enough small cell density, spatial reuse with small cells outperforms adding more spectrum for increasing user rate. More generally, universal cochannel deployment typically yields the largest rate; and thus a capacity loss exists in orthogonal deployment. This performance gap can be reduced by appropriately tuning the HetNet coverage distribution (e.g. by optimizing biasing factors).Comment: submitted to IEEE Transactions on Communications, Nov. 201

Characterization of the fundamental properties of wireless CSMA multi-hop networks

A wireless multi-hop network consists of a group of decentralized and self-organized wireless devices that collaborate to complete their tasks in a distributed way. Data packets are forwarded collaboratively hop-by-hop from source nodes to their respective destination nodes with other nodes acting as intermediate relays. Existing and future applications in wireless multi-hop networks will greatly benefit from better understanding of the fundamental properties of such networks. In this thesis we explore two fundamental properties of distributed wireless CSMA multi-hop networks, connectivity and capacity. A network is connected if and only if there is at least one (multi-hop) path between any pair of nodes. We investigate the critical transmission power for asymptotic connectivity in large wireless CSMA multi-hop networks under the SINR model. The critical transmission power is the minimum transmission power each node needs to transmit to guarantee that the resulting network is connected aas. Both upper bound and lower bound of the critical transmission power are obtained analytically. The two bounds are tight and differ by a constant factor only. Next we shift focus to the capacity property. First, we develop a distributed routing algorithm where each node makes routing decisions based on local information only. This is compatible with the distributed nature of large wireless CSMA multi-hop networks. Second, we show that by carefully choosing controllable parameters of the CSMA protocols, together with the routing algorithm, a distributed CSMA network can achieve the order-optimal throughput scaling law. Scaling laws are only up to order and most network design choices have a significant effect on the constants preceding the order while not affecting the scaling law. Therefore we further to analyze the pre-constant by giving an upper and a lower bound of throughput. The tightness of the bounds is validated using simulations