本文關(guān)鍵詞：機(jī)會(huì)網(wǎng)絡(luò)中數(shù)據(jù)傳輸策略研究　出處：《哈爾濱工業(yè)大學(xué)》2017年博士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 機(jī)會(huì)網(wǎng)絡(luò) 路由策略 自私性 安全性

【摘要】：無線自組織網(wǎng)絡(luò)是一種無需基礎(chǔ)設(shè)施、以自組織和多跳的方式構(gòu)成的無線網(wǎng)絡(luò),并且具有部署便捷、組網(wǎng)靈活等優(yōu)點(diǎn),所以得到了廣泛的應(yīng)用。但是,在一些實(shí)際應(yīng)用環(huán)境中,由于節(jié)點(diǎn)移動(dòng)、節(jié)點(diǎn)稀疏,以及節(jié)點(diǎn)通信能力受限等因素會(huì)造成無線自組織網(wǎng)絡(luò)的傳輸鏈路出現(xiàn)間斷性連通。為了在上述環(huán)境中實(shí)現(xiàn)有效的數(shù)據(jù)通信,機(jī)會(huì)網(wǎng)絡(luò)應(yīng)運(yùn)而生。機(jī)會(huì)網(wǎng)絡(luò)是一種特殊的自組織網(wǎng)絡(luò),它能夠利用節(jié)點(diǎn)移動(dòng)帶來的相遇機(jī)會(huì)以“存儲(chǔ)-攜帶-轉(zhuǎn)發(fā)”的方式實(shí)現(xiàn)間斷性連通環(huán)境下的數(shù)據(jù)通信。這種特殊的通信方式給機(jī)會(huì)網(wǎng)絡(luò)中數(shù)據(jù)傳輸策略的設(shè)計(jì)帶來極大的挑戰(zhàn)。因此,本文主要圍繞機(jī)會(huì)網(wǎng)絡(luò)中數(shù)據(jù)傳輸所面臨的一些挑戰(zhàn)性問題展開研究,研究?jī)?nèi)容包括以下幾個(gè)部分:第一,提出了一種基于接入控制的機(jī)會(huì)路由策略O(shè)RAC。傳統(tǒng)路由策略在數(shù)據(jù)傳輸中無法有效利用無線網(wǎng)絡(luò)的廣播特性,一旦選定的鏈路中斷必須重新尋路再次發(fā)送。因此,設(shè)計(jì)有效的傳輸策略為用戶提供良好的服務(wù)質(zhì)量是一個(gè)有意義但是富有挑戰(zhàn)性的工作,尤其在多種業(yè)務(wù)流并存且資源受限的情況下。受此啟發(fā),本文提出了一種基于接入控制的機(jī)會(huì)路由傳輸策略O(shè)RAC,它采用一種新的考慮節(jié)點(diǎn)各種資源(帶寬、緩存和能量)的接入控制策略來選擇節(jié)點(diǎn)的候選集,并且改進(jìn)了原有機(jī)會(huì)路由機(jī)制使其能有效地為多種類型的業(yè)務(wù)流服務(wù)。ORAC策略可以有效地解決由于網(wǎng)絡(luò)擁塞造成的丟包,進(jìn)而提高傳輸效率,為各種類型的業(yè)務(wù)流提供更好的服務(wù)質(zhì)量。最后,通過仿真實(shí)驗(yàn),比較了ORAC策略與經(jīng)典的機(jī)會(huì)路由策略在三類不同業(yè)務(wù)流共存時(shí)的傳輸時(shí)延。此外,還比較了ORAC與基于接入控制的帶寬感知機(jī)會(huì)路由在系統(tǒng)吞吐量、流接受率、平均時(shí)延、開銷、節(jié)點(diǎn)平均能耗和網(wǎng)絡(luò)壽命方面的性能,并通過仿真結(jié)果驗(yàn)證了ORAC策略在上述各方面具有較好的性能。第二,提出了一種基于合作博弈論的路由轉(zhuǎn)發(fā)策略Game R。機(jī)會(huì)網(wǎng)絡(luò)中現(xiàn)有的路由策略分為單拷貝策略和多拷貝策略。單拷貝策略可以節(jié)省網(wǎng)絡(luò)資源,但具有較長(zhǎng)的傳輸時(shí)延和較低的成功傳輸率。多拷貝策略可以增加網(wǎng)絡(luò)的魯棒性、減少數(shù)據(jù)傳輸時(shí)延,但消耗大量的網(wǎng)絡(luò)資源、具有較大的開銷。因此,在資源受限的情況下,如何在單拷貝和多拷貝之間做一個(gè)很好的折中顯得非常重要。受此啟發(fā),本文提出一種基于納什議價(jià)解(Nash bargaining solution)的路由策略Game R。它將分布式數(shù)據(jù)傳輸映射為一個(gè)多方議價(jià)博弈模型,通過構(gòu)造合適的效用函數(shù)實(shí)現(xiàn)數(shù)據(jù)的有效傳輸。Game R策略結(jié)合了單拷貝和多拷貝策略的優(yōu)點(diǎn),可以有效利用網(wǎng)絡(luò)資源,并提高了數(shù)據(jù)的成功傳輸率,減少網(wǎng)絡(luò)開銷。通過實(shí)驗(yàn)仿真,分別比較了Game R路由策略與經(jīng)典的單拷貝路由、多拷貝路由,以及固定副本數(shù)的路由策略在消息的成功傳輸率、平均時(shí)延、開銷、有效吞吐量,以及一個(gè)綜合指標(biāo)五個(gè)方面的性能。實(shí)驗(yàn)表明,Game R路由策略在成功傳輸率、有效吞吐量,以及綜合性能方面明顯優(yōu)于其他所比較路由策略,并且其開銷和平均時(shí)延也較小。第三,針對(duì)機(jī)會(huì)網(wǎng)絡(luò)中節(jié)點(diǎn)自私的情況,提出了一種基于博弈論的激勵(lì)感知路由策略IAR-GT。機(jī)會(huì)網(wǎng)絡(luò)中的節(jié)點(diǎn)可能由于資源不足或意愿性等因素表現(xiàn)出一定的自私性,這種自私性又可分為個(gè)體自私和社會(huì)自私�，F(xiàn)有的大部分研究工作都是分別考慮這兩種自私性,但在機(jī)會(huì)網(wǎng)絡(luò)中,這兩種自私性可能同時(shí)存在。因此,在機(jī)會(huì)網(wǎng)絡(luò)中,如何兼顧這兩種自私性設(shè)計(jì)一種有效激勵(lì)路由策略是一個(gè)非常有意義又具有挑戰(zhàn)性的問題。針對(duì)此問題,本文提出了一種基于魯賓斯坦恩-斯塔爾議價(jià)博弈的激勵(lì)感知路由策略。它將兩個(gè)自私節(jié)點(diǎn)之間的數(shù)據(jù)轉(zhuǎn)發(fā)映射為魯賓斯坦恩-斯塔爾議價(jià)博弈,并且利用虛擬貨幣和構(gòu)建博弈雙方的價(jià)格函數(shù)來實(shí)現(xiàn)自私節(jié)點(diǎn)間的數(shù)據(jù)傳輸。利用真實(shí)數(shù)據(jù)集的仿真實(shí)驗(yàn),在網(wǎng)絡(luò)中節(jié)點(diǎn)自私的情況下,分別比較了IAR-GT路由策略與三種經(jīng)典機(jī)會(huì)網(wǎng)絡(luò)路由策略以及一種基于激勵(lì)的路由策略在消息的成功傳輸率、平均時(shí)延、開銷、以及一個(gè)綜合指標(biāo)四個(gè)方面的性能。實(shí)驗(yàn)表明,IAR-GT策略在成功傳輸率、平均時(shí)延、以及綜合性能方面都優(yōu)于其他幾種路由策略。第四,在機(jī)會(huì)網(wǎng)絡(luò)中節(jié)點(diǎn)存在惡意攻擊的情況下,提出了一種基于社會(huì)信任的安全路由協(xié)議,SSNCR。機(jī)會(huì)網(wǎng)絡(luò)主要通過節(jié)點(diǎn)移動(dòng)機(jī)會(huì)與相遇節(jié)點(diǎn)進(jìn)行通信,它不存在一條端到端的路徑,并且鏈路經(jīng)常變化及具有延遲容忍特性,這將使惡意行為對(duì)網(wǎng)絡(luò)有更大的機(jī)會(huì)進(jìn)行攻擊,從而損害了整個(gè)網(wǎng)絡(luò)性能。因此,如何設(shè)計(jì)安全高效的路由策略顯得尤為重要。針對(duì)此問題,本文提出了一種基于社會(huì)信任的安全路由策略。該策略采用一種新的基于節(jié)點(diǎn)狀態(tài)信息和社會(huì)關(guān)系的安全路由度量標(biāo)準(zhǔn),并且根據(jù)此標(biāo)準(zhǔn)所選信任節(jié)點(diǎn)進(jìn)行數(shù)據(jù)轉(zhuǎn)發(fā),從而實(shí)現(xiàn)數(shù)據(jù)傳輸中對(duì)節(jié)點(diǎn)的預(yù)先答應(yīng)而丟包,信任聚集和誹謗三種攻擊的有效防護(hù)。同時(shí),該策略采用網(wǎng)絡(luò)編碼技術(shù)將要發(fā)送的數(shù)據(jù)包進(jìn)行編碼操作,加快了可信節(jié)點(diǎn)的數(shù)據(jù)傳輸進(jìn)程并減少數(shù)據(jù)冗余。最后,利用真實(shí)數(shù)據(jù)集的仿真實(shí)驗(yàn),分別比較了所提安全路由SSNCR與兩種經(jīng)典路由以及一種安全路由策略在成功傳輸率、平均傳輸時(shí)延、傳輸開銷,以及平均信任值方面的性能。仿真實(shí)驗(yàn)表明,隨著網(wǎng)絡(luò)中異常節(jié)點(diǎn)數(shù)比例的增加,所提策略可以有效阻止惡意節(jié)點(diǎn)攻擊,并且其成功傳輸率,傳輸時(shí)延和開銷方面都取得較優(yōu)的結(jié)果。
[Abstract]:Wireless ad hoc network is an infrastructureless wireless network, composed of self-organizing and multi hop mode, and has the advantages of convenient deployment, flexible networking, so it has been widely used. However, in some practical applications, due to the mobility of nodes, node sparse, transmission link and node communication limited the ability factors of wireless ad hoc networks appear intermittently connected. In order to achieve efficient communication of data in the network environment, the opportunity came into being. The opportunity network is a special kind of self-organizing network, it can use the opportunity to meet the mobile node "store carry forward" approach to continuous data the communication connectivity environment. This special communication brought great challenges to the design of data transmission scheme in opportunistic networks. Therefore, this paper mainly focuses on the opportunity network number According to some of the challenges facing the problem of the transmission research, the research content includes the following parts: first, put forward a kind of radio access control characteristics of opportunistic routing strategy of ORAC. routing strategy based on the traditional data transmission can not effectively use the wireless network, once the selected link interruption must re routing sent again. Therefore, the transmission effective strategies for the user to provide a good quality of service is a meaningful but challenging work, especially in a variety of business flow and the coexistence of resource constrained situation. Inspired by this, this paper proposes an access control strategy of ORAC based on opportunistic routing transmission, it uses a new variety of nodes resources (bandwidth, buffer and energy) access control strategy to select the node of the candidate set, and improved routing mechanism can effectively make the original opportunities for a variety of types The service.ORAC strategy can effectively solve the packet loss due to network congestion, and improve the transmission efficiency, to provide better quality of service for various types of traffic flow. Finally, through the simulation experiment, compared with the classical ORAC strategy opportunity routing strategy flow transmission delay coexist in three different types of business. In addition, comparison of the ORAC and bandwidth aware access control based on chance routing in system throughput, average delay, flow rate of acceptance, cost, performance, average energy consumption of nodes and network lifetime, and the simulation results verified that the ORAC method has better performance in the above aspects. Second, proposed an existing routing forwarding strategy strategy Game R. chance of cooperative game theory based routing in the network is divided into single copy strategy and multi copy strategy. Single copy strategy can save cyber source but with longer transmission. Transmission delay and low delivery success rate. Multi copy strategy can increase the robustness of the network and reduce the data transmission delay, but consume a large amount of cyber source has a larger, overhead. Therefore, in the condition of limited resources, how in a single copy and multiple copies of a good compromise is very important. Inspired by this, this paper puts forward a kind of based on Nash bargaining solution (Nash bargaining solution) routing strategy Game R. it will be mapped to a data transmission of distributed multi-party bargaining game model, the utility function to construct appropriate implementation of effective transmission of.Game R data combined with the strategy of single copy and multiple copy strategy has effectively the use of cyber source, and improve the success rate of data transmission and reduce the network overhead. The simulation results were compared with the classical Game R routing strategy for single copy routing, multi copy routing, to The routing strategy and the number of copies of fixed rate, average delay, cost, throughput in the successful transmission of the message, and the performance of the five aspects of a comprehensive index. The experimental results show that the effective throughput of Game R routing strategy in the successful transmission rate, and the overall performance is better than other comparative routing strategy, and its cost and the average delay is small. Third, the opportunity to selfish nodes in the network, this paper proposes a node incentive aware IAR-GT. routing strategy opportunity of game theory in the network may be based on due to the lack of resources or other factors will show some selfish, the selfish and can be divided into individual selfish and social existing selfish. Most research work is considered the two selfish respectively, but in the opportunistic network, these two kinds of selfishness may exist at the same time. Therefore, the opportunity to network, how to balance the two Self designing an effective incentive routing strategy is a very meaningful and challenging problem. To solve this problem, this paper proposes a strategy of incentive Lubinsitanen - aware routing based on Starr bargaining game. It will be between two selfish nodes to forward data mapping for Lubinsitanen - Starr bargaining game, the price function and the use of virtual money and the construction of the game both sides to realize the data transmission between selfish nodes. Using simulation experiments on real data sets, in the case of selfish nodes in the network, respectively, compared with the three classical IAR-GT routing strategy opportunity network routing strategy and a routing strategy based on the excitation of the successful transmission of message rate. The average latency, overhead, and performance of the four aspects of a comprehensive index. The experimental results show that the average delay of IAR-GT strategy in the successful transmission rate, and comprehensive The performance is better than the other fourth. There are several routing strategies, nodes in opportunistic networks in the case of malicious attacks, proposes a security routing protocol based on social trust, SSNCR. network mainly through mobile nodes to meet opportunities and communication, it does not exist an end-to-end path, and often change link and with delay tolerant characteristics, which has a greater chance of network attacks malicious behavior, which impairs the performance of the network. Therefore, how to design a secure and efficient routing strategy is particularly important. To solve this problem, this paper proposes a secure routing strategy based on social trust. This strategy uses a new the measure of security routing node state information and based on the social relation, and according to the standard of the selected trusted nodes for data forwarding, so as to realize the data transmission of Promised and loss of nodes, trust aggregation and effective protection of three kinds of slander attacks. At the same time, using the network technology of the encoding strategy will send packet encoding operation, the speed of data transmission process of trusted nodes and reduce data redundancy. Finally, simulation experiments using real data sets, the proposed respectively. Secure routing SSNCR and two kinds of classic Routing and a secure routing strategy in the successful transmission rate, average transmission delay, transmission overhead, and the average trust value performance. Simulation results show that with the increase in the proportion of abnormal network nodes, the proposed strategy can effectively prevent malicious attacks, and the successful transmission rate. Get better results of transmission delay and overhead.

