skip to main content

Title: Low Latency Scalable Point Cloud Communication in VANETs using V2I Communication
Mobile edge and vehicle-based depth sending and real-time point cloud communication is an essential subtask enabling autonomous driving. In this paper, we propose a framework for point cloud multicast in VANETs using vehicle to infrastructure (V2I) communication. We employ a scalable Binary Tree embedded Quad Tree (BTQT) point cloud source encoder with bitrate elasticity to match with an adaptive random network coding (ARNC) to multicast different layers to the vehicles. The scalability of our BTQT encoded point cloud provides a trade-off in the received voxel size/quality vs channel condition whereas the ARNC helps maximize the throughput under a hard delay constraint. The solution is tested with the outdoor 3D point cloud dataset from MERL for autonomous driving. The users with good channel conditions receive a near lossless point cloud whereas users with bad channel conditions are still able to receive at least the base layer point cloud.
; ; ; ; ; ;
Award ID(s):
1811497 1811720 1802710
Publication Date:
Journal Name:
ICC 2019 - 2019 IEEE International Conference on Communications (ICC)
Page Range or eLocation-ID:
1 to 7
Sponsoring Org:
National Science Foundation
More Like this
  1. Collaborative perception enables autonomous driving vehicles to share sensing or perception data via broadcast-based vehicle-to-everything (V2X) communication technologies such as Cellular-V2X (C-V2X), hoping to enable accurate perception in face of inaccurate perception results by each individual vehicle. Nevertheless, the V2X communication channel remains a significant bottleneck to the performance and usefulness of collaborative perception due to limited bandwidth and ad hoc communication scheduling. In this paper, we explore challenges and design choices for V2X-based collaborative perception, and propose an architecture that lever-ages the power of edge computing such as road-side units for central communication scheduling. Using NS-3 simulations, we show the performance gap between distributed and centralized C-V2X scheduling in terms of achievable throughput and communication efficiency, and explore scenarios where edge assistance is beneficial or even necessary for collaborative perception.
  2. Gilbert, Seth (Ed.)
    Byzantine consensus is a classical problem in distributed computing. Each node in a synchronous system starts with a binary input. The goal is to reach agreement in the presence of Byzantine faulty nodes. We consider the setting where communication between nodes is modelled via an undirected communication graph. In the classical point-to-point communication model all messages sent on an edge are private between the two endpoints of the edge. This allows a faulty node to equivocate, i.e., lie differently to its different neighbors. Different models have been proposed in the literature that weaken equivocation. In the local broadcast model, every message transmitted by a node is received identically and correctly by all of its neighbors. In the hypergraph model, every message transmitted by a node on a hyperedge is received identically and correctly by all nodes on the hyperedge. Tight network conditions are known for each of the three cases. We introduce a more general model that encompasses all three of these models. In the local multicast model, each node u has one or more local multicast channels. Each channel consists of multiple neighbors of u in the communication graph. When node u sends a message on a channel, itmore »is received identically by all of its neighbors on the channel. For this model, we identify tight network conditions for consensus. We observe how the local multicast model reduces to each of the three models above under specific conditions. In each of the three cases, we relate our network condition to the corresponding known tight conditions. The local multicast model also encompasses other practical network models of interest that have not been explored previously, as elaborated in the paper.« less
  3. As communication technologies develop, an au- tonomous vehicle will receive information not only from its own sensing system but also from infrastructures and other vehicles through communication. This paper discusses how to exploit a sequence of future information that is shared among autonomous vehicles, including the planned positions, the velocities and the lane numbers. A hybrid system model is constructed, and a control policy is designed to utilize shared sequence information for making navigation decisions. For the high-level discrete state transitions, the shared information is used to determine when to change lane, if lane changing will bring reward for the autonomous vehicle and there exists a feasible continuous state controller. For the low-level continuous state space controller generation, the shared information can relax the safety interval constraints in the existing model predictive control method. In the system level, the information sharing can increase the traffic flow and improve driving comfort. We demonstrate the advantages of information sharing in control and navigation in simulation.
  4. Self-driving vehicles will need low-latency and high-capacity vehicular communication for acquiring wider view of their surroundings. Such vehicle-to-vehicle communication can be indirectly supported in some circumstances (e.g., if blocked) through adjacent road side units (RSUs). RSUs will be acting as full-duplex repeaters among the vehicles to ensure low latency and high data rate. However, full-duplex repeaters result in self-interference phenomenon which can degrade the reliability of the communication links. In this work, we aim to enhance the reliability of full-duplex repeaters by canceling out the self-interference impact, and applying a beamforming scheme that is matched to the source-destination composite channel. We show that the proposed self-interference cancellation and beamforming (SICAB) algorithm significantly reduces the error rate for low-isolated repeaters. Finally, we illustrate the impact of the repeater isolation capability on the performance of the proposed SICAB algorithm.
  5. Emergent vehicles will support a variety of connected applications, where a vehicle communicates with other vehicles or with the infrastructure to make a variety of decisions. Cooperative connected applications provide a critical foundational pillar for autonomous driving, and hold the promise of improving road safety, efficiency and environmental sustainability. However, they also induce a large and easily exploitable attack surface: an adversary can manipulate vehicular communications to subvert functionality of participating individual vehicles, cause catastrophic accidents, or bring down the transportation infrastructure. In this paper we outline a potential direction to address this critical problem through a resiliency framework, REDEM, based on machine learning. REDEM has several interesting features, including (1) smooth integration with the architecture of the underlying application, (2) ability to handle diverse communication attacks within the same underlying foundation, and (3) real-time detection and mitigation capability. We present the vision of REDEM, identify some key challenges to be addressed in its realization, and discuss the kind of evaluation/analysis necessary for its viability. We also present initial results from one instantiation of REDEM introducing resiliency in Cooperative Adaptive Cruise Control (CACC).