Integrated Access and Backhaul (IAB) represents a fast and cost-efficient network deployment technology that enhances the coverage of millimeter-wave (mmWave) 5G networks. In addition to the conventional challenges of wireless multi-hop relaying such as, e.g., increased interference and packet delays, traffic asymmetry can lead to significant delay degradation. While centralized coordination can mitigate these challenges, it may also lead to unnecessary overheads. In this paper, we propose an effective delay-aware distributed solution for joint access and backhaul link scheduling and route selection designed to function with limited information, which relies only on the knowledge collected from immediate neighbors. We formulate the joint upstream and downstream routing and scheduling problem, which is solved in a distributed manner for the IAB system with diverse delay requirements. To effectively tackle this problem, we employ deep reinforcement learning (DRL) algorithms. Our numerical results demonstrate that the proposed distributed solution provides improved scalability as compared to the centralized approach without a significant performance loss.

The use of millimeter-wave (mmWave) frequencies by 5G/5G+ technology results in increased signal attenuation naturally requiring dense network deployments. However, traditional fiber-based backhauling proves costly for network operators. To address this issue, 3GPP proposed the Integrated Access and Backhaul (IAB) concept to enable wireless backhaul and reduce deployment costs. However, system dynamics such as user mobility and traffic variations challenge system optimization and may shift the performance from its optimized state. On top of this, in-band mmWave IAB networks are subject to the half-duplex constraint, which prevents simultaneous transmission and reception. These limitations present challenges in optimizing the IAB network. Therefore, the goal of this study is to provide a computationally-efficient methodology for resource allocation and user scheduling in mm Wave IAB networks considering the aforementioned system limitations and constraints. Moreover, we evaluate the influence of system-specific factors and dynamics on the optimization of IAB networks and the time that it takes for the system to deviate from its optimized state. Our results show that by employing an optimally-parametrized scheduler, the throughput gain is 55% as compared to the baseline, where the radio resources are split equally among the users. The cell size is the primary parameter affecting the optimization gain, i.e., smaller cell sizes result in diminishing benefits when utilizing optimized algorithms.

To meet the growing mobility needs in intra-city transportation, the concept of urban air mobility (UAM) has been proposed in which vertical takeoff and landing (VTOL) aircraft are used to provide a ride-hailing service. In UAM, aircraft can operate in designated air spaces known as corridors, that link the aerodromes, thus avoiding the use of complex routing strategies such as those of modern-day helicopters and alleviating the burden on the ground transportation system. For safety, a UAM aircraft must use air-to-ground communications to report flight plan, off-nominal events, and real-time movement to ground base stations (GBSs). A reliable communication network between GBSs and aircraft enables UAM to adequately utilize the airspace and create a fast, efficient, and safe transportation system. In this paper, to characterize the wireless connectivity performance for UAM, a suitable spatial model is proposed. For the considered setup, assuming that any given aircraft communicates with the closest GBS, the distribution of the distance between an arbitrarily selected GBS and its associated aircraft and the Laplace transform of the interference experienced by the GBS are derived. Using these results, the signal-to-interference ratio (SIR)-based connectivity probability is determined to capture the connectivity performance of the UAM aircraft-to-ground communication network. Then, leveraging these connectivity results, a wireless-enabled asynchronous federated learning (AFL) framework that uses a Fourier neural network is proposed to tackle the challenging problem of turbulence prediction during UAM operations. For this AFL scheme, a staleness-aware global aggregation scheme is introduced to expedite the convergence to the optimal turbulence prediction model used by UAM aircraft. Simulation results validate the theoretical derivations for the UAM wireless connectivity. The results also demonstrate that the proposed AFL framework converges to the optimal turbulence prediction model faster than the synchronous federated learning baselines and a staleness-free AFL approach. Furthermore, the results characterize the performance of wireless connectivity and convergence of the aircraft’s turbulence model under different parameter settings, offering useful UAM design guidelines.

Next-generation wireless systems are rapidly evolving from communication-only systems to multi-modal systems with integrated sensing and communications. In this paper a novel joint sensing and communication framework is proposed for enabling wireless extended reality (XR) at terahertz (THz) bands. To gather rich sensing information and a higher line-of-sight (LoS) availability, THz-operated reconfigurable intelligent surfaces (RISs) acting as base stations are deployed. The sensing parameters are extracted by leveraging THz’s quasi-opticality and opportunistically utilizing uplink communication waveforms. This enables the use of the same waveform, spectrum, and hardware for both sensing and communication purposes. The environmental sensing parameters are then derived by exploiting the sparsity of THz channels via tensor decomposition. Hence, a high-resolution indoor mapping is derived so as to characterize the spatial availability of communications and the mobility of users. Simulation results show that in the proposed framework, the resolution and data rate of the overall system are positively correlated, thus allowing a joint optimization between these metrics with no tradeoffs. Results also show that the proposed framework improves the system reliability in static and mobile systems. In particular, the highest reliability gains of 10% are achieved in a walking speed mobile environment compared to communication only systems with beam tracking.

