本文選題：機(jī)會(huì)網(wǎng)絡(luò)　切入點(diǎn)：路由算法　出處：《河南大學(xué)》2014年碩士論文

【摘要】：隨著移動(dòng)互聯(lián)網(wǎng)的快速發(fā)展，機(jī)會(huì)網(wǎng)絡(luò)的應(yīng)用也越來越多。機(jī)會(huì)網(wǎng)絡(luò)是一種不需要在源節(jié)點(diǎn)和目標(biāo)節(jié)點(diǎn)之間存在完整鏈路，通過節(jié)點(diǎn)的移動(dòng)產(chǎn)生相遇機(jī)會(huì)傳輸信息，從而實(shí)現(xiàn)通信的自組織網(wǎng)絡(luò)。機(jī)會(huì)網(wǎng)絡(luò)的拓?fù)浣Y(jié)構(gòu)快速變化，鏈路常常中斷，網(wǎng)絡(luò)經(jīng)常處于無法連通的狀態(tài)，所以節(jié)點(diǎn)采用“存儲(chǔ)-攜帶-轉(zhuǎn)發(fā)”的模式傳輸信息。機(jī)會(huì)網(wǎng)絡(luò)的這些特點(diǎn)使得傳統(tǒng)的路由協(xié)議和擁塞控制策略均無法適應(yīng)于機(jī)會(huì)網(wǎng)絡(luò)環(huán)境，這就給機(jī)會(huì)網(wǎng)絡(luò)的路由設(shè)計(jì)和擁塞策略設(shè)計(jì)帶來了極大的挑戰(zhàn)。因此，解決路由和擁塞問題是機(jī)會(huì)網(wǎng)絡(luò)研究中的關(guān)鍵技術(shù)點(diǎn)。論文在分析現(xiàn)有方法的基礎(chǔ)上，針對機(jī)會(huì)網(wǎng)絡(luò)中的數(shù)據(jù)投遞和擁塞問題開展研究，分別提出了基于分簇轉(zhuǎn)發(fā)策略的機(jī)會(huì)路由算法和基于擁塞控制策略的機(jī)會(huì)路由算法。論文主要取得了以下研究成果： (1)為提高機(jī)會(huì)路由中的數(shù)據(jù)投遞成功率，根據(jù)節(jié)點(diǎn)自身和節(jié)點(diǎn)間關(guān)系的特性，提出一種基于分簇轉(zhuǎn)發(fā)策略的路由算法。該算法利用節(jié)點(diǎn)間成功傳輸信息的次數(shù)為分簇指標(biāo)，對節(jié)點(diǎn)進(jìn)行分簇，，同時(shí)根據(jù)中繼節(jié)點(diǎn)和目標(biāo)簇的關(guān)系轉(zhuǎn)發(fā)消息，從而高效地將消息投遞到目的節(jié)點(diǎn)，提高了節(jié)點(diǎn)間傳輸信息的成功率。仿真結(jié)果驗(yàn)證了該算法能夠提高消息投遞成功率和降低信息傳輸時(shí)延。 (2)為解決現(xiàn)有機(jī)會(huì)路由轉(zhuǎn)發(fā)中節(jié)點(diǎn)優(yōu)先級設(shè)置而導(dǎo)致的擁塞問題，提出了一種基于擁塞控制的機(jī)會(huì)路由算法。該算法在網(wǎng)絡(luò)發(fā)生擁塞的時(shí)候，依據(jù)信息的轉(zhuǎn)發(fā)價(jià)值，把擁塞節(jié)點(diǎn)上面的信息轉(zhuǎn)移到和目的節(jié)點(diǎn)相遇概率大的鄰居節(jié)點(diǎn)中，從而緩解擁塞情況。仿真結(jié)果驗(yàn)證了該策略能夠在提高消息投遞成功率的基礎(chǔ)上，有效解決擁塞問題。 本文針對機(jī)會(huì)網(wǎng)絡(luò)中的數(shù)據(jù)投遞和擁塞問題開展研究，提出了對應(yīng)的解決辦法，為機(jī)會(huì)網(wǎng)絡(luò)數(shù)據(jù)投遞和擁塞控制技術(shù)的發(fā)展提供有價(jià)值的參考。
[Abstract]:With the rapid development of mobile Internet, the application of opportunistic network is more and more.Opportunity network is an ad hoc network which does not need to have a complete link between the source node and the target node.The topology of the opportunistic network changes rapidly, the link is often interrupted, and the network is often disconnected, so the node transmits information in the mode of "store-carry-forward".These characteristics of opportunistic networks make the traditional routing protocols and congestion control strategies unsuitable for the opportunistic network environment, which brings great challenges to the routing design and congestion policy design of opportunistic networks.Therefore, solving the problem of routing and congestion is the key point in the research of opportunistic networks.Based on the analysis of existing methods, this paper studies data delivery and congestion in opportunistic networks, and proposes an opportunity routing algorithm based on clustering and forwarding strategy and an opportunistic routing algorithm based on congestion control strategy, respectively.The main achievements of this thesis are as follows:In order to improve the success rate of data delivery in opportunistic routing a new routing algorithm based on clustering forwarding strategy is proposed according to the relationship between nodes and nodes.The algorithm uses the number of times of successful transmission of information between nodes as a clustering index to cluster the nodes, and forwards messages according to the relationship between the relay node and the target cluster, so that the messages are delivered to the destination node efficiently.The success rate of information transmission between nodes is improved.Simulation results show that the algorithm can improve the success rate of message delivery and reduce the delay of information transmission.In order to solve the congestion problem caused by node priority setting in existing opportunistic routing, an opportunistic routing algorithm based on congestion control is proposed.When the network congestion occurs, according to the value of forwarding information, the information above the congestion node is transferred to the neighbor node with a high probability of meeting the destination node, so as to alleviate the congestion situation.The simulation results show that the proposed strategy can effectively solve the congestion problem on the basis of improving the success rate of message delivery.In this paper, the problem of data delivery and congestion in opportunistic networks is studied, and corresponding solutions are proposed to provide valuable reference for the development of data delivery and congestion control technology in opportunistic networks.
【學(xué)位授予單位】：河南大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN929.5;TP393.01

