基于信息丢失概率的停车场信息获取算法  

Parking Lots Information Acquisition Algorithm Based on Information Loss Probability

作　　者：廖书亚 李德敏[1,2] 张光林[1,2] 徐梦然 LIAO Shuya;LI Demin;ZHANG Guanglin;XU Mengran(School of Information Science and Technology,Donghua University,Shanghai 201620,China;Engineering Research Center of Digitalized Textile and Fashion Technology,Ministry of Education,Shanghai 201620,China)

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

出　　处：《计算机工程》2020年第1期315-320,共6页Computer Engineering

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

摘　　要：随着城市私家车数量的增加,实时获取停车场信息对减少交通拥堵与无效巡游具有重要意义。为此,在含有不同车型的混合网络下,提出一种基于最小信息丢失概率的停车场信息传输算法BMILP,并在该算法的基础上,设计具有停车需求的私家车处于不同道路模式下获取停车场信息的方法。实验结果表明,与BOPBR算法相比,BMILP算法能够降低停车场信息在传输过程中的竞争概率并缩短信息传输时延。With the increasing number of private cars in the city,a real-time access to parking lots information is of great importance to reduce traffic congestion and invalid cruising.Therefore,in the hybrid internet with different cars,this paper proposes a parking lots information transmission algorithm BMILP base on minimum information loss probability.Then,on the basis of the proposed algorithm,an approach to obtain parking lots information is designed for private cars with parking demands on different road modes.Experimental results show that compared with the BOPBR algorithm,the proposed algorithm can reduce competition probability during parking lots information transmission process and shorten the transmission delay.

关 键 词：停车场信息 最小信息丢失概率 车型因子 信息竞争 车载自组织网络 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]