Collaborative deep reinforcement learning (CDRL) algorithms in which multiple agents can coordinate over a wireless network is a promising approach to enable future intelligent and autonomous systems that rely on real-time decision making in complex dynamic environments. Nonetheless, in practical scenarios, CDRL face many challenges due to heterogeneity of agents and their learning tasks, different environments, time constraints of the learning, and resource limitations of wireless networks. To address these challenges, in this paper, a novel semantic-aware CDRL method is proposed to enable a group of heterogeneous untrained agents with semantically-linked DRL tasks to collaborate efficiently across a resource-constrained wireless cellular network. To this end, a new heterogeneous federated DRL (HFDRL) algorithm is proposed to select the best subset of semantically relevant DRL agents for collaboration. The proposed approach then jointly optimizes the training loss and wireless bandwidth allocation for the cooperating selected agents in order to train each agent within the time limitation of its real-time task. Simulation results show the superior performance of the proposed algorithm compared to state-of-the-art baselines.

Multi-access edge computing (MEC) is viewed as an integral part of future wireless networks to support new applications with stringent service reliability and latency requirements. However, guaranteeing ultra-reliable and low-latency MEC (URLL MEC) is very challenging due to uncertainties of wireless links, limited communications and computing resources, as well as dynamic network traffic. Enabling URLL MEC man-dates taking into account the statistics of the end-to-end (E2E) latency and reliability across the wireless and edge computing systems. In this paper, a novel framework is proposed to optimize the reliability of MEC networks by considering the distribution of E2E service delay, encompassing over-the-air transmission and edge computing latency. The proposed framework builds on correlated variational autoencoders (VAEs) to estimate the full distribution of the E2E service delay. Using this result, a new optimization problem based on risk theory is formulated to maximize the network reliability by minimizing the Conditional Value at Risk (CVaR) as a risk measure of the E2E service delay. To solve this problem, a new algorithm is developed to efficiently allocate users’ processing tasks to edge computing servers across the MEC network, while considering the statistics of the E2E service delay learned by VAEs. The simulation results show that the proposed scheme outperforms several baselines that do not account for the risk analyses or statistics of the E2E service delay.

The deployment of future intelligent transportation systems is contingent upon seamless and reliable operation of connected and autonomous vehicles (CAVs). One key challenge in developing CAVs is the design of an autonomous controller that can accurately execute near real-time control decisions, such as a quick acceleration when merging to a highway and frequent speed changes in a stop-and-go traffic. However, the use of conventional feedback controllers or traditional learning-based controllers, solely trained by each CAV’s local data, cannot guarantee a robust controller performance over a wide range of road conditions and traffic dynamics. In this paper, a new federated learning (FL) framework enabled by large-scale wireless connectivity is proposed for designing the autonomous controller of CAVs. In this framework, the learning models used by the controllers are collaboratively trained among a group of CAVs. To capture the varying CAV participation in the FL training process and the diverse local data quality among CAVs, a novel dynamic federated proximal (DFP) algorithm is proposed that accounts for the mobility of CAVs, the wireless fading channels, as well as the unbalanced and non-independent and identically distributed data across CAVs. A rigorous convergence analysis is performed for the proposed algorithm to identify how fast the CAVs converge to using the optimal autonomous controller. In particular, the impacts of varying CAV participation in the FL process and diverse CAV data quality on the convergence of the proposed DFP algorithm are explicitly analyzed. Leveraging this analysis, an incentive mechanism based on contract theory is designed to improve the FL convergence speed. Simulation results using real vehicular data traces show that the proposed DFP-based controller can accurately track the target CAV speed over time and under different traffic scenarios. Moreover, the results show that the proposed DFP algorithm has a much faster convergence compared to popular FL algorithms such as federated averaging (FedAvg) and federated proximal (FedProx). The results also validate the feasibility of the contract-theoretic incentive mechanism and show that the proposed mechanism can improve the convergence speed of the DFP algorithm by 40% compared to the baselines.

