【摘要】：結(jié)合離散時間排隊理論和博弈論,進行了認知無線網(wǎng)絡中頻譜分配策略的社會最優(yōu)問題的研究。考慮到主用戶(PUs)對次級用戶(SUs)數(shù)據(jù)包的傳輸中斷,建立了一個帶有傳輸中斷及中斷重傳的排隊模型,并使用矩陣幾何解的方法進行排隊模型的穩(wěn)態(tài)分析,給出了次級用戶數(shù)據(jù)包的平均延遲。從不可觀察的排隊規(guī)則出發(fā),令次級用戶數(shù)據(jù)包根據(jù)傳輸所獲得的回報及逗留在系統(tǒng)中所花費的代價決定是否加入緩存,揭示次級用戶數(shù)據(jù)包在個人最優(yōu)策略下的加入率大于社會最優(yōu)策略下的加入率。針對不同的數(shù)據(jù)包到達率及服務率,通過數(shù)值實驗,給出了次級用戶接入頻譜的合理費用,實現(xiàn)頻譜分配的社會最優(yōu)。
[Abstract]:Based on discrete time queuing theory and game theory, the social optimal problem of spectrum allocation strategy in cognitive wireless networks is studied. Considering the transmission interruption of secondary user (SUs) data packet by primary user (PUs), a queue model with transmission interrupt and interrupt retransmission is established, and the steady-state analysis of queue model is carried out by using the method of matrix geometric solution. The average delay of secondary user packet is given. Unobservable queuing rules allow secondary user packets to decide whether to join the cache based on the return they receive from the transmission and the cost of staying on the system. It is revealed that the rate of joining secondary user packets under the individual optimal strategy is greater than that under the social optimal strategy. According to different packet arrival rate and service rate, the reasonable cost of secondary users' access spectrum is given through numerical experiments, and the social optimum of spectrum allocation is realized.
【作者單位】： 燕山大學信息科學與工程學院;河北省計算機虛擬技術(shù)與系統(tǒng)集成重點實驗室;
【基金】：國家自然科學基金(11201408) 河北省自然科學基金(2012203093)資助項目
【分類號】：TN925;O226
，

本文編號：2421798