Weighted Greedy Approach for Low Latency Resource Allocation on V2X Network

In Vehicular ad-hoc networks (VANETs), resource allocation has become one of the primary tasks. Thus, a system should be well-designed so that information could be transmitted reliably and efficiently. As vehicular communication has several characteristics, efficient resource allocation scheme for D2D communications is highly required in VANET. The network topology changes rapidly as the vehicles are moving fast on the road and this makes it harder to communicate among the vehicles by predicting the best available channel. So as to overcome these issues, the proposed technique is offered in which the channel availability is predicted based on the novel mechanism like contention latency prediction using interframe spaces like Short interframe space, Distributed Coordination Function interframe space, Pointed Coordination Function and scattering based greedy weight matrix method. The implementation of this greedy mechanism in turn enhances the prediction probability of best channels that are available. Thus, the best available channel offered using greedy weight matrix scheme thereby estimates the decision probability at which the collision for available channel is computed. Thus, from this the best available channel is provided to the requested user. At last, the performance analysis is made in terms of packet delivery ratio, throughput, delay, reliability, and rate of message loss and is compared with existing techniques to prove the effectiveness of proposed strategy.