车辆接入互联网基于机会链接的资源分配  

Optimal allocation of resource based on probabilistic link in drive-thru networks

作　　者：陈丽[1] 李治军[1] 姜守旭[1] 方文涛 王帅[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001 [2]颐中烟草机械有限公司,青岛266000

出　　处：《哈尔滨工业大学学报》2013年第5期40-44,共5页Journal of Harbin Institute of Technology

基　　金：国家自然科学基金资助项目(60803148;60973124);教育部高校博士点科研基金资助项目(20102302110036);山西省自然科学基金项目(20110110142);山西省科技基础条件平台建设项目(20120910030105)

摘　　要：为提高车辆接入互联网的通信服务能力,研究了无线网络接入点(AP)如何分配信道资源,才能更为有效地利用车载节点间的机会通信扩展AP通信服务范围.对基于机会链接的资源分配问题进行了形式化定义并证明该问题是NP-难的.为解决该问题又提出基于节点间链接预测的资源分配近似算法.通过模拟实验分析了节点数量与节点请求下载量对传输率的影响,并将基于链接预测的资源分配算法(APL)与现有的基于竞争及随机资源分配方法进行了对比实验分析,实验结果表明:该方法显著地提高了网络的通信服务能力.To improve AP's capability of communication services,this paper addresses the problem of efficiently downloading content when vehicles go through the limited coverage range of roadside access point(AP) in drive-thru internet.How to allocate channel resource and effectively utilize vehicle-to-vehicle communication is focused on to improve AP's capability of service.An optimization selection problem of k forwarding nodes to maximize the number of completed file download jobs is formalized,and that it is NP-Hard is proved.Based on this,allocation of resource(APL) scheme based on the prediction of link durations of the different pair users,and the APL approximate algorithm based on greedy are proposed.Extensive simulation results show that the APL consistently outperforms competitive allocation schemes under varying workloads.

关 键 词：车载Ad HOC网络 车辆接入互联网 信道资源分配 机会链接 

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