本文選題：協(xié)作通信 + 自私節(jié)點(diǎn)　； 參考：《哈爾濱工業(yè)大學(xué)》2016年博士論文

【摘要】：協(xié)作通信技術(shù)通過允許鄰近節(jié)點(diǎn)共享彼此的天線發(fā)送信號,不僅能夠形成虛擬的多天線陣列獲得空間分集增益,改善接收端的信號質(zhì)量,還能夠形成中繼傳輸模式,擴(kuò)大信號的覆蓋范圍。因此,協(xié)作通信技術(shù)成為了未來無線通信系統(tǒng)對抗多徑衰落、提供高質(zhì)量及高速率服務(wù)所需的關(guān)鍵技術(shù)。然而,傳統(tǒng)的協(xié)作通信方面的研究大多是在節(jié)點(diǎn)自愿合作的假設(shè)上進(jìn)行的。當(dāng)網(wǎng)絡(luò)中的節(jié)點(diǎn)屬于不同的利益主體(用戶或者服務(wù)提供商)時(shí),節(jié)點(diǎn)為了節(jié)約自身的資源表現(xiàn)出“自私”的特性而不參與合作,因此,基于節(jié)點(diǎn)自愿合作的假設(shè)在實(shí)際的網(wǎng)絡(luò)應(yīng)用中往往是不現(xiàn)實(shí)的。為了使網(wǎng)絡(luò)中的“自私”節(jié)點(diǎn)通過合作來提高工作效率,完成同一通信任務(wù),以期達(dá)到“整體大于部分之和”的效應(yīng),有必要對激勵(lì)合作的策略進(jìn)行研究,進(jìn)而解決合作的必要性和前提條件、合作伙伴的選取、合作的實(shí)施策略及通過合作網(wǎng)絡(luò)中的節(jié)點(diǎn)或整個(gè)通信網(wǎng)絡(luò)得到何種好處等問題。因此,本文針對如何建立一套有效的激勵(lì)策略來促使網(wǎng)絡(luò)中的“自私”節(jié)點(diǎn)參與合作的研究,以使協(xié)作通信技術(shù)能夠應(yīng)用于具體的無線通信場景是十分必要和有意義的。針對無線網(wǎng)絡(luò)中的“自私”節(jié)點(diǎn)為了節(jié)約自身資源不愿合作這一問題,提出了基于交換帶寬資源的激勵(lì)合作方法。通過網(wǎng)絡(luò)中的節(jié)點(diǎn)分享彼此的帶寬資源達(dá)到建立合作并提高彼此收益的目的。首先,將節(jié)點(diǎn)間的協(xié)作帶寬分配建模為合作博弈中的談判問題,通過拉格朗日乘數(shù)法得到兩個(gè)用戶基于納什談判解(Nash Bargaining Solution,NBS)的協(xié)作帶寬分配;其次,提出了一種新的基于Kalai-Smorodinsky談判解(Kalai-Smorodinsky Bargaining Solution,KSBS)協(xié)作帶寬分配方法;并提出了兩種評價(jià)效用公平性的公平指數(shù),對基于NBS策略和KSBS策略的協(xié)作帶寬分配的公平性進(jìn)行了研究;最后,在分析了采用不同調(diào)制階數(shù)的M-QAM對合作性能的影響的基礎(chǔ)上,提出了一種自適應(yīng)調(diào)制KSBS(Adaptive Modulation KSBS,AM-KSBS)合作策略,該策略與非自適應(yīng)合作策略相比,能夠增加節(jié)點(diǎn)的合作范圍,并保證節(jié)點(diǎn)在合作時(shí)始終能夠獲得最佳的合作效用增益。提出了一種基于納什談判解的最優(yōu)價(jià)格激勵(lì)和基于粒子群發(fā)射功率優(yōu)化(Optimal Price Incentive Algorithm based on NBS and Optimal Transmit Power Algorithm based on Particle Swarm Optimization,OPINBS-OTPPSO)的協(xié)作算法,解決了激勵(lì)“自私”節(jié)點(diǎn)合作機(jī)制中如何激勵(lì)合作及何時(shí)合作的問題。針對第一問題,通過源節(jié)點(diǎn)對中繼節(jié)點(diǎn)轉(zhuǎn)發(fā)的數(shù)據(jù)進(jìn)行價(jià)格補(bǔ)償,從而達(dá)到促使網(wǎng)絡(luò)中的“自私”節(jié)點(diǎn)進(jìn)行合作的目的。同時(shí),將源節(jié)點(diǎn)和中繼節(jié)點(diǎn)協(xié)商價(jià)格的過程建模為談判問題,通過求解得到具有帕累托最優(yōu)性的激勵(lì)價(jià)格,從而保證源節(jié)點(diǎn)和中繼節(jié)點(diǎn)在合作中獲得最佳收益;針對第二個(gè)問題,當(dāng)源節(jié)點(diǎn)和中繼節(jié)點(diǎn)合作獲得的收益大于非合作的收益時(shí),雙方達(dá)成合作;進(jìn)一步,為了提高源節(jié)點(diǎn)和中繼節(jié)點(diǎn)的收益,采用粒子群優(yōu)化算法得到了源節(jié)點(diǎn)和中繼節(jié)點(diǎn)的最優(yōu)發(fā)射功率。最后,由仿真實(shí)驗(yàn)可以得出,所提OPINBS-OTPPSO算法,與隨機(jī)價(jià)格激勵(lì)相比,能使源節(jié)點(diǎn)和中繼節(jié)點(diǎn)在合作中獲得的收益達(dá)到最優(yōu);與源節(jié)點(diǎn)和中繼節(jié)點(diǎn)采用固定發(fā)射功率策略相比,能明顯提高中繼節(jié)點(diǎn)和源節(jié)點(diǎn)的收益,并保證系統(tǒng)的整體性能最優(yōu)。針對鮮有同時(shí)采用合作博弈與非合作博弈理論對同一網(wǎng)絡(luò)模型中的激勵(lì)問題進(jìn)行研究這一問題,將博弈論中的非合作博弈與合作博弈方法應(yīng)用到同一網(wǎng)絡(luò)模型中,通過價(jià)格激勵(lì)機(jī)制激勵(lì)網(wǎng)絡(luò)中的“自私”節(jié)點(diǎn)進(jìn)行合作。首先,采用合作與非合作博弈理論對合作發(fā)起節(jié)點(diǎn)(Initiating Cooperation Node,ICN)和合作參與節(jié)點(diǎn)(Participating Cooperation Node,PCN)在合作達(dá)成時(shí),ICN以多大帶寬通過PCN傳輸數(shù)據(jù),PCN以多大帶寬幫助ICN進(jìn)行數(shù)據(jù)傳輸?shù)膯栴}進(jìn)行了分析。盡管采用非合作博弈和合作博弈理論能夠達(dá)成相同的合作結(jié)果,但通過分析可以得出,合作博弈理論更適用于帶有中心控制節(jié)點(diǎn)的網(wǎng)絡(luò)系統(tǒng),而針對非中心控制網(wǎng)絡(luò)系統(tǒng),則非合作博弈理論更為適用。其次,提出了協(xié)作引擎(Cooperation Engine,CE)的概念,給出了CE基于博弈論的可實(shí)現(xiàn)算法,同時(shí)給出了帶有CE的三節(jié)點(diǎn)協(xié)作系統(tǒng)模型,用戶通過帶有CE的激勵(lì)和響應(yīng)機(jī)制達(dá)到建立合作的目的。最后,仿真實(shí)驗(yàn)表明,和沒有激勵(lì)合作機(jī)制的通信系統(tǒng)相比,提出的帶有CE的協(xié)作通信系統(tǒng),能夠顯著提高ICN的能量效率,并增加PCN的收益。
[Abstract]:Cooperative communication technology can send signals by allowing adjacent nodes to share each other's antennas, not only can form a virtual multi antenna array to gain spatial diversity gain, improve the signal quality of the receiver, but also form a relay transmission mode and expand the coverage of the signal. Therefore, the cooperative communication technology has become a future wireless communication system. Anti multipath fading provides the key technologies for high quality and high rate services. However, the traditional cooperative communication research is mostly based on the assumption of voluntary cooperation. When the nodes in the network belong to different stakeholders (users or service providers), the nodes show "selfishness" in order to save their own resources. Therefore, the assumption of voluntary cooperation based on nodes is often unrealistic in practical network applications. In order to improve the efficiency of the "selfish" nodes in the network and accomplish the same communication task in order to achieve the "overall greater than part of the sum" effect, it is necessary to cooperate with the incentive cooperation. The strategy is studied to solve the necessity and prerequisite of cooperation, the selection of partners, the implementation strategy of cooperation and the benefits of the nodes in the cooperative network or the whole communication network. Therefore, this paper aims at establishing an effective incentive strategy to promote the participation of "selfish" nodes in the network. In order to make cooperative communication technology applied to specific wireless communication scenes, it is very necessary and meaningful to study the cooperative communication technology in wireless networks. In order to save their own resources and not cooperate, the "selfish" node in wireless networks has proposed an incentive cooperative method based on exchange bandwidth resources. First, the cooperative bandwidth allocation among nodes is modeled as a negotiation problem in the cooperative game, and the Lagrange multiplier method is used to get two users based on the Nash Bargaining Solution (NBS) and the wide allocation of cooperative band. Secondly, a new kind of Kalai-Smorod based on Kalai-Smorod is proposed. Insky negotiation solution (Kalai-Smorodinsky Bargaining Solution, KSBS) cooperative bandwidth allocation method, and two fairness indexes for evaluating utility fairness are proposed, and the fairness of cooperative bandwidth allocation based on NBS strategy and KSBS strategy is studied. Finally, the basis of the effect of M-QAM on cooperative performance with different modulation orders is analyzed. On the basis of this, an adaptive KSBS (Adaptive Modulation KSBS, AM-KSBS) cooperation strategy is proposed. Compared with the non adaptive cooperative strategy, this strategy can increase the cooperation range of the nodes and ensure that the nodes can always obtain the best cooperative utility gain in cooperation. A kind of optimal price incentive based on the Nash negotiation solution is proposed. The cooperative algorithm based on particle swarm optimization (Optimal Price Incentive Algorithm based on NBS and Optimal Transmit Power Algorithm) solves the problem of how to motivate cooperation and cooperate in the cooperative mechanism of "selfish" node. At the same time, the process of negotiating the price between the source node and the relay node is modeled as a negotiation problem, and the incentive price with Pareto optimality is obtained to guarantee the source node and the relay node. In order to improve the revenue of the source node and relay node, in order to improve the revenue of the source node and relay node, the particle swarm optimization algorithm is used to obtain the optimal launch power of the source node and relay node. Finally, the second problems, in order to improve the revenue of the source node and relay node, are obtained. The simulation results show that the proposed OPINBS-OTPPSO algorithm, compared with the random price incentive, can make the revenue of the source node and the relay node achieve the best in cooperation. Compared with the fixed transmit power strategy of the source node and the relay node, the return of the relay node and the source node can be obviously improved and the overall performance of the system is optimal. In order to study the problem of incentive problems in the same network model with cooperative game theory and non cooperative game theory at the same time, the non cooperative game and cooperative game method in game theory are applied to the same network model, and the "selfish" nodes in the network are encouraged to cooperate with the price incentive mechanism. In cooperation with non cooperative game theory (Initiating Cooperation Node, ICN) and cooperative participation node (Participating Cooperation Node, PCN), the problem of ICN with much bandwidth to transmit data through PCN, and PCN with much bandwidth to help ICN to transmit data is analyzed. Cooperative game theory can achieve the same result of cooperation, but through analysis, it can be concluded that cooperative game theory is more suitable for network systems with central control nodes, and the non cooperative game theory is more applicable for non central control network systems. Secondly, the concept of Cooperation Engine (CE) is proposed and CE base is given. At the same time, the three node cooperative system model with CE is given in the game theory. The user can achieve cooperation through the incentive and response mechanism with CE. Finally, the simulation experiment shows that the proposed cooperative communication system with CE can significantly improve the energy of the ICN. Amount of efficiency and increase the income of PCN.

