ID	原文	译文
5514	然后基于该模型，建立了传输功率固定条件下无线信道资源分配的优化问题；	Then under the condition of fixed transmit powers, a optimiza-tion problem of channel resource allocation was proposed.
5515	最后为求解该优化问题，设计了分布式拥塞控制算法UBRCC，该算法通过更新车辆的拥塞“价格”求解最优数据分组发送速率，实现了面向单个车辆安全需求的信道资源分配。	Lastly, to solve the optimization problem, a distributed congestioncontrol algorithm named utility-based rate congestion control (UBRCC) algorithm was designed, the algorithm worked outthe optimal beaconing rate by updating vehicle's congestion price, realizing the resource allocation according to vehicle'ssafety requirements.
5516	仿真实验结果表明，UBRCC 算法在控制信道拥塞的同时，能够有效地减小传输时延，确保数据分组可靠发送，满足车辆安全应用的服务需求。	Simulation results validate that UBRCC algorithm can efficiently control channel congestion, reducetransmission delay, ensure reliable data transmission and satisfies the requirements of safety applications.
5517	针对窄带物联网（NB-IoT）低功耗、低成本、低采样率等特点，提出了一种基于小区间干扰消除的 NB-IoT时延估计算法，所提算法引入了小区间迭代干扰消除算法，以逐步消除各小区信号之间的相互影响。	Aiming at the characteristics of NB-IoT such as low power consumption, low cost and low sampling rate, anNB-IoT delay estimation algorithm based on inter-cell interference cancellation was proposed. To gradually eliminate theinteraction between signals in each cell, an inter-cell iterative interference cancellation algorithm was considered.
5518	在每一次迭代中，在传统相关算法的基础上引入时频互相关交叠的思想来提升时延估计精度以突破采样率的限制，并采用基于噪声门限的首达径（FAP）搜索算法来抑制多径效应的影响。	In eachiteration, the idea of time-frequency cross-correlation overlapping was introduced on the basis of traditional correlationalgorithms to break through the limitations of the sampling rate and further improve the accuracy of time delay estimation.At the same time, a first-arrival-path (FAP) searching algorithm based on noise threshold was used to suppress multipatheffects.
5519	仿真结果表明所提算法可以在相关算法的基础上明显提高 NB-IoT 的时延估计精度。	Through experimental simulation, the results show that the proposed algorithm can significantly improve the timedelay estimation accuracy of NB-IoT on the basis of related algorithms.
5520	景区多点路径规划问题是一个 NP-hard 问题，相当于寻找经过起始点和特定节点的最短路径。	The problem of multi-point path planning is a NP-hard problem, which is equivalent to finding the shortestpath of a starting point and some specific node.
5521	针对多点路径规划问题，提出了回溯蚁群−粒子群混合算法，该算法运用弗洛伊德（Floyd-Warshall）算法将图进行转换并且结合了蚁群算法和粒子群算法寻找最短路径。	Aiming at the problem of multi-point path planning, a retrospective antcolony-particle swarm optimization algorithm was proposed. This algorithm used Floyd-Warshall to transform the graphand combined ant colony algorithm and particle swarm algorithm to find the shortest path.
5522	实验结果表明，此算法可以在小规模数据下快速找到精确解，同时，在较大规模数据量下，可以得到比最大最小蚁群算法和遗传算法更好的结果。	The experimental results show that this algorithm can find the precise solution under small data, at the same time, under a large amount of data, can bebetter than the maximum minimum ant colony algorithm and genetic algorithm.
5523	为确保水下无人艇的通信安全，提出一种基于正交频分复用系统的水下声信道物理层密钥生成方案。	To ensure the communication safety of unmanned underwater vehicle, a physical layer key generation schemeof underwater acoustic channel based on orthogonal frequency division multiplexing (OFDM) system was proposed.