软件学报
軟件學報
연건학보
JOURNAL OF SOFTWARE
2014年
10期
2362-2372
,共11页
车联网%车载ad hoc网络%无线网络接入点%车间通信%内容下载
車聯網%車載ad hoc網絡%無線網絡接入點%車間通信%內容下載
차련망%차재ad hoc망락%무선망락접입점%차간통신%내용하재
drive-thru Internet%vehicular ad hoc network (VANET)%access points (APs)%vehicle-to-vehicle (V2V)%content downloading
车联网信道资源稀缺及车载节点间的间歇性短暂链接,给车载节点通过无线接入点(AP)接入互联网进行内容下载带来了巨大挑战.AP覆盖范围内的资源分配与Internet链接空洞区域的传输调度相互依赖,共同影响其下载性能,而现有文献往往将二者孤立开来分别进行研究.为了提高下载性能,将二者作为一个整体,从全局优化的角度研究内容下载的效率问题,并将其形式化为下载数据量最大的结合非冲突调度的资源分配问题.但是,在证明该问题是 NP-难的基础上,提出结合链接空洞区域的传输调度的资源分配近似算法(JAS)来解决该问题.该算法将整个链接空洞区域节点间链接的时空变化模型化为拓扑图序列,并基于此构建其传输冲突图序列,在 AP 通信覆盖区域基于图序列计算优化的资源分配节点集进行资源分配,以期达到扩展AP通信范围、填补Internet链接空洞的目的.模拟实验结果表明,JAS 算法与现有方法相比显著提高了文件下载量及传输的成功率.此外,还对影响内容下载性能的相关因素进行了分析.
車聯網信道資源稀缺及車載節點間的間歇性短暫鏈接,給車載節點通過無線接入點(AP)接入互聯網進行內容下載帶來瞭巨大挑戰.AP覆蓋範圍內的資源分配與Internet鏈接空洞區域的傳輸調度相互依賴,共同影響其下載性能,而現有文獻往往將二者孤立開來分彆進行研究.為瞭提高下載性能,將二者作為一箇整體,從全跼優化的角度研究內容下載的效率問題,併將其形式化為下載數據量最大的結閤非遲突調度的資源分配問題.但是,在證明該問題是 NP-難的基礎上,提齣結閤鏈接空洞區域的傳輸調度的資源分配近似算法(JAS)來解決該問題.該算法將整箇鏈接空洞區域節點間鏈接的時空變化模型化為拓撲圖序列,併基于此構建其傳輸遲突圖序列,在 AP 通信覆蓋區域基于圖序列計算優化的資源分配節點集進行資源分配,以期達到擴展AP通信範圍、填補Internet鏈接空洞的目的.模擬實驗結果錶明,JAS 算法與現有方法相比顯著提高瞭文件下載量及傳輸的成功率.此外,還對影響內容下載性能的相關因素進行瞭分析.
차련망신도자원희결급차재절점간적간헐성단잠련접,급차재절점통과무선접입점(AP)접입호련망진행내용하재대래료거대도전.AP복개범위내적자원분배여Internet련접공동구역적전수조도상호의뢰,공동영향기하재성능,이현유문헌왕왕장이자고립개래분별진행연구.위료제고하재성능,장이자작위일개정체,종전국우화적각도연구내용하재적효솔문제,병장기형식화위하재수거량최대적결합비충돌조도적자원분배문제.단시,재증명해문제시 NP-난적기출상,제출결합련접공동구역적전수조도적자원분배근사산법(JAS)래해결해문제.해산법장정개련접공동구역절점간련접적시공변화모형화위탁복도서렬,병기우차구건기전수충돌도서렬,재 AP 통신복개구역기우도서렬계산우화적자원분배절점집진행자원분배,이기체도확전AP통신범위、전보Internet련접공동적목적.모의실험결과표명,JAS 산법여현유방법상비현저제고료문건하재량급전수적성공솔.차외,환대영향내용하재성능적상관인소진행료분석.
Vehicular content downloading via open WiFi access points (APs) can be challenging due to sparse AP deployment with bounded communication range and the rapid movement of traveling vehicles. For drive-thru networks, resource allocation and scheduling closely interrelate to and interact with each other, collectively affecting the performance of content downloading. However, none of the previous work has tackled this problem as a whole. This paper discusses joint resource allocation and scheduling problem for efficiently content downloading considering channel contention and scarce AP resource utilized effectively. It formalizes optimization selection problem of node set to maximize the total quantity of data downloaded, and proves that it is NP-hard. Further, it presents a solution with a joint resource allocation and scheduling approximate algorithm (JAS). Theoretical analysis and simulation results both verify that the presented implementation achieves higher throughput and delivery ratio than the existing algorithms.