【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2016
【分類號】：TN92

【相似文獻(xiàn)】

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

1 梅中輝;李曉飛;;協(xié)作通信技術(shù)[J];數(shù)據(jù)通信;2009年05期

2 張超;廖曉光;王衛(wèi)東;衛(wèi)國;;基于功率最優(yōu)化分配的選擇性協(xié)作通信模式[J];中國科學(xué)技術(shù)大學(xué)學(xué)報(bào);2010年04期

3 廖素引;徐磊;趙燕;李桂華;衛(wèi)敏;;協(xié)作通信中網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)的最佳中繼定位[J];小型微型計(jì)算機(jī)系統(tǒng);2012年07期

4 詹瑞;劉俊;;協(xié)作通信技術(shù)的研究進(jìn)展[J];數(shù)字通信;2013年01期

5 杜偉華;劉紫燕;;兩跳中繼協(xié)作通信技術(shù)的研究與仿真[J];通信技術(shù);2013年02期

6 范鵬;;協(xié)作通信及其在移動(dòng)通信系統(tǒng)中的應(yīng)用[J];電信快報(bào);2013年03期

7 徐永杰;;基于不同中繼策略的協(xié)作通信技術(shù)研究[J];互聯(lián)網(wǎng)天地;2013年04期

8 商敏紅;;基于固定中繼的協(xié)作通信性能分析與仿真[J];大眾科技;2014年01期