To meet the growing mobility needs in intra-city transportation, urban air mobility (UAM) has been proposed in which vertical takeoff and landing (VTOL) aircraft are used to provide on-demand service. In UAM, an aircraft can operate in the corridors, i.e., the designated airspace, that link the aerodromes, thus avoiding the use of complex routing strategies such as those of modern-day helicopters. For safety, a UAM aircraft will use air-to-ground communications to report flight plan, off-nominal events, and real-time movements to ground base stations (GBSs). A reliable communication network between GBSs and aircraft enables UAM to adequately utilize the airspace and create a fast, efficient, and safe transportation system. In this paper, to characterize the wireless connectivity performance in UAM, a stochastic geometry-based spatial model is developed. In particular, the distribution of GBSs is modeled as a Poisson point process (PPP), and the aircraft are distributed according to a combination of PPP, Poisson cluster process (PCP), and Poisson line process (PLP). For this setup, assuming that any given aircraft communicates with the closest GBS, the distribution of distance between an arbitrarily selected GBS and its associated aircraft and the Laplace transform of the interference experienced by the GBS are derived. Using these results, the signal-to-interference ra-tio (SIR)-based connectivity probability is determined to capture the connectivity performance of the aircraft-to-ground communication network in UAM. Simulation results validate the theoretical derivations for the UAM wireless connectivity and provide useful UAM design guidelines by showing the connectivity performance under different parameter settings.

Communication at terahertz (THz) frequency bands is a promising solution for achieving extremely high data rates in next-generation wireless networks. While the THz communication is conventionally envisioned for short-range wireless applications due to the high atmospheric absorption at THz frequencies, multi-hop directional transmissions can be enabled to extend the communication range. However, to realize multi-hop THz communications, conventional beam training schemes, such as exhaustive search or hierarchical methods with a fixed number of training levels, can lead to a very large time overhead. To address this challenge, in this paper, a novel hierarchical beam training scheme with dynamic training levels is proposed to optimize the performance of multi-hop THz links. In fact, an optimization problem is formulated to maximize the overall spectral efficiency of the multi-hop THz link by dynamically and jointly selecting the number of beam training levels across all the constituent single-hop links. To solve this problem in presence of unknown channel state information, noise, and path loss, a new reinforcement learning solution based on the multi-armed bandit (MAB) is developed. Simulation results show the fast convergence of the proposed scheme in presence of random channels and noise. The results also show that the proposed scheme can yield up to 75% performance gain, in terms of spectral efficiency, compared to the conventional hierarchical beam training with a fixed number of training levels.

Future wireless cellular networks must support both enhanced mobile broadband (eMBB) and ultra-reliable low-latency communications (URLLC) to manage heterogeneous data traffic for emerging wireless services. To achieve this goal, a promising technique is to enable flexible frame structure by dynamically changing the data frame's numerology according to the channel information as well as traffic quality-of-service requirements. However, due to non-orthogonal subcarriers, this technique can result in an interference, known as inter numerology interference (INI), thus, degrading the network performance. In this work, a novel framework is proposed to analyze the INI in the uplink cellular communications. In particular, a closed-form expression is derived for the INI power in the uplink with a flexible frame structure and a new resource allocation problem is formulated to maximize the network spectral efficiency (SE) by jointly optimizing the power allocation and numerology selection in a multi-user uplink scenario. The simulation results validate the derived theoretical INI analyses and provide guidelines for the power allocation and numerology selection.

On the path towards fully connected and automated vehicles, two sets of technologies are under consideration for enabling short-range vehicle-to-everything (V2X) communications within the intelligent transport system (ITS) band around 5.9 GHz. The first group of technologies includes IEEE 802.11p plus its upcoming evolution IEEE 802.11bd. The second group includes the 3rd generation partnership project (3GPP)-defined sidelink cellular-V2X (C-V2X) standards. However, the coexistence of these technologies and the resulting interference pose new challenges for guaranteeing reliable operation in emerging vehicular networks. In this work, we investigate the impact of the interference resulting from C-V2X transmission on the sensing procedure of IEEE 802.11p/bd. To this end, we develop a detection framework based on clear channel assessment (CCA) mechanism in the IEEE 802.//p/bd network under the assumption of Rayleigh distribution channel fading; where we employed stochastic geometry and the characteristic function approach. It is shown through analytical evaluations that a lower threshold than the one defined in the specifications could better cope with the received interference without sensibly increasing the impact of false alarms.

Unmanned aerial vehicle (UAV) swarms must exploit machine learning (ML) in order to execute various tasks ranging from coordinated trajectory planning to cooperative target recognition. However, due to the lack of continuous connections between the UAV swarm and ground base stations (BSs), using centralized ML will be challenging, particularly when dealing with a large volume of data. In this paper, a novel framework is proposed to implement distributed federated learning (FL) algorithms within a UAV swarm that consists of a leading UAV and several following UAVs. Each following UAV trains a local FL model based on its collected data and then sends this trained local model to the leading UAV who will aggregate the received models, generate a global FL model, and transmit it to followers over the intra-swarm network. To identify how wireless factors, like fading, transmission delay, and UAV antenna angle deviations resulting from wind and mechanical vibrations, impact the performance of FL, a rigorous convergence analysis for FL is performed. Then, a joint power allocation and scheduling design is proposed to optimize the convergence rate of FL while taking into account the energy consumption during convergence and the delay requirement imposed by the swarm's control system. Simulation results validate the effectiveness of the FL convergence analysis and show that the joint design strategy can reduce the number of communication rounds needed for convergence by as much as 35% compared with the baseline design.