【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN929.5

【相似文獻(xiàn)】

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

1 黨群,曲榮欣,黨誠;一種確定路由策略沖突級(jí)別的方法[J];計(jì)算機(jī)工程;2004年21期

2 趙會(huì)群,蔣亞軍,孫晶,李正熙,高遠(yuǎn);路由聯(lián)盟建模與震蕩檢測(cè)[J];小型微型計(jì)算機(jī)系統(tǒng);2005年09期

3 曲榮欣;張春宏;高遠(yuǎn);;基于安全配置準(zhǔn)則的路由策略沖突級(jí)別的確定[J];計(jì)算機(jī)工程;2006年11期

4 徐昕;顧云麗;;自私路由及其解決方法[J];科技資訊;2008年29期

5 曹煦暉;;混合式P2P的路由搜索算法[J];集美大學(xué)學(xué)報(bào)(自然科學(xué)版);2009年03期

6 唐明董;張國清;楊景;張國強(qiáng);;互聯(lián)網(wǎng)可擴(kuò)展路由[J];軟件學(xué)報(bào);2010年10期

7 楊鋒;;路由策略與策略路由分析及實(shí)例一則[J];中國教育網(wǎng)絡(luò);2007年11期

8 陳弘,劉彥,高軍,楊宇航;路由仲裁技術(shù)在交換網(wǎng)絡(luò)中心建設(shè)中的研究和應(yīng)用[J];計(jì)算機(jī)工程;2000年02期