9 李昌;阮秀凱;;協(xié)作通信中突發(fā)短幀信號的直接盲恢復(fù)[J];電子與信息學(xué)報(bào);2014年04期

10 朱康辛,李珂,李建華,諸鴻文;同步協(xié)作通信的發(fā)送方時(shí)延性能比較[J];通信技術(shù);2000年02期

相關(guān)會(huì)議論文 前7條

1 羅建中;覃團(tuán)發(fā);劉家鋒;;編碼協(xié)作通信中斷性能與協(xié)作系數(shù)分析[A];2009年中國高校通信類院系學(xué)術(shù)研討會(huì)論文集[C];2009年

2 趙賢敬;王薇;趙麗平;鄭明忠;鄭寶玉;;無線移動(dòng)網(wǎng)絡(luò)的協(xié)作通信方案研究[A];2008年中國通信學(xué)會(huì)無線及移動(dòng)通信委員會(huì)學(xué)術(shù)年會(huì)論文集[C];2008年

3 呂志興;;空時(shí)編碼協(xié)作通信技術(shù)研究進(jìn)展[A];2008年中國西部青年通信學(xué)術(shù)會(huì)議論文集[C];2008年

4 孟祥楠;李光球;;選擇合并自適應(yīng)協(xié)作通信系統(tǒng)的容量分析[A];浙江省電子學(xué)會(huì)2010學(xué)術(shù)年會(huì)論文集[C];2010年