In this paper, the problem of enhancing the virtual reality (VR) experience for wireless users is investigated by minimizing the occurrence of breaks in presence (BIP) that can detach the users from their virtual world. To measure the BIP for wireless VR users, a novel model that jointly considers the VR application type, transmission delay, VR video quality, and users' awareness of the virtual environment is proposed. In the developed model, base stations (BSs) transmit VR videos to the wireless VR users using directional transmission links so as to provide high data rates for the VR users, thus, reducing the number of BIP for each user. Since the body movements of a VR user may result in a blockage of its wireless link, the location and orientation of VR users must also be considered when minimizing BIP. The BIP minimization problem is formulated as an optimization problem which jointly considers the predictions of users' locations, orientations, and their BS association. To predict the orientation and locations of VR users, a distributed learning algorithm based on the machine learning framework of deep echo state networks (ESNs) is proposed. The proposed algorithm uses federated learning to enable multiple BSs to locally train their deep ESNs using their collected data and cooperatively build a learning model to predict the entire users' locations and orientations. Using these predictions, the user association policy that minimizes BIP is derived. Simulation results demonstrate that the developed algorithm reduces the users' BIP by up to 16% and 26%, respectively, compared to centralized ESN and deep learning algorithms.

In this paper, the problem of enhancing the virtual reality (VR) experience for wireless users is investigated by minimizing the occurrence of breaks in presence (BIPs) that can detach the users from their virtual world. To measure the BIPs for wireless VR users, a novel model that jointly considers the VR applications, transmission delay, VR video quality, and users' awareness of the virtual environment is proposed. In the developed model, the base stations (BSs) transmit VR videos to the wireless VR users using directional transmission links so as to increase the data rate of VR users, thus, reducing the number of BIPs for each user. Therefore, the mobility and orientation of VR users must be considered when minimizing BIPs, since the body movements of a VR user may result in blockage of its wireless link. The BIP problem is formulated as an optimization problem which jointly considers the predictions of users' mobility patterns, orientations, and their BS association. To predict the orientation and mobility patterns of VR users, a distributed learning algorithm based on the machine learning framework of deep echo state networks (ESNs) is proposed. The proposed algorithm uses concept from federated learning to enable multiple BSs to locally train their deep ESNs using their collected data and cooperatively build a learning model to predict the entire users' mobility patterns and orientations. Using these predictions, the user association policy that minimizes BIPs is derived. Simulation results demonstrate that the developed algorithm reduces the users' BIPs by up to 16% and 26%, respectively, compared to centralized ESN and deep learning algorithms.

Vehicular networks will play an important role in enhancing road safety, improving transportation efficiency, and providing seamless Internet service for users on the road. Reaping the benefit of vehicular networks is contingent upon meeting stringent wireless communication performance requirements, particularly in terms of delay and reliability. In this paper, a dependence control mechanism is proposed to improve the overall reliability of vehicular networks. In particular, the dependence between the communication delays of different vehicle-to-vehicle (V2V) links is first modeled. Then, the concept of a concordance order, stemming from stochastic ordering theory, is introduced to show that a higher dependence can lead to a better reliability. Using this insight, a power allocation problem is formulated to maximize the concordance, thereby optimizing the overall communication reliability of the V2V system. To obtain an efficient solution to the power allocation problem, a dual update method is introduced. Simulation results verify the effectiveness of performing dependence control for reliability optimization in a vehicular network, and show that the proposed mechanism can achieve up to 25% reliability gain compared to a baseline system that uses a random power allocation.

Connected and autonomous vehicles (CAVs) are able to improve on-road safety and provide convenience in our daily lives. To perform autonomous path tracking and navigation, CAVs can exploit vehicle-to-everything (V2X) communications to determine their vehicle dynamics parameters, such as location, heading angle, and curvature, which can be then used as inputs to their control system. However, the interference and uncertainty of the wireless channels can increase the transmission delay on the vehicle dynamics and, thus, impair the CAV's ability to track its target path. In this paper, the problem of joint communication network and control system design is studied to solve the path tracking problem for CAVs. In particular, a novel approach is proposed to maximize the number of reliable V2X transmitter-receiver pairs while jointly considering the stability of the controller and the state of the wireless network. Based on the joint design, the maximum transmission delay which can prevent instability in the controller is determined. Then, the reliable V2X links maximization problem is decomposed into two equivalent sub-problems. The first sub-problem is the control mechanism design in which a dual update method is used to determine the headway distance parameter for the control system. The second sub-problem uses the outcome of the first sub-problem to optimize the power allocation for the communication system. To solve this power allocation problem, a novel risk-based approach that uses the so-called conditional value at risk (CVaR) from financial engineering is proposed. Simulation results validate the theoretical results and show that the proposed joint design can improve the number of reliable V2X pairs by as much as 70% compared to a baseline scheme that optimizes the communication and control systems independently.

