基于拍卖理论的中继节点分配模型和分布式分配算法

Relay Node Assignment Model and Distributed Assignment Algorithm Based on Auction Theory

车载通信中,因距离或链路的原因使得有些车辆不能与通信基础设施（如无线接入点AP）或其它车辆直接通信,这时就需要通过其它移动车辆转发信息来实现与AP或其它车辆的相互通信.中继节点参与通信的情况会扩大通信传输范围,一方面可能提高了传输速率和系统性能,另一方面,可能会干扰其他节点的数据传输和降低整个系统性能.为了权衡中继节点带来的增益和干扰,合理分配中继资源,本文提出一种基于拍卖理论的中继节点分配模型.该模型中,把源节点和中继节点建模为多买家和多卖家的拍卖模型,设计了基于该模型的分布式中继节点分配算法——多轮单向拍卖（Multiple rounds double Auction,MRDA）算法.仿真结果证明MRDA综合考虑了中继节点带来的增益和干扰,能够有效的分配中继节点,改善了系统整体性能.

In the vehicle communication, some vehicles can not communicate with the communication infrastructure （such as the wireless access point AP） or other vehicles because of the distance or link. In this way, it is necessary to forward the information with other mobile vehicles to communicate with AP or other vehicles communicate with each other. The fact that the relay node participates in the communication will increase the transmission range, on the one hand, it may improve the transmission rate and system performance, on the other hand, it may interfere with the data transmission of other nodes and reduce the overall system performance. In order to balance the gain and interference caused by the relay node and allocate the relay resources reasonably, this paper proposes a relay node allocation model based on the auction theory. In this model, the source node and the relay node are modeled as the auction model of buyers and sellers, and the distributed relay node allocation algorithm based on this model is designed. Multiple rounds double auction（MRDA） algorithm. The simulation results show that the MRDA integrates the gain and interference of the relay node, and can effectively distribute the relay nodes and improve the overall performance of the system.