CAJ | 학술논문

资源调度是提高车载网络数据吞吐量、降低数据传输时延的重要技术手段，也是车载网络的重点研究内容。本文关注异构车载网络资源调度算法研究，提出了一种基于移动服务量的异构车载网络资源调度算法(Moble Services Resource Scheduling algorithm, MSRS)，通过移动服务量精确刻画车载网络链路传输能力，在此基础上采用中继选择和最大服务量配对等手段提升移动车载网络的总吞吐量。仿真实验表明，与现有基于瞬时速率的资源调度算法相比，在不同车辆数量、车速、基站覆盖范围条件下MSRS算法都可以提供更高的数据吞吐量。
자원조도시제고차재망락수거탄토량、강저수거전수시연적중요기술수단，야시차재망락적중점연구내용。본문관주이구차재망락자원조도산법연구，제출료일충기우이동복무량적이구차재망락자원조도산법(Moble Services Resource Scheduling algorithm, MSRS)，통과이동복무량정학각화차재망락련로전수능력，재차기출상채용중계선택화최대복무량배대등수단제승이동차재망락적총탄토량。방진실험표명，여현유기우순시속솔적자원조도산법상비，재불동차량수량、차속、기참복개범위조건하MSRS산법도가이제공경고적수거탄토량。
The Vehicular Ad Hoc Networks (VANETs) is the key technology of intelligent traffic system (ITS). Aiming at target for high-speed mobile vehicles in VANETs, this paper proposes a mobile services-based resource scheduling algorithm for VANETs (MSRS). MSRS calculates scheduling cycle total services according to the vehicle trajectory at first. Then MSRS select some vehicles (called relay vehicle, RV) to communicate with the base station di-rectly and some vehicles (called destination vehicle, DV) to communicate with the base station through cooperation forwarding vehicles (RV). MSRS uses the bipartite graph greatest weight match algorithm in graph theory for to distri-bute RV for DV. The MSRS provides higher data throughput under the condition of different vehicle quantity, maximum speed, and base station coverage.