本文選題：車聯(lián)網(wǎng)　切入點(diǎn)：車載ad　出處：《軟件學(xué)報(bào)》2014年10期

【摘要】：車聯(lián)網(wǎng)信道資源稀缺及車載節(jié)點(diǎn)間的間歇性短暫鏈接,給車載節(jié)點(diǎn)通過無線接入點(diǎn)(AP)接入互聯(lián)網(wǎng)進(jìn)行內(nèi)容下載帶來了巨大挑戰(zhàn).AP覆蓋范圍內(nèi)的資源分配與Internet鏈接空洞區(qū)域的傳輸調(diào)度相互依賴,共同影響其下載性能,而現(xiàn)有文獻(xiàn)往往將二者孤立開來分別進(jìn)行研究.為了提高下載性能,將二者作為一個(gè)整體,從全局優(yōu)化的角度研究內(nèi)容下載的效率問題,并將其形式化為下載數(shù)據(jù)量最大的結(jié)合非沖突調(diào)度的資源分配問題.但是,在證明該問題是NP-難的基礎(chǔ)上,提出結(jié)合鏈接空洞區(qū)域的傳輸調(diào)度的資源分配近似算法(JAS)來解決該問題.該算法將整個(gè)鏈接空洞區(qū)域節(jié)點(diǎn)間鏈接的時(shí)空變化模型化為拓?fù)鋱D序列,并基于此構(gòu)建其傳輸沖突圖序列,在AP通信覆蓋區(qū)域基于圖序列計(jì)算優(yōu)化的資源分配節(jié)點(diǎn)集進(jìn)行資源分配,以期達(dá)到擴(kuò)展AP通信范圍、填補(bǔ)Internet鏈接空洞的目的.模擬實(shí)驗(yàn)結(jié)果表明,JAS算法與現(xiàn)有方法相比顯著提高了文件下載量及傳輸?shù)某晒β?此外,還對(duì)影響內(nèi)容下載性能的相關(guān)因素進(jìn)行了分析.
[Abstract]:The scarcity of vehicular network channel resources and the intermittent link between vehicle nodes,It is a great challenge for vehicle nodes to access the Internet through wireless access point (AP) to download content. The resource allocation within the coverage of AP and the transmission scheduling of the empty Internet link area depend on each other and affect the download performance together.But the existing literature often isolated the two to carry on the research separately.In order to improve the performance of download, the efficiency of content download is studied from the perspective of global optimization by taking both of them as a whole, and the form is transformed into a non-conflict scheduling resource allocation problem with the largest amount of download data.However, on the basis of proving that the problem is NP-hard, an approximate resource allocation algorithm (JAS), which combines the transport scheduling algorithm of the link empty area, is proposed to solve the problem.The algorithm models the spatio-temporal change of the links between nodes in the whole link void area into topological graph sequence, and constructs the transmission conflict graph sequence based on this sequence.In order to expand the AP communication range and fill the gap of Internet link, the resource allocation in AP communication coverage area is optimized based on graph sequence calculation.The simulation results show that compared with the existing methods, the JAS algorithm can significantly improve the file downloads and the success rate of transmission.In addition, the related factors that affect the performance of content download are also analyzed.
【作者單位】： 嘉興學(xué)院數(shù)理與信息工程學(xué)院;哈爾濱工業(yè)大學(xué)計(jì)算機(jī)科學(xué)與技術(shù)學(xué)院;
【基金】：國家自然科學(xué)基金(60803148,60973124,61300210,61370214) 教育部高校博士點(diǎn)科研基金(20102302110036)
【分類號(hào)】：TN929.5

【參考文獻(xiàn)】

相關(guān)期刊論文 前1條

1 陳麗;李治軍;姜守旭;方文濤;王帥;;車輛接入互聯(lián)網(wǎng)基于機(jī)會(huì)鏈接的資源分配[J];哈爾濱工業(yè)大學(xué)學(xué)報(bào);2013年05期

【共引文獻(xiàn)】

相關(guān)期刊論文 前1條

1 徐金玉;張澤麟;楊新;;結(jié)合機(jī)會(huì)鏈模型的聯(lián)合頻譜分配算法[J];電視技術(shù);2014年19期

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 曲曉飛,王眾嫭;一種新的多人資源分配理論——多目標(biāo)資源分配的協(xié)商對(duì)策[J];大連理工大學(xué)學(xué)報(bào);1989年04期

2 王慧;楊晨;張平;;移動(dòng)廣播融合網(wǎng)絡(luò)中的資源分配和定價(jià)模型[J];北京郵電大學(xué)學(xué)報(bào);2008年04期

3 甘志輝;董淼;汪偉;朱瑞波;;多載波TD-HSDPA信道的資源分配[J];移動(dòng)通信;2008年Z1期

4 張林;胡若;;基于排隊(duì)機(jī)制下多代理的資源分配沖突處理[J];計(jì)算機(jī)工程;2008年15期

5 王U，

本文編號(hào)：1713103