9 趙玉震;骨干出口路由策略及節(jié)點(diǎn)增容方案探討[J];電信建設(shè);2003年06期

10 趙會(huì)群,孫晶,王國仁,高遠(yuǎn);路由網(wǎng)絡(luò)代數(shù)[J];計(jì)算機(jī)學(xué)報(bào);2004年07期

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

1 趙會(huì)群;孫晶;高遠(yuǎn);;一種基于路由網(wǎng)絡(luò)代數(shù)的路由振蕩檢測(cè)算法[A];第十屆全國容錯(cuò)計(jì)算學(xué)術(shù)會(huì)議論文集[C];2003年

2 嚴(yán)鋼;周濤;傅忠謙;汪秉宏;;復(fù)雜網(wǎng)絡(luò)上的有效路由(英文)[A];第二屆全國復(fù)雜動(dòng)態(tài)網(wǎng)絡(luò)學(xué)術(shù)論壇論文集[C];2005年

3 李玉劍;楊涵新;汪秉宏;;信息處理延時(shí)情況下通訊網(wǎng)絡(luò)中路由策略研究[A];第五屆全國復(fù)雜網(wǎng)絡(luò)學(xué)術(shù)會(huì)議論文（摘要）匯集[C];2009年

4 郭成安;李建華;李明偉;;自適應(yīng)分布式路由算法研究的新進(jìn)展[A];新世紀(jì) 新機(jī)遇 新挑戰(zhàn)——知識(shí)創(chuàng)新和高新技術(shù)產(chǎn)業(yè)發(fā)展（上冊(cè)）[C];2001年

