基于朋友关系的车联网广告投递研究

Research on Vehicle Network Advertising Delivery Based on Friends Relationship

摘要: 车联网的快速发展随之也引发了很多应用问题的讨论和研究。本文针对商场的广告投递需求，提出了基于车联之间的社会关系的车联网路由算法，主要是针对车联网网络中的投递率和网络能耗进行优化和改进。首先，利用车辆之间的接触时间和频率来确立和维护车辆之间的朋友关系。其次，在每一个车辆节点内维护一张车辆节点社会距离表。这样可以使得车辆节点间的信息交换次数减少，从而减少整网的消耗、然后，将车辆节点在过程中接收的数据按条记录在其维护的表内，用于进行不同链路的传输。当车辆节点与其接触的节点中有社会距离为1的朋友节点时，计算其中可用链路与数据之间的效用值，并进行转发。最后，数据包被转发至靠近目标节点直至到达目的节点。其实验结果分析表明：辅助信息交换次数有相对的减少，在维持高效的数据包投递率情况下可以将整网的开销降低，达到预期的目标。

Abstract: The rapid development of the Internet of Vehicles has also led to discussions and research on many application issues. This paper aims at the advertising delivery demand of shopping malls and proposes a vehicle networking routing algorithm based on the social relationship between vehicles, which mainly optimizes and improves the delivery rate and network energy consump-tion in the network of vehicles. First, the contact time and frequency between vehicles are used to establish and maintain a friend relationship between vehicles. Second, a vehicle node social distance table in each vehicle node is maintained. This can reduce the number of information ex-changes between vehicle nodes and reduce the overall network energy consumption. The data received by the vehicle node in the process is then recorded in a table maintained by it for the transmission of different links. When there is a friend node with a social distance of 1 in the node with which the vehicle node is in contact, the utility value between the available link and the data is calculated and forwarded. Finally, the packet is forwarded close to the target node until it reaches the destination node. The analysis of the experimental results shows that the number of auxiliary information exchanges is relatively reduced, and the overhead of the whole network can be reduced to achieve the expected goal while maintaining efficient delivery rate of data packets.