Wireless Resource Allocation Algorithm with High Reliability and Low Delay for Railway Container
The intelligent container system improves the container operation efficiency through the real-time collection and transmission of information.In order to ensure the ultra reliable and low delay communication of container terminals,this paper pro-poses to transmit the information in the form of the s...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial office of Computer Science
2022-06-01
|
| Series: | Jisuanji kexue |
| Subjects: | |
| Online Access: | https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-6-39.pdf |
| _version_ | 1797845188571299840 |
|---|---|
| author | XU Hao, CAO Gui-jun, YAN Lu, LI Ke, WANG Zhen-hong |
| author_facet | XU Hao, CAO Gui-jun, YAN Lu, LI Ke, WANG Zhen-hong |
| author_sort | XU Hao, CAO Gui-jun, YAN Lu, LI Ke, WANG Zhen-hong |
| collection | DOAJ |
| description | The intelligent container system improves the container operation efficiency through the real-time collection and transmission of information.In order to ensure the ultra reliable and low delay communication of container terminals,this paper pro-poses to transmit the information in the form of the short packets,and studies the sum rate maximization of the uplink transmission system for the railway container terminals in the multi cells.This paper proposes a spectrum resource allocation problem.Multiple cells share spectrum resources,and the terminals in the cells obtain the spectrum through competition.The game theory model is used to construct this competition relationship,and Nash equilibrium solution is proved.The best Nash equilibrium solution is the global optimal solution for system and rate maximization.Then,a distributed iterative algorithm is designed,which only needs local information interaction.It is proved theoretically that when the smoothing coefficient is small enough,the algorithm can converge to the best Nash equilibrium point with any high probability.Finally,the proposed algorithm is verified by simulation.Simulation results show that the proposed algorithm has fast convergence speed and is better than best response dynamics(BRD) algorithm and No-regret algorithm. |
| first_indexed | 2024-04-09T17:34:46Z |
| format | Article |
| id | doaj.art-4305eaa2443640839fc7150766a460bb |
| institution | Directory Open Access Journal |
| issn | 1002-137X |
| language | zho |
| last_indexed | 2024-04-09T17:34:46Z |
| publishDate | 2022-06-01 |
| publisher | Editorial office of Computer Science |
| record_format | Article |
| series | Jisuanji kexue |
| spelling | doaj.art-4305eaa2443640839fc7150766a460bb2023-04-18T02:32:00ZzhoEditorial office of Computer ScienceJisuanji kexue1002-137X2022-06-01496394310.11896/jsjkx.211200143Wireless Resource Allocation Algorithm with High Reliability and Low Delay for Railway ContainerXU Hao, CAO Gui-jun, YAN Lu, LI Ke, WANG Zhen-hong01 Postgraduate Department,China Academy of Railway Sciences,Beijing 100081,China ;2 Signal and Communication Research Institute,China Academy of Railway Sciences,Beijing 100081,China ;3 Science and Information Technology Department,China Academy of Railway Sciences,Beijing 100081,ChinaThe intelligent container system improves the container operation efficiency through the real-time collection and transmission of information.In order to ensure the ultra reliable and low delay communication of container terminals,this paper pro-poses to transmit the information in the form of the short packets,and studies the sum rate maximization of the uplink transmission system for the railway container terminals in the multi cells.This paper proposes a spectrum resource allocation problem.Multiple cells share spectrum resources,and the terminals in the cells obtain the spectrum through competition.The game theory model is used to construct this competition relationship,and Nash equilibrium solution is proved.The best Nash equilibrium solution is the global optimal solution for system and rate maximization.Then,a distributed iterative algorithm is designed,which only needs local information interaction.It is proved theoretically that when the smoothing coefficient is small enough,the algorithm can converge to the best Nash equilibrium point with any high probability.Finally,the proposed algorithm is verified by simulation.Simulation results show that the proposed algorithm has fast convergence speed and is better than best response dynamics(BRD) algorithm and No-regret algorithm.https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-6-39.pdfultra reliable and low delay|short packets|spectrum resource allocation|game theory|nash equilibrium solution |
| spellingShingle | XU Hao, CAO Gui-jun, YAN Lu, LI Ke, WANG Zhen-hong Wireless Resource Allocation Algorithm with High Reliability and Low Delay for Railway Container Jisuanji kexue ultra reliable and low delay|short packets|spectrum resource allocation|game theory|nash equilibrium solution |
| title | Wireless Resource Allocation Algorithm with High Reliability and Low Delay for Railway Container |
| title_full | Wireless Resource Allocation Algorithm with High Reliability and Low Delay for Railway Container |
| title_fullStr | Wireless Resource Allocation Algorithm with High Reliability and Low Delay for Railway Container |
| title_full_unstemmed | Wireless Resource Allocation Algorithm with High Reliability and Low Delay for Railway Container |
| title_short | Wireless Resource Allocation Algorithm with High Reliability and Low Delay for Railway Container |
| title_sort | wireless resource allocation algorithm with high reliability and low delay for railway container |
| topic | ultra reliable and low delay|short packets|spectrum resource allocation|game theory|nash equilibrium solution |
| url | https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-6-39.pdf |
| work_keys_str_mv | AT xuhaocaoguijunyanlulikewangzhenhong wirelessresourceallocationalgorithmwithhighreliabilityandlowdelayforrailwaycontainer |