PYRAMID: Probabilistic Content Reconciliation and Prioritization for V2V Communications

被引:3
作者
Yu, Bo [1 ]
Bai, Fan [1 ]
机构
[1] Gen Motors Res & Dev, Warren, MI 48092 USA
关键词
Vehicle-to-vehicle communication; content reconciliation; P2P resource discovery; VEHICULAR NETWORKS;
D O I
10.1109/TVT.2018.2815925
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Emerging vehicle-to-vehicle communication technologies, such as dedicated short range communications (DSRC), offer unique opportunities to realize wireless peer-to-peer systems for vehicles. A critical component in a vehicular peer-to-peer system is an efficient content reconciliation mechanism, which guides two communicating vehicles to match their interests, prioritize task execution, and ensure redundant contents not to be exchanged. In this paper, we propose PYRAMID, a multilayer probabilistic abstraction framework, to efficiently abstract and approximate contents with different granularity. Using the multilayer Pyramid data structures, a vehicle is able to quickly get an impression of the contents on the other vehicle before the costly massive content exchange process starts. Particularly, the coarse-granularity layer estimates the contribution from potential transaction partners so that tasks could be prioritized accordingly; the fine-granularity layer helps conduct membership tests, to avoid transmitting redundant contents. Using a fleet of research vehicles equipped with DSRC radios, we experimentally demonstrate that, across a rich variety of scenarios, PYRAMID improves the utility value of content exchanges by 20%-30% and improves effective throughput by at least 25%, while only incurring a minimal computational overhead.
引用
收藏
页码:6615 / 6626
页数:12
相关论文
共 30 条
[1]   The space complexity of approximating the frequency moments [J].
Alon, N ;
Matias, Y ;
Szegedy, M .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 58 (01) :137-147
[2]  
Angius Fabio., 2012, Proceedings of the 1st ACM workshop on Emerging Name-Oriented Mobile Networking Design - Architecture, Algorithms, and Applications, NoM '12, P25, DOI [10.1145/2248361.2248369, DOI 10.1145/2248361.2248369]
[3]  
[Anonymous], 2017, DSRC DEDICATED SHORT
[4]  
[Anonymous], 2018, WIFI DIRECT
[5]  
[Anonymous], 2002, MATHEMATICS-BASEL
[6]  
[Anonymous], 2011, HDB RES MOBILITY COM
[7]  
[Anonymous], 2018, QUALCOMM ALLJOYN PEE
[8]  
[Anonymous], P COMPR COMPL SEQ 19
[9]  
Bar-Yossef Z., 2002, Randomization and Approximation Techniques in Computer Science. 6th International Workshop, RANDOM 2002. Proceedings (Lecture Notes in Computer Science Vol.2483), P1
[10]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&