Network Selection Algorithm Based on Stable Matching Game in Vehicular Heterogeneous Network
A gaming method of vehicular heterogeneous network selection was proposed, to solve the network access problem of vehicles in heterogeneous network coverage. Based on the concepts of stable matching in two-sided matching game, stable matching of network selection was obtained through the mutual sele...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2015-09-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2015233/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A gaming method of vehicular heterogeneous network selection was proposed, to solve the network access problem of vehicles in heterogeneous network coverage. Based on the concepts of stable matching in two-sided matching game, stable matching of network selection was obtained through the mutual selection between users and networks. Firstly, the corresponding weights were calculated by using AHP to obtain the satisfaction function, then, one-to-many two-sided matching problem was converted into one-to-one two-sided matching problem, and optimal matching results could be obtained by constructing the multi-objective optimization model under the condition of stable matching. The performance analysis and simulation results show that the proposed model based on stable matching optimizes the satisfaction degree of both the network and user sides, and thus the equilibrium state of two way network selection was obtained,compared to the traditional selection-making model. |
|---|---|
| ISSN: | 1000-0801 |