Development of autonomous and self-driving vehicles requires agile and reliable services to manage hazardous road situations. Vehicular Network is the medium that can provide high-quality services for self-driving vehicles. The majority of service requests in Vehicular Networks are delay intolerant (e.g., hazard alerts, lane change warning) and require immediate service. Therefore, Vehicular Networks, and particularly, Vehicle-to-Infrastructure (V2I) systems must provide a consistent real-time response to autonomous vehicles. During peak hours or disasters, when a surge of requests arrives at a Base Station, it is challenging for the V2I system to maintain its performance, which can lead to hazardous consequences. Hence, the goal of this research is to develop a V2I system that is robust against uncertain request arrivals. To achieve this goal, we propose to dynamically allocate service requests among Base Stations. We develop an uncertainty-aware resource allocation method for the federated environment that assigns arriving requests to a Base Station so that the likelihood of completing it on-time is maximized. We evaluate the system under various workload conditions and oversubscription levels. Simulation results show that edge federation can improve robustness of the V2I system by reducing the overall service miss rate by up to 45%.

Autonomous vehicular platoons will play an important role in improving on-road safety in tomorrow’s smart cities. Vehicles in an autonomous platoon can exploit vehicle-to-vehicle (V2V) communications to collect environmental information so as to maintain the target velocity and inter-vehicle distance. However, due to the uncertainty of the wireless channel, V2V communications within a platoon will experience a wireless system delay. Such system delay can impair the vehicles’ ability to stabilize their velocity and distances within their platoon. In this paper, the problem of integrated communication and control system is studied for wireless connected autonomous vehicular platoons. In particular, a novel framework is proposed for optimizing a platoon’s operation while jointly taking into account the delay of the wireless V2V network and the stability of the vehicle’s control system. First, stability analysis for the control system is performed and the maximum wireless system delay requirements which can prevent the instability of the control system are derived. Then, delay analysis is conducted to determine the end-to-end delay, including queuing, processing, and transmission delay for the V2V link in the wireless network. Subsequently, using the derived wireless delay, a lower bound and an approximated expression of the reliability for the wireless system, defined as the probability that the wireless system meets the control system’s delay needs, are derived. Then, the parameters of the control system are optimized in a way to maximize the derived wireless system reliability. Simulation results corroborate the analytical derivations and study the impact of parameters, such as the packet size and the platoon size, on the reliability performance of the vehicular platoon. More importantly, the simulation results shed light on the benefits of integrating control system and wireless network design while providing guidelines for designing an autonomous platoon so as to realize the required wireless network reliability and control system stability.

Device-to-device (D2D) communication is a promising approach to efficiently disseminate critical or viral information. Reaping the benefits of D2D-enabled networks is contingent upon choosing the optimal content dissemination policy subject to resource and user distribution constraints. In this paper, a novel D2D network analysis framework is proposed to study the impacts of frequently occurring subgraphs, known as motifs, on D2D network performance and to determine an effective content dissemination strategy. In the proposed framework, the distribution of devices in the D2D network is modeled as a Thomas cluster process (TCP), and two graph structures, the star, and chain motifs, are studied in the communication graph. Based on the properties of the TCP, the closed-form analytical expressions for the statistical significance, the outage probability, as well as the average throughput per device, are derived. The simulation results corroborate the analytical derivations and show the influence of different system topologies on the occurrence of motifs and the D2D system throughput. More importantly, the results highlight that, as the statistical significance of motifs increases, the system throughput will initially increase and then subsequently decreases. Hence, the network operators can obtain statistical significance regions for chain and star motifs that map to the optimal content dissemination performance. Furthermore, using the obtained regions and the analytical expressions for statistical significance, network operators can effectively identify which clusters of devices can be leveraged for D2D communications while determining the number of serving devices in each identified cluster.

Autonomous inspection of large geographical areas is a central requirement for efficient hazard detection and disaster management in future cyber-physical systems such as smart cities. In this regard, exploiting unmanned aerial vehicle (UAV) swarms is a promising solution to inspect vast areas efficiently and with low cost. In fact, UAVs can easily fly and reach inspection points, record surveillance data, and send this information to a wireless base station (BS). Nonetheless, in many cases, such as operations at remote areas, the UAVs cannot be guided directly by the BS in real- time to find their path. Moreover, another key challenge of inspection by UAVs is the limited battery capacity. Thus, realizing the vision of autonomous inspection via UAVs requires \emph{energy-efficient path planning} that takes into account the energy constraint of each individual UAV. In this paper, a novel path planning algorithm is proposed for performing energy-efficient inspection, under stringent energy availability constraints for each UAV. The developed framework takes into account all aspects of energy consumption for a UAV swarm during the inspection operations, including energy required for flying, hovering, and data transmission. It is shown that the proposed algorithm can address the path planning problem efficiently in polynomial time. Simulation results show that the proposed algorithm can yield substantial performance gains in terms of minimizing the overall inspection time and energy. Moreover, the results provide guidelines to determine parameters such as the number of required UAVs and amount of energy, while designing an autonomous inspection system.

