End-to-End Backlog and Delay Bound Analysis Using Martingale for Internet of Vehicles

Internet of vehicles (IoVs) emerges as a promising technology to facilitate vehicular wireless communication by approving vehicle-to-everything (V2X) services for intelligent transportation systems including vehicle-to-vehicle (V2V), vehicle-to-infrastructure (V2I) and vehicle-to-pedestrian (V2P) services. V2V networks have been rapidly developed to support short distance data transmission among vehicles on the road. By analyzing the Markov arrival process and the service effect on the IEEE 802.11p enhanced distributed channel access (EDCA) mechanism, the multi-hop service process can be modelled into a virtualized single service in a min-plus convolution form. In this paper, we employ the stochastic network calculus (SNC) and the martingale theory to investigate the multi-hop end-to-end (E2E) backlog and delay bounds under the first-in first-out (FIFO) scheduling policy in IoVs. In the simulation, we use three types of real wireless data traces, i.e., VoIP, gaming and UDP, to evaluate the proposed algorithm by considering double Nakagami-m fading channel. We can easily find that the supermartingale multi-hop E2E backlog and delay bounds are tight to the real data trace simulation results. Moreover, our study also presents the impact of the number of vehicles on the multi-hop E2E queueing performance.