Meeting Always-Best-Connected paradigm in heterogeneous vehicular networks: A graph theory and a signaling game analysis

Abstract

Due to the high mobility of vehicles and the dynamic topology changes of vehicular networks, it is difficult to satisfy drivers needs through a single wireless network. Consequently, by integrating different wireless access networks such as LTE and IEEE 802.11p, the vehicular network is expected to be a good platform called Heterogeneous Vehicular Network that can meet various vehicular user requirements. In such networks, vehicles need to have mechanisms in place to decide which access network is the most suitable for every application that the vehicular user requires. Always-Best-Connected is considered as a special concept to allow users getting connected to Internet using the access network that best suits their needs or profile at any point in time. Clearly, this concept provides multiple access networks simultaneous for mobile users moving in heterogeneous access network environment. In this paper, we propose two approaches called graph theory-based approach, and signaling game-based approach. The first approach is based on graph theory while the second one based on signaling game theory to compute the suitable path which provides Always-Best-Connected service for a smart vehicle moving in vehicular networks.