5 張秋霞;仰楓帆;;正規(guī)LDPC碼協(xié)作通信與點(diǎn)對點(diǎn)通信轉(zhuǎn)化及比較[A];2010通信理論與技術(shù)新發(fā)展——第十五屆全國青年通信學(xué)術(shù)會(huì)議論文集（下冊）[C];2010年

6 季薇;鄭寶玉;江若宜;;協(xié)作通信的能量有效性和時(shí)間有效性研究[A];2009年通信理論與信號處理學(xué)術(shù)年會(huì)論文集[C];2009年

7 杜楊;曹儐;劉占軍;;無線網(wǎng)絡(luò)協(xié)作MAC機(jī)制研究[A];2009年全國無線電應(yīng)用與管理學(xué)術(shù)會(huì)議論文集[C];2009年

相關(guān)博士學(xué)位論文 前10條

1 唐蕾;LDPC編碼MIMO多中繼協(xié)作通信的性能研究和QC-LDPC碼的優(yōu)化設(shè)計(jì)[D];南京航空航天大學(xué);2013年

2 張燕;無線多天線協(xié)作通信系統(tǒng)研究[D];大連海事大學(xué);2015年

3 Waheed ur Rehman（瑞曼）;60GHz網(wǎng)絡(luò)的協(xié)作通信和資源分配技術(shù)[D];北京郵電大學(xué);2015年

4 李東武;協(xié)作通信中的分集接收技術(shù)研究[D];西安電子科技大學(xué);2015年

5 翟文艷;隧道無線協(xié)作通信系統(tǒng)容量與性能優(yōu)化[D];中國礦業(yè)大學(xué);2015年

6 姜華;無線通信系統(tǒng)的中繼協(xié)作關(guān)鍵技術(shù)研究[D];南京大學(xué);2013年

7 盧昊;多中繼協(xié)作通信的跨層設(shè)計(jì)與優(yōu)化[D];中國科學(xué)技術(shù)大學(xué);2016年

8 趙明雄;協(xié)作通信系統(tǒng)中若干關(guān)鍵技術(shù)研究[D];華南理工大學(xué);2016年

9 張闖;協(xié)作通信中基于博弈論的自私節(jié)點(diǎn)激勵(lì)策略研究[D];哈爾濱工業(yè)大學(xué);2016年

10 趙雄偉;協(xié)作通信關(guān)鍵技術(shù)研究[D];解放軍信息工程大學(xué);2009年

相關(guān)碩士學(xué)位論文 前10條

1 潘鑫;基于空間泊松點(diǎn)過程與社交網(wǎng)絡(luò)的D2D通信的研究[D];北京交通大學(xué);2016年

2 王帆;5G關(guān)鍵技術(shù)D2D的相關(guān)研究[D];北京交通大學(xué);2016年

3 孟凡梓;基于多點(diǎn)中繼協(xié)作的動(dòng)態(tài)多維協(xié)同能效優(yōu)化方法研究[D];東北大學(xué);2014年

4 鄒明荃;兩用戶多天線協(xié)作通信傳輸方案的研究[D];安徽大學(xué);2016年

5 趙尚卿;基于DF的認(rèn)知協(xié)作通信技術(shù)研究[D];河南理工大學(xué);2015年

6 徐菲;非理想條件下協(xié)作通信系統(tǒng)性能分析與優(yōu)化[D];蘇州大學(xué);2016年

7 魏繼堯;協(xié)作通信中多用戶調(diào)度策略的研究[D];蘇州大學(xué);2016年

8 馮琳琳;協(xié)作通信系統(tǒng)中用戶/中繼選擇技術(shù)的研究[D];山東大學(xué);2016年

9 胡國龍;基于和速率的協(xié)作通信功率分配算法研究[D];新疆大學(xué);2016年

10 仇艮祥;協(xié)作通信中的能效分析與優(yōu)化[D];南京郵電大學(xué);2016年

，

本文編號：1789012