一种基于车载自组网的停车位协作发现算法

在停车位发现问题中,车辆节点快速变化的拓扑结构使停车位的选择和分配变得非常复杂.车载自组网多跳通信的特点使车辆节点容易产生抢占式不良竞争,从而造成无效的车辆行驶.基于OAPS算法和模拟退火算法,提出了一种停车位协作发现算法（COAPS）,综合考虑当前节点与邻居节点的整体开销,进而实现停车位资源在车辆节点间的协作分配.通过在VanetMobisim平台上仿真比较,验证COAPS算法具有较短的停车位发现时间和车辆协作性.

Collaborative algorithm of parking lot discovery based on Vehicular Ad Hoc Network

In the problem of parking lot discovery,the frequently changed topology structure makes it very complicated for the vehicle to choose the best parking lot wisely.Due to the feature of multi-hop communication in Vehicular Ad Hoc Network,vicious competitions are easily to happen which causes the invalid vehicle traveling.A new Collaborative algorithm of parking lot discovery is presented in this paper based on OAPS and simulated annealing algorithm,which considers the total cost of both current vehicle and its neighbors to achieve the cooperation between the vehicles.Through simulation and comparison in VanetMobisim platform,this schema can shorten the parking lot discovery time and achieve the cooperation between the vehicles.