基于停车位可用概率的停车位发现算法  

An available probability based parking algorithm

作　　者：金康[1,2] 李德敏[1,2] 汤海涅 李彤[1,2] 

机构地区：[1]东华大学,上海201620 [2]东华大学数字化纺织服装技术教育部工程研究中心,上海201620

出　　处：《微型机与应用》2015年第1期55-58,共4页Microcomputer & Its Applications

基　　金：国家自然科学基金(71171045)

摘　　要：利用车载自组网方便、灵活、成本低的特点,使用机会通信扩展车辆通信范围,提出一种基于停车位可用概率的停车位发现算法来解决分布式网络中信息不完全下的停车位发现问题。通过估算附近可用停车位在车辆到达时刻的可占用概率,为车辆分配成功率最大的停车位。仿真结果表明,该算法适用于车载自组网的分布式停车位算法,平均停车时间较短。Using the features of convenient, flexible and low cost of vehicle Ad-hoc network, and extending vehicles＇ communication range by opportunistic communication, this paper proposed an available probability based parking algorithm to solve the incomplete information in distributed network. By estimating the probability of available parking slots, it selects one with the biggest suceess rate for vehicle. Finally, through simulation, this algorithm can be resolved the parking problem in distributed network and had shorter average parking time.

关 键 词：VANET 停车 机会通信 概率 

分 类 号：TN929[电子电信—通信与信息系统]