2016/09/13 by Muhammad Ikram Ashraf, Ashraf, Muhammad Ikram, Mehdi Bennis +5
Engineering · #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Traffic control and management #Transportation and Mobility Innovations #Vehicular Ad Hoc Networks (VANETs)
paper · pdf · doi:10.48550/arxiv.1609.03717
openalex publication_date 2016/09/13 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28
In this paper, a novel proximity and load-aware resource allocation for\nvehicle-to-vehicle (V2V) communication is proposed. The proposed approach\nexploits the spatio-temporal traffic patterns, in terms of load and vehicles'\nphysical proximity, to minimize the total network cost which captures the\ntradeoffs between load (i.e., service delay) and successful transmissions while\nsatisfying vehicles's quality-of-service (QoS) requirements. To solve the\noptimization problem under slowly varying channel information, it is decoupled\nthe problem into two interrelated subproblems. First, a dynamic clustering\nmechanism is proposed to group vehicles in zones based on their traffic\npatterns and proximity information. Second, a matching game is proposed to\nallocate resources for each V2V pair within each zone. The problem is cast as\nmany-to-one matching game in which V2V pairs and resource blocks (RBs) rank one\nanother in order to minimize their service delay. The proposed game is shown to\nbelong to the class of matching games with externalities. To solve this game, a\ndistributed algorithm is proposed using which V2V pairs and RBs interact to\nreach a stable matching. Simulation results for a Manhattan model shown that\nthe proposed scheme yields a higher percentage of V2V pairs satisfying QoS as\nwell as significant gain in terms of the signal-to-interference-plus-noise\nratio (SINR) as compared to a state-of-art resource allocation baseline.\n