本文關(guān)鍵詞： 融合網(wǎng)絡(luò) 應(yīng)急通信 Bandit理論 有限狀態(tài)馬爾科夫鏈 多路徑 多網(wǎng)關(guān)　出處：《計算機工程》2017年03期 　論文類型：期刊論文

【摘要】：傳統(tǒng)的無線通信網(wǎng)絡(luò)由于結(jié)構(gòu)單一,性能上諸多受限,難以保障應(yīng)急通信的質(zhì)量。為此,在認知無線自組織網(wǎng)絡(luò)與移動蜂窩網(wǎng)絡(luò)相融合的新背景下,提出一種多路徑Bandit算法。將通信中的選路過程分為多時隙路徑選擇子階段,通過對權(quán)衡網(wǎng)絡(luò)時延和能效目標函數(shù)的計算進行路徑優(yōu)選,從而合理地分布網(wǎng)絡(luò)中各節(jié)點的能耗。仿真結(jié)果表明,對比非應(yīng)急業(yè)務(wù)應(yīng)用和貪婪算法,在融合網(wǎng)絡(luò)應(yīng)急業(yè)務(wù)應(yīng)用下,多路徑Bandit算法的網(wǎng)絡(luò)生存期提高了3%~20%。
[Abstract]:The traditional wireless communication network is difficult to guarantee the quality of emergency communication because of its single structure and limited performance. Therefore, under the new background of cognitive wireless ad hoc network and mobile cellular network, it is difficult to guarantee the quality of emergency communication. In this paper, a multipath Bandit algorithm is proposed. The routing process in communication is divided into the sub-stage of multi-slot path selection, and the path optimization is carried out by calculating the tradeoff between the network delay and the energy efficiency objective function. The simulation results show that compared with the non-emergency service and greedy algorithm, the multipath Bandit algorithm can improve the network lifetime by 30% in the case of fusion network emergency service application, and the simulation results show that compared with the non-emergency service application and the greedy algorithm, the network lifetime of the multi-path Bandit algorithm is improved by 30%.
【作者單位】： 桂林電子科技大學信息與通信學院;通信網(wǎng)信息傳輸與分發(fā)技術(shù)國家重點實驗室;
【基金】：國家自然科學基金(61362006) 廣西自然科學基金(2014GXNSFBA118288) 廣西無線寬帶通信和信號處理重點實驗室主任基金(GXKL061501) 通信網(wǎng)信息傳輸與分發(fā)技術(shù)國家重點實驗室開放課題(ITD-U14008/KX142600015)
【分類號】：TN929.5
，

本文編號：1506549