Vehicular cache nodes selection algorithm under load constraint in C-V2X
In order to solve the problem that the C-V2X vehicle topology in urban environment was highly dynamic and the load capacity of vehicle nodes was limited, and improve the utilization of vehicular cache resources and reduce the load of base station, a vehicle cache nodes selection algorithm under load...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2021-03-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2021065 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850210923137990656 |
|---|---|
| author | Zhexin XU Kaimeng GAO Wenkang JIA Yi WU |
| author_facet | Zhexin XU Kaimeng GAO Wenkang JIA Yi WU |
| author_sort | Zhexin XU |
| collection | DOAJ |
| description | In order to solve the problem that the C-V2X vehicle topology in urban environment was highly dynamic and the load capacity of vehicle nodes was limited, and improve the utilization of vehicular cache resources and reduce the load of base station, a vehicle cache nodes selection algorithm under load constraints was proposed.Firstly, by defining the link stability metric, the predicted weight adjacency matrix was constructed to describe the vehicular micro-topology in essence.Next, the objective function was further constructed under the load constraints and non-overlapping coverage constraint, which maximized the average link weight of the clusters by using the least cache nodes.Finally, the greedy concept was then introduced and the node states were reasonably defined.As a result, the minimum dominating set of the vehicle topology was figured out under the load constraints.Besides, the serviced neighbor nodes were then determined preferentially.The simulation results show that the proposed algorithm is close to the global optimal results in terms of the number of cache nodes and the average weight of cluster links.Moreover, the repeated response ratio of the proposed algorithm is always zero while the request response ratio can achieve the theoretical upper bound.Furthermore, the response times of cache resources can be also effectively improved. |
| format | Article |
| id | doaj-art-f4b6d2653b8e4b19bc9b52056ea5ed72 |
| institution | OA Journals |
| issn | 1000-436X |
| language | zho |
| publishDate | 2021-03-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-f4b6d2653b8e4b19bc9b52056ea5ed722025-08-20T02:09:40ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2021-03-014217118259741027Vehicular cache nodes selection algorithm under load constraint in C-V2XZhexin XUKaimeng GAOWenkang JIAYi WUIn order to solve the problem that the C-V2X vehicle topology in urban environment was highly dynamic and the load capacity of vehicle nodes was limited, and improve the utilization of vehicular cache resources and reduce the load of base station, a vehicle cache nodes selection algorithm under load constraints was proposed.Firstly, by defining the link stability metric, the predicted weight adjacency matrix was constructed to describe the vehicular micro-topology in essence.Next, the objective function was further constructed under the load constraints and non-overlapping coverage constraint, which maximized the average link weight of the clusters by using the least cache nodes.Finally, the greedy concept was then introduced and the node states were reasonably defined.As a result, the minimum dominating set of the vehicle topology was figured out under the load constraints.Besides, the serviced neighbor nodes were then determined preferentially.The simulation results show that the proposed algorithm is close to the global optimal results in terms of the number of cache nodes and the average weight of cluster links.Moreover, the repeated response ratio of the proposed algorithm is always zero while the request response ratio can achieve the theoretical upper bound.Furthermore, the response times of cache resources can be also effectively improved.http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2021065C-V2X;cache node selection;minimum dominating set;load constraint |
| spellingShingle | Zhexin XU Kaimeng GAO Wenkang JIA Yi WU Vehicular cache nodes selection algorithm under load constraint in C-V2X Tongxin xuebao C-V2X;cache node selection;minimum dominating set;load constraint |
| title | Vehicular cache nodes selection algorithm under load constraint in C-V2X |
| title_full | Vehicular cache nodes selection algorithm under load constraint in C-V2X |
| title_fullStr | Vehicular cache nodes selection algorithm under load constraint in C-V2X |
| title_full_unstemmed | Vehicular cache nodes selection algorithm under load constraint in C-V2X |
| title_short | Vehicular cache nodes selection algorithm under load constraint in C-V2X |
| title_sort | vehicular cache nodes selection algorithm under load constraint in c v2x |
| topic | C-V2X;cache node selection;minimum dominating set;load constraint |
| url | http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2021065 |
| work_keys_str_mv | AT zhexinxu vehicularcachenodesselectionalgorithmunderloadconstraintincv2x AT kaimenggao vehicularcachenodesselectionalgorithmunderloadconstraintincv2x AT wenkangjia vehicularcachenodesselectionalgorithmunderloadconstraintincv2x AT yiwu vehicularcachenodesselectionalgorithmunderloadconstraintincv2x |