Abstract
This paper formulates the bandwidth allocation problem in train-to-ground wireless communication networks in operational process of trains. It is shown that the Nash Bargaining game provides an Asymmetric Nash Bargaining Solution which is fair to bandwidth allocation problems in different services. We proposed a bandwidth allocation model for train-to-ground communication system. It can effectively reflect allocation strategies for services with different bargaining power. We define a dynamic adaptive function of bargaining power in order to match utility functions under diverse bandwidths. Easily to implement as it is, an algorithm for bandwidth allocation is derived and then simulated. The simulation show that the proposed scheme has high rate of resource utilization, and is suitable for train-to-ground communication systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
