發(fā)布時間：2018-04-21 22:23

  本文選題：D2D通信 + 內(nèi)容共享��； 參考：《北京交通大學》2017年碩士論文

【摘要】：隨著移動通信技術(shù)的不斷發(fā)展,移動通信致力于為用戶提供高速率、低能耗、低時延、個性化等新型服務。Device-to-Device(D2D)通信作為一種新的移動通信技術(shù),在未來通信系統(tǒng)中極具發(fā)展前景,發(fā)展也日趨完善。D2D通信技術(shù)不僅能夠降低終端的發(fā)射功率、增加蜂窩系統(tǒng)的頻譜效率,還可以幫助用戶下載相鄰用戶的文件,從而降低蜂窩網(wǎng)基站的負載率,提升小區(qū)系統(tǒng)的吞吐量。本文致力于考慮D2D通信內(nèi)容共享過程中內(nèi)容發(fā)送用戶激勵與分配機制的設(shè)計。本文提出了一種綜合打分激勵機制來激勵更多的內(nèi)容發(fā)送用戶頻繁地、安全地參與到D2D通信內(nèi)容共享過程中。該機制不僅考慮內(nèi)容發(fā)送用戶的當前傳輸速率等情況,還考慮用戶的歷史發(fā)送內(nèi)容情況,將歷史發(fā)送情況與當前的回報值掛鉤,從而達到長期激勵用戶的目的。另一方面,該機制根據(jù)發(fā)送內(nèi)容的大小選擇擁有合適傳輸速率的發(fā)送者來通過D2D通信傳輸內(nèi)容。仿真結(jié)果表明,本文設(shè)計的機制可以長期的激勵用戶更頻繁地、更安全地參與到D2D通信內(nèi)容共享過程中,從而降低蜂窩網(wǎng)基站的負載。本文還提出了一種內(nèi)容發(fā)送用戶的分配制度,與本文提出的綜合打分激勵機制相結(jié)合,通過將分配問題轉(zhuǎn)化成矩陣元素選取問題,最后通過匈牙利算法求得最優(yōu)解,將各個內(nèi)容發(fā)送用戶合理地分配給不同的內(nèi)容接收用戶完成D2D通信內(nèi)容共享過程,以達到全局最優(yōu)。系統(tǒng)仿真結(jié)果表明,本文提出的D2D通信內(nèi)容共享激勵與分配機制達到了很好的效果,隨著小區(qū)內(nèi)發(fā)送用戶數(shù)量的增加,被選定的發(fā)送用戶三個方面的得分都在逐漸增加,并且通過匈牙利算法進行分配后,所有內(nèi)容接收用戶的選定發(fā)送用戶的平均得分也在逐漸增加。
[Abstract]:With the continuous development of mobile communication technology, mobile communication is committed to providing users with high speed, low energy consumption, low delay, personalization and other new services. As a new mobile communication technology, mobile communication has a great development prospect in future communication systems. The development of .D2D communication technology can not only reduce the transmission power of the terminal, increase the spectrum efficiency of the cellular system, but also help users download the files of the adjacent users, thus reducing the load rate of the base station in the cellular network. Improve cell system throughput. This paper focuses on the design of incentive and allocation mechanism for content sending users in D2D communication content sharing process. In this paper, a comprehensive scoring incentive mechanism is proposed to encourage more content sender users to participate in the process of D2D communication content sharing frequently and safely. This mechanism not only considers the current transmission rate of the content sender user, but also considers the historical transmission content situation of the user, and links the historical transmission situation with the current return value so as to achieve the purpose of motivating the user for a long time. On the other hand, according to the size of the transmitted content, the mechanism selects the sender with the appropriate transmission rate to transmit the content through D2D communication. Simulation results show that the mechanism designed in this paper can encourage users to participate in D2D communication content sharing more frequently and safely for a long time, thus reducing the load of cellular base stations. This paper also proposes an allocation system for content sending users, which combines with the comprehensive scoring incentive mechanism proposed in this paper. By transforming the assignment problem into a matrix element selection problem, the optimal solution is obtained by the Hungarian algorithm. Each content sending user is assigned to different content receiving users reasonably to complete the D2D communication content sharing process in order to achieve the global optimum. The system simulation results show that the D2D communication content sharing incentive and allocation mechanism proposed in this paper has achieved good results. With the increase of the number of sending users in the cell, the scores of the three aspects of the selected sender are gradually increasing. And the average score of the selected sender of all content receiving users increases gradually after the allocation by Hungarian algorithm.
【學位授予單位】：北京交通大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TN929.5

【參考文獻】

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

1 黃靜;;開放教育學員激勵策略研究——以馬斯洛層次需求理論為出發(fā)點[J];陜西廣播電視大學學報;2016年03期

2 丁蕙;屠國元;;期望價值理論與教師期望效應的激勵機制[J];教育評論;2014年09期

3 潘秀霞;杜吉祥;;馬斯洛層次需求理論的人工情感建模[J];華僑大學學報(自然科學版);2010年01期

4 黎文邊;林粵偉;王小猛;馮志勇;張平;;認知無線網(wǎng)絡(luò)中基于微觀經(jīng)濟學的動態(tài)頻譜管理算法[J];電子與信息學報;2009年04期

5 葉滿城;;探究式教學方法在《微觀經(jīng)濟學》教學中的應用[J];教育科學;2009年01期

6 汝華琴;;淺析“馬斯洛需求層次理論”對員工的激勵[J];才智;2009年03期

7 董玲;陳閩紅;;馬斯洛需要層次理論與完善公務員激勵機制[J];山東行政學院山東省經(jīng)濟管理干部學院學報;2006年01期

8 郭卜樂;馬斯洛的需要層次理論[J];教師博覽;2005年09期

9 王勇;吳梅;侯俊;潘泉;;基于匈牙利算法的協(xié)同作戰(zhàn)排序問題最優(yōu)解[J];彈箭與制導學報;2005年S6期

10 常庭懋,韓中庚;用“匈牙利算法”求解一類最優(yōu)化問題[J];信息工程大學學報;2004年01期

相關(guān)碩士學位論文 前1條

1 徐同剛;D2D通信系統(tǒng)的工作模式的選擇研究[D];南京郵電大學;2013年

，

本文編號：1784340