基于网络效用最大化的车联网功率控制算法

摘要

针对车联网(IoV)中车流密度增加到一定程度时,即使无线信道中只有信标消息,信道拥塞也会发生的问题,提出一种分布式加权公平功率控制(D-WFPC)算法.首先,考虑车联网的实际信道特性,采用Nakagami-m衰落信道模型建立随机信道模型;然后,考虑车联网中节点的移动性,基于网络效用最大化(NUM)模型建立功率控制优化问题,控制本地信道负载在阈值之下,从而避免拥塞;最后,通过对偶分解和迭代法解决该问题,设计分布式算法,每辆车根据周围环境的邻居车辆的信标消息,动态调整发射功率.仿真实验中,与固定发射功率方案相比,随着车流密度增大,D-WFPC算法能有效降低时延和丢包率,最高降幅分别达到24％和44％;与公平分布式发射功率拥塞控制(FCCP)算法相比,D-WFPC算法全程性能占优,时延和丢包率的最高降幅分别达到10％和4％.仿真结果表明,D-WFPC算法能快速收敛,保证车联网中消息的低时延、高可靠传输.%Channel congestion occurs when the vehicular traffic density increases to a certain extent in Internet of Vehicles (IoV),even if there are only beacons in the wireless channel.To solve the problem,a Distributed-Weighted Fair Power Control (D-WFPC) algorithm was proposed.Firstly,considering the actual channel characteristics in IoV,the Nakagami-m fading channel model was used to establish the random channel model.Then,the mobility of the nodes in IoV was considered,and a power control optimization problem was established based on the Network Utility Maximization (NUM) model,which kept the local channel load under the threshold to avoid congestion.Finally,a distributed algorithm was designed by solving the problem with dual decomposition and iterative method.The transmit power of each vehicle was dynamically adjusted according to the beacons from neighbor vehicles.In the simulation experiment,compared with the fixed transmit power schemes,the D-FWPC algorithm reduced the delay and packet loss ratio effectively with the increase of traffic density,the highest reduction was up to 24％ and 44％ respectively.Compared with the Fair distributed Congestion Control with transmit Power (FCCP) algorithm,the D-FWPC algorithm had better performance all the way and the highest reduction in delay and packet loss ratio was up to 10％ and 4％ respectively.The simulation results show that the D-WFPC algorithm can converge quickly and ensure messages to be transmitted with low delay and high reliability in IoV.