西安电子科技大学学报（自然科学版）Issue(1)：133-138,6.DOI:10.3969/j.issn.1001-2400.2016.01.024
一种公平的路边基站下行业务调度算法
Fair traffic scheduling algorithm for the roadside unit
摘要
Abstract
To improve the fairness performance of the downlink traffic scheduling algorithm , a network flow based downlink traffic scheduling algorithm is proposed for the roadside unit ( RSU ) in vehicular networks . In the proposed algorithm , a bipartite graph is constructed firstly , where the node set is composed by the vehicle set and the timeslot set . At any given timeslot if a vehicle can communicate with the RSU , then an edge between the given timeslot and that vehicle is added into the edge set . Next , a flow network graph is constructed based on the bipartite graph by adding a virtual source node and a virtual sink node . By applying the conventional minimum cost maximum flow algorithms , a minimum cost maximum flow can be computed , which is converted to the fair traffic scheduling strategy . Simulation results show that , when the total vehicle requirements are maximized , compared with the existing algorithms , the fairness performance of the proposed algorithm is improved by 116.4% in the offline case , and by 25.9% in the online case .关键词
车辆网络/业务调度/公平性/网络流Key words
vehicular networks/traffic scheduling/fairness/network flow分类
信息技术与安全科学引用本文复制引用
闫中江,李波,高田,左晓亚..一种公平的路边基站下行业务调度算法[J].西安电子科技大学学报（自然科学版）,2016,(1):133-138,6.基金项目
国家自然科学基金资助项目（61201157，61271279）；国家863计划资助项目（2014AA01A707）；国家重大专项资助项目（2015ZX03002006）；西北工业大学基础研究基金资助项目 （）
