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.  more » « less
Award ID(s):
1811497 1811720 1802710
NSF-PAR ID:
10161677
Author(s) / Creator(s):
; ; ; ; ; ;
Date Published:
Journal Name:
ICC 2019 - 2019 IEEE International Conference on Communications (ICC)
Page Range / eLocation ID:
1 to 7
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. The development of communication technologies in edge computing has fostered progress across various applications, particularly those involving vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication. Enhanced infrastructure has improved data transmission network availability, promoting better connectivity and data collection from IoT devices. A notable IoT application is with the Intelligent Transportation System (ITS). IoT technology integration enables ITS to access a variety of data sources, including those pertaining to weather and road conditions. Real-time data on factors like temperature, humidity, precipitation, and friction contribute to improved decision-making models. Traditionally, these models are trained at the cloud level, which can lead to communication and computational delays. However, substantial advancements in cloud-to-edge computing have decreased communication relays and increased computational distribution, resulting in faster response times. Despite these benefits, the developments still largely depend on central cloud sources for computation due to restrictions in computational and storage capacity at the edge. This reliance leads to duplicated data transfers between edge servers and cloud application servers. Additionally, edge computing is further complicated by data models predominantly based on data heuristics. In this paper, we propose a system that streamlines edge computing by allowing computation at the edge, thus reducing latency in responding to requests across distributed networks. Our system is also designed to facilitate quick updates of predictions, ensuring vehicles receive more pertinent safety-critical model predictions. We will demonstrate the construction of our system for V2V and V2I applications, incorporating cloud-ware, middleware, and vehicle-ware levels. 
    more » « less
  2. 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. 
    more » « less
  3. 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, it 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. 
    more » « less
  4. Occlusion is a critical problem in the Autonomous Driving System. Solving this problem requires robust collaboration among autonomous vehicles traveling on the same roads. However, transferring the entirety of raw sensors' data among autonomous vehicles is expensive and can cause a delay in communication. This paper proposes a method called Realtime Collaborative Vehicular Communication based on Bird's-Eye-View (BEV) map. The BEV map holds the accurate depth information from the point cloud image while its 2D representation enables the method to use a novel and well-trained image-based backbone network. Most importantly, we encode the object detection results into the BEV representation to reduce the volume of data transmission and make real-time collaboration between autonomous vehicles possible. The output of this process, the BEV map, can also be used as direct input to most route planning modules. Numerical results show that this novel method can increase the accuracy of object detection by cross-verifying the results from multiple points of view. Thus, in the process, this new method also reduces the object detection challenges that stem from occlusion and partial occlusion. Additionally, different from many existing methods, this new method significantly reduces the data needed for transfer between vehicles, achieving a speed of 21.92 Hz for both the object detection process and the data transmission process, which is sufficiently fast for a real-time system. 
    more » « less
  5. There has been recent work on the design of antenna arrays for beamforming in dynamic evolving environments such as in vehicle-to-vehicle communication systems. A key problem is that of determining how to optimally use a large antenna array to communicate with multiple spatially located vehicles in dynamically changing channel conditions with minimal co-channel interference while minimizing overall power consumption of the wireless system. We envision disjoint subsets of antennas in the array being used to direct beams concurrently to different vehicles. The number of antennas, gain and phase of each RF-chain driving an antenna are optimized dynamically using a constrained quadratic cost formulation encompassing channel quality, interference and power consumption. This quadratic optimization problem is solved using behavior constrained bandit algorithm, a reinforcement learning based technique. A gaussian kernel is used to perform data clustering of vehicle environment and resulting solutions, allowing quick bootstrapping of the bandit solver to find optimal array configurations in real-time vehicle environments. Simulation studies prove the viability of the proposed scheme. 
    more » « less