【參考文獻(xiàn)】

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

1 吳大鵬;周建二;王汝言;張普寧;;機(jī)會(huì)網(wǎng)絡(luò)中消息冗余度動(dòng)態(tài)估計(jì)的緩存管理策略[J];電子與信息學(xué)報(bào);2012年01期

2 牛建偉;周興;劉燕;孫利民;馬建;;一種基于社區(qū)機(jī)會(huì)網(wǎng)絡(luò)的消息傳輸算法[J];計(jì)算機(jī)研究與發(fā)展;2009年12期

3 肖明軍;黃劉生;董群峰;劉安;楊振國;;Leapfrog:Optimal Opportunistic Routing in Probabilistically Contacted Delay Tolerant Networks[J];Journal of Computer Science & Technology;2009年05期

4 張振京;金志剛;舒炎泰;;基于節(jié)點(diǎn)運(yùn)動(dòng)預(yù)測的社會(huì)性DTN高效路由[J];計(jì)算機(jī)學(xué)報(bào);2013年03期

5 熊永平;孫利民;牛建偉;劉燕;;機(jī)會(huì)網(wǎng)絡(luò)[J];軟件學(xué)報(bào);2009年01期

6 蘇金樹;胡喬林;趙寶康;彭偉;;容延容斷網(wǎng)絡(luò)路由技術(shù)[J];軟件學(xué)報(bào);2010年01期

7 張龍;周賢偉;王建萍;鄧宇;吳啟武;;容遲與容斷網(wǎng)絡(luò)中的路由協(xié)議[J];軟件學(xué)報(bào);2010年10期

8 王博;黃傳河;楊文忠;;時(shí)延容忍網(wǎng)絡(luò)中基于效用轉(zhuǎn)發(fā)的自適應(yīng)機(jī)會(huì)路由算法[J];通信學(xué)報(bào);2010年10期

9 趙廣松;陳鳴;;自私性機(jī)會(huì)網(wǎng)絡(luò)中激勵(lì)感知的內(nèi)容分發(fā)的研究[J];通信學(xué)報(bào);2013年02期

本文編號(hào)：1702932