skip to main content


Title: Full-Duplex Store-Carry-Forward scheme for Intermittently Connected Vehicular Networks
We consider intermittently connected vehicular networks (ICVNs) in which base stations (BSs) are installed along the highway to connect moving vehicles with internet. Due to the deployment cost, it is hard to cover the entire highway with BSs. To minimize the outage time in the uncovered area (UA), several cooperative store-carry-forward (CSCF) schemes have been proposed in which a vehicle is selected to act as a relay by buffering data to be relayed to a target vehicle in the UA. In this paper, we propose an energy-efficient full-duplex (FD) CSCF scheme that exploits the relay ability to receive and transmit simultaneously to improve the effective communication time, Te, between the relay and the target vehicle. Accordingly, it can minimize the outage time and deliver more data to the the target vehicle. In addition, the power allocation that minimizes the transmission cost (TC) under the required rates constraints is found. The problem is formulated as a geometric program (GP) and globally solved using the interior-point method. As compared to the half-duplex CSCF scheme, simulation results show that the proposed FD scheme offers more effective time, more successfully delivered data in the UA and lower TC.  more » « less
Award ID(s):
1816112
NSF-PAR ID:
10189580
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
2020 IEEE 91st Vehicular Technology Conference (VTC2020-Spring)
Page Range / eLocation ID:
1 to 6
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Full-duplex (FD) communication in many-antenna base stations (BSs) is hampered by self-interference (SI). This is because a FD node’s transmitting signal generates significant interference to its own receiver. Recent works have shown that it is possible to reduce/eliminate this SI in fully digital many-antenna systems, e.g., through transmit beamforming by using some spatial degrees of freedom to reduce SI instead of increasing the beamforming gain. On a parallel front, hybrid beamforming has recently emerged as a radio architecture that uses multiple antennas per FR chain. This can significantly reduce the cost of the end device (e.g., BS) but may also reduce the capacity or SI reduction gains of a fully digital radio system. This is because a fully digital radio architecture can change both the amplitude and phase of the wireless signal and send different data streams from each antenna element. Our goal in this paper is to quantify the performance gap between these two radio architectures in terms of SI cancellation and system capacity, particularly in multi-user MIMO setups. To do so, we experimentally compare the performance of a state-of-the-art fully digital many antenna FD solution to a hybrid beamforming architecture and compare the corresponding performance metrics leveraging a fully programmable many-antenna testbed and collecting over-the-air wireless channel data. We show that SI cancellation through beam design on a hybrid beamforming radio architecture can achieve capacity within 16% of that of a fully digital architecture. The performance gap further shrinks with a higher number of quantization bits in the hybrid beamforming system. 
    more » « less
  2. In this paper, we study an unmanned-aerial-vehicle (UAV) based full-duplex (FD) multi-user communication network, where a UAV is deployed as a multiple-input–multiple-output (MIMO) FD base station (BS) to serve multiple FD users on the ground. We propose a multi-objective optimization framework which considers two desirable objective functions, namely sum uplink (UL) rate maximization and sum downlink (DL) rate maximization while providing quality-of-service to all the users in the communication network. A novel resource allocation multi-objective-optimization-problem (MOOP) is designed which optimizes the downlink beamformer, the beamwidth angle, and the 3D position of the UAV, and also the UL power of the FD users. The formulated MOOP is a non-convex problem which is generally intractable. To handle the MOOP, a weighted Tchebycheff method is proposed, which converts the problem to the single-objective-optimization-problem (SOOP). Further, an alternative optimization approach is used, where SOOP is converted in to multiple sub-problems and optimization variables are operated alternatively. The numerical results show a trade-off region between sum UL and sum DL rate, and also validate that the considered FD system provides substantial improvement over traditional HD systems. 
    more » « less
  3. The Intelligent Transportation System has become one of the most globally researched topics, with Connected and Autonomous Vehicles(CAV) at its core. The CAV applications can be improved by the study of vehicle platooning immune to realtime traffic and vehicular network losses. In this work, we explore the need to integrate the Network model and Platooning system model for highway environments. The proposed platoon model is designed to be adaptive in length, providing the node vehicles to merge and exit. This overcomes the assumption that all the platoon nodes should have a common source and destination. The challenges of the existing platoon model, such as relay selection, acceleration threshold, are addressed for highly modular platoon design. The presented algorithm for merge and exit events optimizes the trade-off between network parameters such as communication range and vehicle dynamic parameters such as velocity and acceleration threshold. It considers the network bounds like SINR and link stability and vehicle trajectory parameters like the duration of the vehicle in the platoon. This optimizes the traffic throughput while maintaining stability using the PID controller. The work tries to increase the vehicle inclusion time in the platoon while preserving the overall traffic throughput. 
    more » « less
  4. Abstract

    Vehicle‐to‐Everything (V2X) communication has been proposed as a potential solution to improve the robustness and safety of autonomous vehicles by improving coordination and removing the barrier of non‐line‐of‐sight sensing. Cooperative Vehicle Safety (CVS) applications are tightly dependent on the reliability of the underneath data system, which can suffer from loss of information due to the inherent issues of their different components, such as sensors' failures or the poor performance of V2X technologies under dense communication channel load. Particularly, information loss affects the target classification module and, subsequently, the safety application performance. To enable reliable and robust CVS systems that mitigate the effect of information loss, a Context‐Aware Target Classification (CA‐TC) module coupled with a hybrid learning‐based predictive modeling technique for CVS systems is proposed. The CA‐TC consists of two modules: a Context‐Aware Map (CAM), and a Hybrid Gaussian Process (HGP) prediction system. Consequently, the vehicle safety applications use the information from the CA‐TC, making them more robust and reliable. The CAM leverages vehicles' path history, road geometry, tracking, and prediction; and the HGP is utilized to provide accurate vehicles' trajectory predictions to compensate for data loss (due to communication congestion) or sensor measurements' inaccuracies. Based on offline real‐world data, a finite bank of driver models that represent the joint dynamics of the vehicle and the drivers' behavior is learned. Offline training and online model updates are combined with on‐the‐fly forecasting to account for new possible driver behaviors. Finally, the framework is validated using simulation and realistic driving scenarios to confirm its potential in enhancing the robustness and reliability of CVS systems.

     
    more » « less
  5. Throughout the past decades, many different versions of the widely used first-order Cell-Transmission Model (CTM) have been proposed for optimal traffic control. Highway traffic management techniques such as Ramp Metering (RM) are typically designed based on an optimization problem with nonlinear constraints originating in the flow-density relation of the Fundamental Diagram (FD). Most of the extended CTM versions are based on the trapezoidal approximation of the flow-density relation of the Fundamental Diagram (FD) in an attempt to simplify the optimization problem. However, this relation is naturally nonlinear, and crude approximations can greatly impact the efficiency of the optimization solution. In this study, we propose a class of extended CTMs that are based on piecewise affine approximations of the flow-density relation such that (a) the integrated squared error with respect to the true relation is greatly reduced in comparison to the trapezoidal approximation, and (b) the optimization problem remains tractable for real-time application of ramp metering optimal controllers. A two-step identification method is used to approximate the FD with piecewise affine functions resulting in what we refer to as PWA-CTMs. The proposed models are evaluated by the performance of the optimal ramp metering controllers, e.g. using the widely used PI-ALINEA approach, in complex highway traffic networks. Simulation results show that the optimization problems based on the PWA-CTMs require less computation time compared to other CTM extensions while achieving higher accuracy of the flow and density evolution. Hence, the proposed PWA-CTMs constitute one of the best approximation approaches for first-order traffic flow models that can be used in more general and challenging modeling and control applications. 
    more » « less