Semi-greedy scheme for slot allocation in vehicular networks

In this paper, we propose a three-phase based slot allocation scheme named S-G (semi-greedy) for vehicular networks. In the first two phases each vehicular node of a THS (two-hop set) could surely occupy one time slot if the slot resource is adequate. Furthermore, in the third phase all vehicular nodes carry out a greedy behavior to occupy more slots. The slot resource could be fully used and the system set-up period is acceptable by using greedy in the third phase. Closed form of average channel utilization, slot number per user and periodic broadcast delay have been obtained. Analysis and Simulation results show that compared to the one-to-one scheme which is used in most of the existing studies the proposed S-G scheme has a better performance in all the three indexes listed above.