检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:胥昊 曹桂均[2] 闫璐[1,3] 李科 王振宏[2] XU Hao;CAO Gui-jun;YAN Lu;LI Ke;WANG Zhen-hong(Postgraduate Department,China Academy of Railway Sciences,Beijing 100081,China;Signal and Communication Research Institute,China Academy of Railway Sciences,Beijing 100081,China;Science and Information Technology Department,China Academy of Railway Sciences,Beijing 100081,China)
机构地区:[1]中国铁道科学研究院研究生部,北京100081 [2]中国铁道科学研究院通信信号研究所,北京100081 [3]中国铁道科学研究院科技和信息化部,北京100081
出 处:《计算机科学》2022年第6期39-43,共5页Computer Science
基 金:国家自然科学基金(U1834211);中国铁道科学研究院集团有限公司科研课题(2021YJ101)。
摘 要:智能集装箱系统通过信息的实时采集和传输,提高了集装箱的运转效率。为了保证集装箱终端的超可靠低时延通信,文中提出以短包的形式传输信息,研究多小区铁路集装箱终端上行传输系统的和速率最大化问题,提出了一个频谱资源分配策略,多个小区间共用频谱资源,小区内的终端通过竞争获取频谱。首先,采用博弈论模型构建这种竞争关系,并证明了纳什均衡解的存在,其最好的纳什均衡解就是系统和速率最大化的全局最优解;然后,设计了一种分布式迭代算法,该算法只需要局部信息交互,并在理论上证明了当平滑系数足够小时,算法能以任意高的概率收敛到最好的纳什均衡点;最后,对所提算法进行了仿真验证。仿真结果表明,所提算法的收敛速度较快,且优于BRD算法和No-regret算法。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.
关 键 词:超可靠低时延 短包 频谱资源分配 博弈论 纳什均衡解
分 类 号:TN911[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.216.150.3