Ultra reliable, low latency vehicle-to- infrastructure (V2I) communications is a key requirement for seamless operation of autonomous vehicles (AVs) in future smart cities. To this end, cellular small base stations (SBSs) with edge computing capabilities can reduce the end-to-end (E2E) service delay by processing requested tasks from AVs locally, without forwarding the tasks to a remote cloud server. Nonetheless, due to the limited computational capabilities of the SBSs, coupled with the scarcity of the wireless bandwidth resources, minimizing the E2E latency for AVs and achieving a reliable V2I network is challenging. In this paper, a novel algorithm is proposed to jointly optimize AVs-to-SBSs association and bandwidth allocation to maximize the reliability of the V2I network. By using tools from labor matching markets, the proposed framework can effectively perform distributed association of AVs to SBSs, while accounting for the latency needs of AVs as well as the limited computational and bandwidth resources of SBSs. Moreover, the convergence of the proposed algorithm to a core allocation between AVs and SBSs is proved and its ability to capture interdependent computational and transmission latencies for AVs in a V2I network is characterized. Simulation results show that by optimizing the E2E latency, the proposed algorithm substantially outperforms conventional cell association schemes, in terms of service reliability and latency.

Vehicle platoons will play an important role in improving on-road safety in tomorrow's smart cities. Vehicles in a platoon can exploit vehicle- to-vehicle (V2V) communications to collect information, such as velocity and acceleration, from surrounding vehicles so as to coordinate their operations and maintain the target velocity and inter-vehicle distance required by the platoon. However, due to the interference and uncertainty of the wireless channel, V2V communications within a platoon will experience a wireless transmission delay which can impair the vehicles' ability to stabilize their speed and distances within their platoon. In this paper, the problem of integrated communication and control is studied for wireless-connected platoons. In particular, a novel approach is proposed for optimizing a platoon's stability while taking into account, jointly, the state of the wireless V2V network and the stability of the platoon's control system. Based on the proposed integrated communication and control strategy, the plant and string stability for the platoon are analyzed. The signal-to-interference-plus-noise-ratio (SINR) threshold, which will prevent the instability of the control system, is also determined. Moreover, the reliability of the wireless system, defined as the probability that the wireless system meets the control system's delay needs, is derived. Simulation results shed light on the benefits of the proposed approach and the synergies between the wireless network and the platoon's control system.

One of the most promising approaches to overcoming the uncertainty of millimeter wave (mm-wave) communications is to deploy dual-mode small base stations (SBSs) that integrate both mm-wave and microwave (μW) frequencies. In this paper, a novel approach to analyzing and managing mobility in joint mmwave-μW networks is proposed. The proposed approach leverages device-level caching along with the capabilities of dual-mode SBSs to minimize handover failures and reduce inter-frequency measurement energy consumption. First, fundamental results on the caching capabilities are derived for the proposed dual-mode network scenario. Second, the impact of caching on the number of handovers (HOs), energy consumption, and the average handover failure (HOF) is analyzed. Then, the proposed cache-enabled mobility management problem is formulated as a dynamic matching game between mobile user equipments (MUEs) and SBSs. The goal of this game is to find a distributed HO mechanism that, under network constraints on HOFs and limited cache sizes, allows each MUE to choose between: 1) executing an HO to a target SBS; 2) being connected to the macrocell base station; or 3) perform a transparent HO by using the cached content. To solve this dynamic matching problem, a novel algorithm is proposed and its convergence to a two-sided dynamically stable HO policy for MUEs and target SBSs is proved. Numerical results corroborate the analytical derivations and show that the proposed solution will significantly reduce both the HOF and energy consumption of MUEs, resulting in an enhanced mobility management for heterogeneous wireless networks with mm-wave capabilities.

Millimeter wave (mmW) communications at the 60 GHz unlicensed band is seen as a promising approach for boosting the capacity of wireless local area networks (WLANs). If properly integrated into legacy IEEE 802.11 standards, mmW communications can offer substantial gains by offloading traffic from congested sub-6 GHz unlicensed bands to the 60 GHz mmW frequency band. In this paper, a novel medium access control (MAC) is proposed to dynamically manage the WLAN traffic over the unlicensed mmW and sub-6 GHz bands. The proposed protocol leverages the capability of advanced multi-band wireless stations (STAs) to perform fast session transfers (FST) to the mmW band, while considering the intermittent channel at the 60 GHz band and the level of congestion observed over the sub-6 GHz bands. The performance of the proposed scheme is analytically studied via a new Markov chain model and the probability of transmissions over the mmW and sub-6 GHz bands, as well as the aggregated saturation throughput are derived. In addition, analytical results are validated by simulation results. Simulation results show that the proposed integrated mmW-sub 6 GHz MAC protocol yields significant performance gains, in terms of maximizing the saturation throughput and minimizing the delay experienced by the STAs. The results also shed light on the tradeoffs between the achievable gains and the overhead introduced by the FST procedure.

