基于激勵的機會網(wǎng)絡協(xié)作傳輸機制
發(fā)布時間:2017-12-30 22:10
本文關鍵詞:基于激勵的機會網(wǎng)絡協(xié)作傳輸機制 出處:《北京郵電大學》2015年碩士論文 論文類型:學位論文
更多相關文章: 機會網(wǎng)絡 負載分流 協(xié)作傳輸 激勵機制
【摘要】:智能終端設備在近幾年得到了廣泛的發(fā)展,其普及率逐漸提高,由于智能終端設備提供更好的操作系統(tǒng)支持,終端可以運行功能更加豐富的應用程序。用戶在體驗豐富多樣的移動應用的同時也帶來了移動數(shù)據(jù)業(yè)務需求的爆炸式增長。這一現(xiàn)狀給蜂窩網(wǎng)絡帶來了巨大的業(yè)務壓力,在一些移動節(jié)點密集的區(qū)域,網(wǎng)絡的性能會因為大量移動設備的數(shù)據(jù)業(yè)務請求而下降。為了分流網(wǎng)絡數(shù)據(jù)業(yè)務,提升網(wǎng)絡吞吐量,有必要引入健壯可靠的負載分流機制來提高網(wǎng)絡的整體性能。 在移動節(jié)點密集區(qū)域,節(jié)點之間的相遇頻率較高,彼此之間往往表現(xiàn)一定的社會關系。在這樣的場景下可以引入機會網(wǎng)絡,利用節(jié)點之間的協(xié)作傳輸分流移動數(shù)據(jù)。本文將傳統(tǒng)集中式網(wǎng)絡與機會網(wǎng)絡融合,構建混合網(wǎng)絡架構。在混合網(wǎng)絡架構的基礎上,本文設計混合傳輸路由協(xié)議,采用“機會傳輸為主,中心補傳為輔”的方針。路由算法在PRoPHET的基礎上引入傳輸空間和節(jié)點信譽概念,在保證數(shù)據(jù)交付率的同時有效控制副本數(shù)量。 由于節(jié)點往往表現(xiàn)一定的自私性,為了保證路由策略有效執(zhí)行,本文針對混合網(wǎng)絡架構設計了基于信譽的激勵機制。與傳統(tǒng)激勵機制不同,本文設計的激勵機制綜合考慮節(jié)點的社會屬性,主要工作集中在量化節(jié)點的關聯(lián)屬性上。通過構建量化模型,優(yōu)化了信譽更新因子,在信譽更新過程中,采用節(jié)點主動更新和被動更新兩種方式,優(yōu)化了更新算法,在有效懲罰自私節(jié)點同時,維護邊緣節(jié)點的利益,保證網(wǎng)絡的公平性。 本文還設計了針對混合網(wǎng)絡的仿真平臺,采用模塊化設計,具有很強的擴展性。其中,平臺中的節(jié)點單元可以理解為移動終端也可以理解為基站等中心設備。節(jié)點類中私有成員內(nèi)容豐富,能夠為路由模塊提供豐富的網(wǎng)絡數(shù)據(jù)支持,目前仿真平臺能夠順暢運行Epidemic、 CORE等經(jīng)典路由協(xié)議。
[Abstract]:Intelligent terminal equipment has been widely developed in recent years, its popularity has gradually increased, because intelligent terminal devices provide better operating system support. Terminals can run more functional applications. While users experience rich and diverse mobile applications, they also bring explosive growth in the demand for mobile data services. This situation has brought a huge industry to cellular networks. Pressure. In some areas where mobile nodes are dense, the performance of the network will decline because of a large number of data service requests from mobile devices. In order to split the network data services, improve the network throughput. It is necessary to introduce a robust and reliable load shunt mechanism to improve the overall performance of the network. In the mobile node dense area, the meeting frequency of the nodes is high, and the social relations between each other are often certain. In such a scenario, the opportunity network can be introduced. In this paper, the traditional centralized network and opportunity network are combined to construct the hybrid network architecture. Based on the hybrid network architecture, this paper designs the hybrid transport routing protocol. The routing algorithm introduces the concepts of transmission space and node reputation on the basis of PRoPHET. Ensure the data delivery rate while effectively controlling the number of copies. In order to ensure the effective implementation of routing strategy, this paper designs a credit-based incentive mechanism for hybrid network architecture, which is different from the traditional incentive mechanism. The incentive mechanism designed in this paper takes into account the social attributes of nodes, and the main work is focused on the correlation attributes of quantized nodes. By constructing a quantitative model, the reputation update factor is optimized, and in the process of reputation updating. Both active and passive updating methods are adopted to optimize the updating algorithm to maintain the interests of the edge nodes and ensure the fairness of the network while punishing the selfish nodes effectively. This paper also designed a simulation platform for hybrid networks, using modular design, which has a strong scalability. The node unit in the platform can be understood as a mobile terminal or a central device such as a base station. The private members in the node class are rich in content and can provide abundant network data support for the routing module. At present, the simulation platform can run the classic routing protocols such as Epidemicand CORE smoothly.
【學位授予單位】:北京郵電大學
【學位級別】:碩士
【學位授予年份】:2015
【分類號】:TN929.5
【參考文獻】
相關期刊論文 前4條
1 孫娟娟;禹繼國;劉祥濤;;面向P2P文件共享應用的相似度計算模型[J];計算機工程與應用;2012年04期
2 熊永平;孫利民;牛建偉;劉燕;;機會網(wǎng)絡[J];軟件學報;2009年01期
3 郭瑞;;智能手機發(fā)展新技術研究[J];中國新通信;2014年06期
4 王亞;肖明軍;;一種延遲容忍網(wǎng)絡數(shù)據(jù)聚集算法[J];小型微型計算機系統(tǒng);2013年06期
,本文編號:1356734
本文鏈接:http://sikaile.net/kejilunwen/wltx/1356734.html
最近更新
教材專著