5 周萬春;吳博;;一種優(yōu)化的分層式移動(dòng)IPv6路由策略的分析與研究[A];2007年全國開放式分布與并行計(jì)算機(jī)學(xué)術(shù)會(huì)議論文集(上冊(cè))[C];2007年

6 張雪松;胡九川;鄭崇友;鐘章隊(duì);;基于可能性分布的資源質(zhì)量路由[A];第12屆全國模糊系統(tǒng)與模糊數(shù)學(xué)學(xué)術(shù)年會(huì)論文集[C];2004年

7 劉晶晶;;煤炭企業(yè)網(wǎng)絡(luò)多出口路由平臺(tái)的規(guī)劃與實(shí)施[A];煤礦安全、高效、潔凈開采——機(jī)電一體化新技術(shù)學(xué)術(shù)會(huì)議論文集[C];2009年

8 姚諦;胡慧俐;朱培棟;;基于加同態(tài)加密機(jī)制的互聯(lián)網(wǎng)路由異常檢測(cè)[A];全國網(wǎng)絡(luò)與信息安全技術(shù)研討會(huì)論文集（上冊(cè)）[C];2007年

9 趙會(huì)群;孫晶;高遠(yuǎn);;路由“活鎖”檢測(cè)方法[A];全國第13屆計(jì)算機(jī)輔助設(shè)計(jì)與圖形學(xué)（CAD/CG）學(xué)術(shù)會(huì)議論文集[C];2004年

