ar X iv : 1 70 4 . 06 89 4 v 1 [ cs . N I ] 2 3 A pr 2 01 7 Towards Low - Latency and Ultra - Reliable Vehicle - to - Vehicle Communication
نویسندگان
چکیده
Recently vehicle-to-vehicle (V2V) communication emerged as a key enabling technology to ensure traffic safety and other mission-critical applications. In this paper, a novel proximity and quality-of-service (QoS)-aware resource allocation for V2V communication is proposed. The proposed approach exploits the spatial-temporal aspects of vehicles in terms of their physical proximity and traffic demands, to minimize the total transmission power while considering queuing latency and reliability. Due to the overhead caused by frequent information exchange between vehicles and the roadside unit (RSU), the centralized problem is decoupled into two interrelated subproblems. First, a novel RSU-assisted virtual clustering mechanism is proposed to group vehicles in zones based on their physical proximity. Given the vehicles’ traffic demands and their QoS requirements, resource blocks are assigned to each zone. Second, leveraging techniques from Lyapunov stochastic optimization, a power minimization solution is proposed for each V2V pair within each zone. Simulation results for a Manhattan model have shown that the proposed scheme outperforms the baseline in terms of average queuing latency reduction up to 97% and significant improvement in reliability.
منابع مشابه
ar X iv : 1 21 0 . 20 35 v 1 [ cs . S Y ] 7 O ct 2 01 2 Synthesis of Reactive Protocols for Vehicle - to - Vehicle Communication – Technical Report
We present a synthesis method for communication protocols for active safety applications that satisfy certain formal specifications on quality of service requirements. The protocols are developed to provide reliable communication services for automobile active safety applications. The synthesis method transforms a specification into a distributed implementation of senders and receivers that tog...
متن کاملar X iv : 1 70 3 . 07 94 9 v 3 [ cs . C R ] 4 A pr 2 01 7 1 Anonymized Local Privacy Joshua Joy
In this paper, we introduce the family of Anonymized Local Privacy mechanisms. These mechanisms have an output space of multiple values (e.g.,“Yes”, “No”, or “⊥” (not participating)) and leverage the law of large numbers to generate linear noise in the number of data owners to protect privacy both before and after aggregation yet preserve accuracy. We describe the suitability in a distributed o...
متن کاملar X iv : 1 70 3 . 07 94 9 v 3 [ cs . C R ] 4 A pr 2 01 7 1 Anonymized Local Privacy
In this paper, we introduce the family of Anonymized Local Privacy mechanisms. These mechanisms have an output space of multiple values (e.g.,“Yes”, “No”, or “⊥” (not participating)) and leverage the law of large numbers to generate linear noise in the number of data owners to protect privacy both before and after aggregation yet preserve accuracy. We describe the suitability in a distributed o...
متن کاملCommunication Complexity of Correlated Equilibrium in Two-Player Games
We show a communication complexity lower bound for finding a correlated equilibrium of a two-player game. More precisely, we define a two-player N × N game called the 2cycle game and show that the randomized communication complexity of finding a 1/poly(N)approximate correlated equilibrium of the 2-cycle game is Ω(N). For small approximation values, this answers an open question of Babichenko an...
متن کاملIntroduction to Judea Pearl's Do-Calculus
This is a purely pedagogical paper with no new results. The goal of the paper is to give a fairly self-contained introduction to Judea Pearl’s do-calculus, including proofs of his 3 rules. 1 ar X iv :1 30 5. 55 06 v1 [ cs .A I] 2 6 A pr 2 01 3
متن کامل