University of Oulu

X. Chen, C. Wu and M. Bennis, "An Oblivious Game-Theoretic Approach for Wireless Scheduling in V2V Communications," GLOBECOM 2017 - 2017 IEEE Global Communications Conference, Singapore, 2017, pp. 1-6. doi: 10.1109/GLOCOM.2017.8254668

An oblivious game-theoretic approach for wireless scheduling in V2V communications

Saved in:
Author: Chen, Xianfu1; Wu, Celimuge2; Bennis, Mehdi3
Organizations: 1VTT Technical Research Centre of Finland Ltd, Oulu, Finland
2Graduate School of Informatics and Engineering, University of Electro-Communications, Tokyo, Japan
3Centre for Wireless Communications, University of Oulu, Finland
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 0.2 MB)
Persistent link:
Language: English
Published: Institute of Electrical and Electronics Engineers, 2017
Publish Date: 2018-07-31


This paper addresses the problem of wireless resource scheduling in a vehicle-to-vehicle (V2V) communication network. The technical challenges lie in the fast changing network dynamics, namely, the channel quality and the data traffic variations. For a road segment covered by a road side unit (RSU), especially in a dense urban area, the vehicle density tends to be stable. The incoming service requests from the vehicle user equipment (VUE)-pairs compete with each other for the limited frequency resource in order to deliver data packets. Such competitions are regulated by the RSU via a sealed second-price auction at the beginning of scheduling slots. Each incumbent service request aims at maximizing the expected long-term payoff from bidding the frequency resource for packet transmissions. Markov perfect equilibrium (MPE) can be utilized to characterize the optimal competitive behaviors of the service requests. When the number of incumbent VUE-pairs becomes large, solving the MPE becomes infeasible. We adopt an oblivious equilibrium to approximate the MPE, which is theoretically proven to be error-bounded. The decision making process at each service request is hence transformed into a single-agent Markov decision process, for which we propose an on-line auction based learning scheme. Through simulation experiments, we show the potential performance gains from our proposed scheme, in terms of per-service request average utility.

see all

Series: IEEE Global Communications Conference
ISSN: 2334-0983
ISSN-L: 2334-0983
ISBN: 978-1-5090-5019-2
ISBN Print: 978-1-5090-5020-8
Article number: 8254668
DOI: 10.1109/GLOCOM.2017.8254668
Host publication: 2017 IEEE Global Communications Conference (GLOBECOM) Proceedings Singapore 4 – 8 December 2017
Conference: IEEE Global Communications Conference
Type of Publication: A4 Article in conference proceedings
Field of Science: 213 Electronic, automation and communications engineering, electronics
Funding: This research was supported in part by AKA grants 310786 and 289611 and JSPS KAKENHI grant 16K00121.
Academy of Finland Grant Number: 289611
Detailed Information: 289611 (Academy of Finland Funding decision)
Copyright information: © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.