10 金巨亮;;遼寧聯(lián)通互聯(lián)網(wǎng)網(wǎng)絡(luò)扁平化路由策略研究及實(shí)施[A];中國通信學(xué)會(huì)信息通信網(wǎng)絡(luò)技術(shù)委員會(huì)2011年年會(huì)論文集（上冊(cè)）[C];2011年

相關(guān)重要報(bào)紙文章 前10條

1 云;全面控制Internet路由[N];中國計(jì)算機(jī)報(bào);2001年

2 ;線速交換 安全路由[N];中國計(jì)算機(jī)報(bào);2003年

3 ;智能路由控制改進(jìn)BGP[N];網(wǎng)絡(luò)世界;2002年

4 瀟瀟;會(huì)診中山大學(xué)[N];中國電腦教育報(bào);2003年

5 林海;IP地址需雙管齊下加速申請(qǐng)[N];中國高新技術(shù)產(chǎn)業(yè)導(dǎo)報(bào);2006年

6 楊文清　馬騰;如何搜集民事訴訟網(wǎng)絡(luò)證據(jù)[N];榆林日?qǐng)?bào);2011年

7 亞信公司應(yīng)用咨詢部 韓少云;運(yùn)用網(wǎng)絡(luò)技術(shù) 分析網(wǎng)絡(luò)業(yè)務(wù)[N];中國高新技術(shù)產(chǎn)業(yè)導(dǎo)報(bào);2000年