One of the most promising approaches to overcome the uncertainty and dynamic channel variations of millimeter wave (mmW) communications is to deploy dual-mode base stations that integrate both mmW and microwave (μW) frequencies. In particular, if properly designed, such dual-mode base stations can enhance mobility and handover in highly mobile wireless environments. In this paper, a novel approach for analyzing and managing mobility in joint μW-mmW networks is proposed. The proposed approach leverages device-level caching along with the capabilities of dual-mode base stations to minimize handover failures and provide seamless mobility. First, fundamental results on the caching capabilities, including caching probability and cache duration, are derived for the proposed dual-mode network scenario. Second, the average achievable rate of caching is derived for mobile users. Then, the impact of caching on the number of handovers (HOs) and the average handover failure (HOF) is analyzed. The derived analytical results suggest that content caching will reduce the HOF and enhance the mobility management in heterogeneous wireless networks with mmW capabilities. Numerical results corroborate the analytical derivations and show that the proposed solution provides significant reductions in the average HOF, reaching up to 45%, for mobile users moving with relatively high speeds.

The use of dual-mode base stations that can jointly exploit millimeter wave (mmW) and microwave (μW) resources is a promising solution for overcoming the uncertainty of the mmW environment. In this paper, a novel dual-mode scheduling framework is proposed that jointly performs user applications (UAs) selection and scheduling over μW and mmW bands. The proposed scheduling framework allows multiple UAs to run simultaneously on each user equipment (UE) and utilizes a set of context information, including the channel state information per UE, the delay tolerance and required load per UA, and the uncertainty of mmW channels, to maximize the quality-of-service (QoS) per UA. The dual-mode scheduling problem is then formulated as an optimization problem with minimum unsatisfied relations problem, which is shown to be challenging to solve. Consequently, a long-term scheduling framework, consisting of two stages, is proposed. Within this framework, first, the joint UA selection and scheduling over the μW band is formulated as a one-to-many matching game between the μW resources and UAs. To solve this problem, a novel scheduling algorithm is proposed and shown to yield a two-sided stable resource allocation. Second, over the mmW band, the joint contextaware UA selection and scheduling problem is formulated as a 0-1 Knapsack problem and a novel algorithm that builds on the Q-learning algorithm is proposed to find a suitable mmW scheduling policy while adaptively learning the UEs' line-of-sight probabilities. Furthermore, it is shown that the proposed scheduling framework can find an effective scheduling solution, over both μW and mmW, in polynomial time. Simulation results show that, compared with conventional scheduling schemes, the proposed approach significantly increases the number of satisfied UAs while improving the statistics of QoS violations and enhancing the overall users' quality-of-experience.

In this paper, a novel framework is proposed for optimizing the operation and performance of a large-scale multi-hop millimeter wave (mmW) backhaul within a wireless small cell network having multiple mobile network operators (MNOs). The proposed framework enables the small base stations to jointly decide on forming the multi-hop, mmW links over backhaul infrastructure that belongs to multiple, independent MNOs, while properly allocating resources across those links. In this regard, the problem is addressed using a novel framework based on matching theory composed of two, highly inter-related stages: a multi-hop network formation stage and a resource management stage. One unique feature of this framework is that it jointly accounts for both wireless channel characteristics and economic factors during both network formation and resource management. The multi-hop network formation stage is formulated as a one-to-many matching game, which is solved using a novel algorithm, that builds on the so-called deferred acceptance algorithm and is shown to yield a stable and Pareto optimal multi-hop mmW backhaul network. Then, a one-to-many matching game is formulated to enable proper resource allocation across the formed multi-hop network. This game is then shown to exhibit peer effects and, as such, a novel algorithm is developed to find a stable and optimal resource management solution that can properly cope with these peer effects. Simulation results show that, with manageable complexity, the proposed framework yields substantial gains, in terms of the average sum rate, reaching up to 27% and 54%, respectively, compared with a non-cooperative scheme in which inter-operator sharing is not allowed and a random allocation approach. The results also show that our framework improves the statistics of the backhaul sum rate and provides insights on how to manage pricing and the cost of the cooperative mmW backhaul network for the MNOs.

