Data Structures for Delay Reduction in Vehicular Ad hoc Networks

Abstract

Various problems in the area of VANET have been identified and solved. However, the queuing in VANET is a neglected area. Data structure has a significant effect on the delay in VANET due to frequent rescheduling. Several data structures have been proposed in this work by combining various existing data structures to reduce the effect of frequent rescheduling. The results show the effect of various combinations of data structures on the performance of the network. Most efficient data structure provides an improvement of 3.3% in delay, 3.94% in packet delivery and 4.08% in throughput in comparison to the linked list. Although this improvement is not much significant, it should be noted that this is only due to the use of different data structures.