Novel Efficient Coding Scheme for Data-Rate Limited Journey-Aware Graph-Data Transmission
Document Type
Conference Proceeding
Publication Date
6-1-2019
Abstract
How to efficiently transmit graph-data to mobile devices is quite appealing nowadays, especially for autonomous vehicles and positioning systems. When a mobile receiver is set out for a journey, the objective is often to reconstruct topologically-complete subgraphs according to the arrival data in real time. Hence, we dedicate a novel coding scheme to segmenting and arranging the data efficiently from a huge mesh-grid graph. When the data-rate is restricted, through our proposed partitioning and scheduling schemes, mobile receivers can greatly relax the requirement for the number of transmission times to reconstruct topologically-complete subgraphs. To evaluate our proposed techniques, we derive the expected number of transmission times required to reconstruct a subgraph theoretically. Moreover, we define the k-hop completeness to measure the probability of reconstructing a topologically-complete subgraph by any scheme. Our proposed new method greatly outperforms the conventional scheme theoretically and by simulation. Our proposed method can enable the future journey-aware dynamic mapping system on vehicles without any need of pre-stored huge map database.
Publication Source (Journal or Book title)
IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, BMSB
Recommended Citation
Elaine, S., Wu, H., Scott, H., Wu, Y., Kuan, Y., & Wu, J. (2019). Novel Efficient Coding Scheme for Data-Rate Limited Journey-Aware Graph-Data Transmission. IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, BMSB, 2019-June https://doi.org/10.1109/BMSB47279.2019.8971925