Search

Unlimited and seamless coverage as well as ultra-reliable and low-latency communications are vital for connected vehicles, in particular for new use cases like autonomous driving and vehicle platooning. In this paper, we propose a novel Space-Air-Ground integrated vehicular network (SAGiven) architecture to gracefully integrate the multi-dimensional and multi-scale context-information and network resources from satellites, High-Altitude Platform stations (HAPs), low-altitude Unmanned Aerial Vehicles (UAVs), and terrestrial cellular communication systems. One of the key features of the SAGiven is the reconfigurability of heterogeneous network functions as well as network resources. We first give a comprehensive review of the key challenges of this new architecture and then provide some up-to-date solutions on those challenges. Specifically, the solutions will cover the following topics: (1) space-air-ground integrated network reconfiguration under dynamic space resources constraints; (2) multi-dimensional sensing and efficient integration of multi-dimensional context information; (3) real-time, reliable, and secure communications among vehicles and between vehicles and the SAGiven platform; and (4) a holistic integration and demonstration of the SAGiven. Finally, it is concluded that the SAGiven can play a key role in future autonomous driving and Internet-of-Vehicles applications.

Timely status updates are critical in remote control systems such as autonomous driving and the industrial Internet of Things, where timeliness requirements are usually context dependent. Accordingly, the Urgency of Information (UoI) has been proposed beyond the well-known Age of Information (AoI) by further including context-aware weights which indicate whether the monitored process is in an emergency. However, the optimal updating and scheduling strategies in terms of UoI remain open. In this paper, we propose a UoI-optimal updating policy for timely status information with resource constraint. We first formulate the problem in a constrained Markov decision process and prove that the UoI-optimal policy has a threshold structure. When the context-aware weights are known, we propose a numerical method based on linear programming. When the weights are unknown, we further design a reinforcement learning (RL)-based scheduling policy. The simulation reveals that the threshold of the UoI-optimal policy increases as the resource constraint tightens. In addition, the UoI-optimal policy outperforms the AoI-optimal policy in terms of average squared estimation error, and the proposed RL-based updating policy achieves a near-optimal performance without the advanced knowledge of the system model.

The spatial distribution of base stations (BSs) and traffic demands is essential for efficient network planning and BS sleeping, which are key elements of green cellular networking. This paper investigates their statistics, relation, and modeling, based on large-scale measurement data from commercial cellular networks. The spatial distribution of BSs shows not only high nonuniformity over a region but also diverse patterns in different regions, and thus the widely used homogeneous Poisson point process can only approximate the BS patterns in a specific small area. Therefore, the inhomogeneous PPP (IPPP), in particular, the Cox point process with spatially varying intensity is used to model the BS distribution over any spatial scale. To model the intensity distribution of the IPPP, we exploit the relation, shown to be sublinear, between the BS distribution and the peak hour (PH) traffic density, based on the finding that the PH traffic density can be approximated by a log-normal distribution. Finally, we propose a spatial modeling framework for network simulations, and discuss potential applications of the proposed spatial distribution model of the BS patterns and the PH traffic density.

We investigate channel assignment for a multichannel wireless mesh network backbone, where each router is equipped with multiple interfaces. Of particular interest is the development of channel assignment heuristics for multiple flows. We present an optimization formulation and then propose two iterative flow oriented heuristics for the conflict-free and interference-aware cases, respectively. To maximize the aggregate useful end-to-end flow rates, both algorithms identify and resolve congestion at instantaneous bottleneck link in each iteration. Then the link rate is optimally allocated among contending flows that share this link by solving a linear programming (LP) problem. A thorough performance evaluation is undertaken as a function of the number of channels and interfaces/node and the number of contending flows. The performance of our algorithm is shown to be significantly superior to best known algorithm in its class in multichannel limited radio scenarios.