8 張彤;網(wǎng)絡(luò)簡(jiǎn)化后的性能[N];網(wǎng)絡(luò)世界;2009年

9 北京中創(chuàng)信測(cè)科技股份有限公司 韓冰;中創(chuàng)信測(cè)：全面監(jiān)測(cè)構(gòu)建高性能的3G網(wǎng)絡(luò)[N];通信產(chǎn)業(yè)報(bào);2005年

10 楊虹;有一種網(wǎng)絡(luò)幫助油田實(shí)現(xiàn)多點(diǎn)集中管理[N];中國石化報(bào);2007年

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

1 李麗;機(jī)會(huì)網(wǎng)絡(luò)中數(shù)據(jù)傳輸策略研究[D];哈爾濱工業(yè)大學(xué);2017年

2 付志鵬;結(jié)構(gòu)化P2P網(wǎng)絡(luò)抖動(dòng)的應(yīng)對(duì)策略研究[D];國防科學(xué)技術(shù)大學(xué);2013年

3 趙丹;基于邏輯集中控制的網(wǎng)絡(luò)路由關(guān)鍵技術(shù)研究[D];國防科學(xué)技術(shù)大學(xué);2013年

4 趙陽明;數(shù)據(jù)中心網(wǎng)絡(luò)中路由與資源分配問題研究[D];電子科技大學(xué);2015年

5 孫海峰;VANETs路由算法研究[D];電子科技大學(xué);2015年

6 于灝;復(fù)雜網(wǎng)絡(luò)傳輸及資源限制下負(fù)載能力提升問題研究[D];東北大學(xué);2013年

7 王小娟;基于復(fù)雜網(wǎng)絡(luò)理論的虛擬路由通信安全問題研究[D];北京郵電大學(xué);2015年

8 陳良鋒;無線傳感器網(wǎng)絡(luò)節(jié)點(diǎn)定位及路由策略的研究與應(yīng)用[D];中國科學(xué)技術(shù)大學(xué);2015年

9 苗笛;智慧協(xié)同標(biāo)識(shí)網(wǎng)絡(luò)可靠路由關(guān)鍵技術(shù)研究[D];北京交通大學(xué);2016年

10 蘇申;Internet域間路由建模與分析研究[D];哈爾濱工業(yè)大學(xué);2016年

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

1 谷志群;WSNs中基于網(wǎng)絡(luò)資源利用效率的層次型路由算法研究[D];河北工程大學(xué);2015年

2 徐金卯;可重構(gòu)網(wǎng)絡(luò)中元能力組合及服務(wù)路由策略研究[D];鄭州大學(xué);2015年

3 王宇飛;3D NoC容錯(cuò)路由算法的研究[D];曲阜師范大學(xué);2015年

4 李長(zhǎng)鋒;基于能量?jī)?yōu)化的無線傳感器網(wǎng)絡(luò)非均勻分簇路由算法研究[D];華中師范大學(xué);2015年

5 王麗珍;無線傳感器網(wǎng)絡(luò)中地理位置路由算法研究[D];蘇州大學(xué);2015年

6 張群;基于WirelessHART的低功耗可靠路由算法和調(diào)度[D];山東大學(xué);2015年

7 張珊珊;面向緊急情況下DTN網(wǎng)絡(luò)的移動(dòng)模型和路由算法的研究[D];陜西師范大學(xué);2015年

8 鄒劍芬;贛東北地區(qū)電力數(shù)據(jù)網(wǎng)的研究與設(shè)計(jì)[D];華北電力大學(xué);2015年

9 覃廣榮;基于節(jié)點(diǎn)位置偏好地點(diǎn)DTN路由算法研究[D];廣西大學(xué);2015年

10 劉斌;基于ZigBee協(xié)議的無線傳感器網(wǎng)絡(luò)實(shí)時(shí)路由研究[D];中國礦業(yè)大學(xué);2015年

，

本文編號(hào)：1409487