The integration of millimeter-wave base stations (mmW-BSs) with conventional microwave base stations (μW-BSs) is a promising solution for enhancing the quality-of-service (QoS) of emerging 5G networks. However, the significant differences in the signal propagation characteristics over the mmW and μW frequency bands will require novel cell association schemes cognizant of both mmW and μW systems. In this paper, a novel cell association framework is proposed that considers both the blockage probability and the achievable rate to assign user equipments (UEs) to mmW-BSs or μW-BSs. The problem is formulated as a one-to-many matching problem with minimum quota constraints for the BSs that provides an efficient way to balance the load over the mmW and μW frequency bands. To solve the problem, a distributed algorithm is proposed that is guaranteed to yield a Pareto optimal and two-sided stable solution. Simulation results show that the proposed matching with minimum quota (MMQ) algorithm outperforms the conventional max-RSSI and max-SINR cell association schemes. In addition, it is shown that the proposed MMQ algorithm can effectively balance the number of UEs associated with the μW-BSs and mmW-BSs and achieve further gains, in terms of the average sum rate.

One of the most promising approaches to overcome the drastic channel variations of millimeter wave (mmW) communications is to deploy dual-mode base stations that integrate both mmW and microwave (pW) frequencies. Reaping the benefits of a dual-mode operation requires scheduling mechanisms that can allocate resources efficiently and jointly at both frequency bands. In this paper, a novel resource allocation framework is proposed that exploits users' context, in terms of user application (UA) delay requirements, to maximize the quality-of-service (QoS) of a dual-mode base station. In particular, such a context-aware approach enables the network to dynamically schedule UAs, instead of users, thus providing more precise delay guarantees and a more efficient exploitation of the mmW resources. The scheduling of UAs is formulated as a one-to-many matching problem between UAs and resources and a novel algorithm is proposed to solve it. The proposed algorithm is shown to converge to a two-sided stable matching between UAs and network resources. Simulation results show that the proposed approach outperforms classical CSI-based scheduling in terms of the per UA QoS, yielding up to 36% improvement. The results also show that exploiting mmW resources provides significant traffic offloads reaching up to 43% from μW band.

Designing cost-effective and scalable backhaul solutions is one of the main challenges for emerging wireless small cell networks (SCNs). In this regard, millimeter wave (mmW) communication technologies have recently emerged as an attractive solution to realize the vision of a high-speed and reliable wireless small cell backhaul network (SCBN). In this paper, a novel approach is proposed for managing the spectral resources of a heterogeneous SCBN that can exploit simultaneously mmW and conventional frequency bands via carrier aggregation. In particular, a new SCBN model is proposed in which small cell base stations (SCBSs) equipped with broadband fiber backhaul allocate their frequency resources to SCBSs with wireless backhaul, by using aggregated bands. One unique feature of the studied model is that it jointly accounts for both wireless channel characteristics and economic factors during resource allocation. The problem is then formulated as a one-to-many matching game and a distributed algorithm is proposed to find a stable outcome of the game. The convergence of the algorithm is proven and the properties of the resulting matching are studied. Simulation results show that under the constraints of wireless backhauling, the proposed approach achieves substantial performance gains, reaching up to 30% compared to a conventional best-effort approach.

In this paper, a novel approach for optimizing resource allocation in wireless small cell networks (SCNs) with device-to-device (D2D) communication is proposed. The proposed approach allows jointly exploiting the wireless and social context of wireless users for optimizing the overall allocation of resources and improving the traffic offload in SCNs. This context-aware resource allocation problem is formulated as a matching game, in which user equipments (UEs) and resource blocks (RBs) rank one another, based on utility functions that capture both wireless and social metrics. Due to social interrelations, this game is shown to belong to a class of matching games with peer effects. To solve this game, a novel self-organizing algorithm is proposed, using which UEs and RBs can interact to decide on their desired allocation. The proposed algorithm is then proven to converge to a two-sided stable matching between UEs and RBs. The properties of the resulting stable outcome are then studied and assessed. Simulation results using real social data show that clustering of socially connected users allows offloading a substantially larger amount of traffic than the conventional context-unaware approach. These results show that exploiting social context has high practical relevance in saving resources on wireless links and in the backhaul.

The deployment of small cells, overlaid on existing cellular infrastructure, is seen as a key feature in next-generation cellular systems. In this paper, the problem of user association in the downlink of small cell networks (SCNs) is considered. The problem is formulated as a many-to-one matching game in which the users and SCBSs rank one another based on utility functions that account for both the achievable performance, in terms of rate and fairness to cell edge users, as captured by newly proposed priorities. To solve this game, a novel distributed algorithm that can reach a stable matching is proposed. Simulation results show that the proposed approach yields an average utility gain of up to 65% compared to a common association algorithm that is based on received signal strength. Compared to the classical deferred acceptance algorithm, the results also show a 40% utility gain and a more fair utility distribution among the users.