Abstract :
Cognitive vehicular network (CVN) is proposed to improve the spectrum efficiency and enhance the Quality of Service (QoS) performance of diverse intelligent transportation service (ITS) applications. The road traffic jams and accidents will result in heavy communication load and QoS degradation in the hot cells, and then bring about asymmetric bandwidth requirements among the cells. In order to formulate the inter-cell asymmetric resource allocation in CVNs, two alternative bargaining solutions, such as Generalized Nash Bargaining Solution (GNBS) and Generalized Raiffa-Kalai-Smorodinsky Bargaining Solution (GRKSBS), are proposed to achieve a good tradeoff between efficiency and weighted fairness. Then, GNBS-S and GRKSBS-S schemes are proposed to guarantee the QoS of safety services in the heavy load case, where the bandwidth demand and supply can not be matched well. In these resource allocation schemes, a two-band partition algorithm is developed to reduce complexity. Furthermore, the primary user activity (PUA) which can cause rate loss to secondary users is also considered to alleviate its influence to fairness. Simulation results indicate that the proposed schemes outperform both the Max-min and Max-rate schemes, and they can also improve the communication reliability of safety service considerably in CVNs.
Keywords :
automated highways; cognitive radio; game theory; mobile communication; quality of service; resource allocation; road safety; road traffic; road vehicles; telecommunication network reliability; QoS; communication load; communication reliability; cooperative resource allocation; generalized Nash bargaining solution; generalized Raiffa-Kalai-Smorodinsky bargaining solution; intelligent transportation service; intercell asymmetric resource allocation; multicell cognitive vehicular networks; primary user activity; quality of service; road accidents; road traffic jams; safety service; spectrum efficiency; Asymmetric; Cognitive vehicular network; GNBS; GRKSBS; Inter-cell resource allocation;