【摘要】：針對(duì)基于設(shè)備到設(shè)備(D2D)的汽車(chē)間通信復(fù)用蜂窩資源帶來(lái)的干擾問(wèn)題,考慮在滿足車(chē)輛用戶(V-UEs)的通信要求下,通過(guò)一個(gè)啟發(fā)式算法最大化蜂窩用戶(C-UEs)總的吞吐量.首先通過(guò)圖著色原理將沒(méi)有干擾的車(chē)輛分在同一簇;其次根據(jù)分簇結(jié)果,利用改進(jìn)的匈牙利指派算法為V-UEs分配信道;最后通過(guò)調(diào)整功率最大化C-UEs總的吞吐量.仿真結(jié)果表明,此算法能夠很好地解決車(chē)通信(V2X)的同層干擾和跨層干擾問(wèn)題,在保證V-UEs通信可靠性的前提下,提高了頻譜利用率.
[Abstract]:In view of the interference caused by the communication multiplexing cellular resources between vehicles based on device to device (D2D), this paper considers that under the condition of satisfying the communication requirements of vehicle users (V-UEs), A heuristic algorithm is used to maximize the total throughput of cellular users (C-UEs). First, the vehicles without interference are divided into the same cluster by graph coloring principle; secondly, according to the clustering result, the improved Hungarian assignment algorithm is used to allocate the channel for V-UEs; finally, the power is adjusted to maximize the total throughput of C-UEs. The simulation results show that the algorithm can solve the same layer interference and cross layer interference problem of vehicle communication (V2X), and improve the spectrum efficiency under the premise of guaranteeing the reliability of V-UEs communication.
【作者單位】： 重慶郵電大學(xué)移動(dòng)通信技術(shù)重慶市重點(diǎn)實(shí)驗(yàn)室;
【基金】：國(guó)家自然科學(xué)基金項(xiàng)目(61601071,61301122) 長(zhǎng)江學(xué)者和創(chuàng)新團(tuán)隊(duì)發(fā)展計(jì)劃基金項(xiàng)目(IRT16R72) 重慶市教委科學(xué)技術(shù)研究項(xiàng)目(KJ16004012)
【分類(lèi)號(hào)】：TN929.5
，

本文編號(hào)：2425691