【摘要】：作為移動(dòng)自組織網(wǎng)絡(luò)的一種重要演進(jìn)方向,機(jī)會(huì)網(wǎng)絡(luò)由于其在不連通的網(wǎng)絡(luò)中也能實(shí)現(xiàn)消息投遞的特點(diǎn),成為未來網(wǎng)絡(luò)組網(wǎng)的一種可選方式,受到國內(nèi)外網(wǎng)絡(luò)研究人員的廣泛關(guān)注。路由算法是機(jī)會(huì)網(wǎng)絡(luò)中最主要的研究熱點(diǎn)之一。但是,當(dāng)前機(jī)會(huì)網(wǎng)絡(luò)大都采用便攜的移動(dòng)設(shè)備來進(jìn)行路由算法的研究,而移動(dòng)設(shè)備大多是能量受限的設(shè)備,處于復(fù)雜且惡劣環(huán)境之下的設(shè)備往往難以及時(shí)充電或更換電源,這就使得人們開始逐漸關(guān)注機(jī)會(huì)網(wǎng)絡(luò)的節(jié)能算法。休眠調(diào)度算法是一種使網(wǎng)絡(luò)中節(jié)點(diǎn)進(jìn)入低功耗休眠狀態(tài)保存能量并延長網(wǎng)絡(luò)壽命的節(jié)能算法。將休眠調(diào)度算法與機(jī)會(huì)網(wǎng)絡(luò)路由算法相結(jié)合將會(huì)大量節(jié)省機(jī)會(huì)網(wǎng)絡(luò)的能量。針對(duì)這種思想,本文通過合理的設(shè)計(jì)策略,將節(jié)點(diǎn)休眠調(diào)度算法與機(jī)會(huì)網(wǎng)絡(luò)復(fù)制路由算法結(jié)合在一起,在不影響網(wǎng)絡(luò)性能的前提下,盡可能的降低節(jié)點(diǎn)能耗,延長節(jié)點(diǎn)壽命。首先,本文對(duì)機(jī)會(huì)網(wǎng)絡(luò)的概念、特點(diǎn)及其應(yīng)用進(jìn)行了介紹,對(duì)當(dāng)前存在的機(jī)會(huì)網(wǎng)絡(luò)休眠調(diào)度算法進(jìn)行了分類,并選取了若干典型復(fù)制路由算法和休眠調(diào)度算法進(jìn)行了詳細(xì)闡述。其次,針對(duì)現(xiàn)有采用固定時(shí)長的機(jī)會(huì)網(wǎng)絡(luò)休眠調(diào)度算法中節(jié)點(diǎn)進(jìn)入休眠狀態(tài)或相遇時(shí)間較短導(dǎo)致消息傳輸中斷降低消息投遞成功率的問題,提出了一種基于自適應(yīng)時(shí)間調(diào)整的可靠休眠調(diào)度算法——RSATA(a Reliable sleep Scheduling algorithm base on Adaptive Time Adjustment for opportunistic networks)。算法結(jié)合RSSI測(cè)距和消息通告機(jī)制,通過分析節(jié)點(diǎn)接觸過程濾除節(jié)點(diǎn)不能夠發(fā)送數(shù)據(jù)的相遇機(jī)會(huì),然后對(duì)喚醒時(shí)間和休眠時(shí)間進(jìn)行動(dòng)態(tài)調(diào)整,避免消息收發(fā)被休眠中斷。然后,針對(duì)采用接觸預(yù)測(cè)機(jī)制的休眠調(diào)度算法中存在的相遇預(yù)測(cè)不準(zhǔn)確和重疊時(shí)間移動(dòng)后接觸概率較低的問題,提出了一種基于接觸概率的機(jī)會(huì)網(wǎng)絡(luò)能量高效休眠調(diào)度算法——EESCP(an Energy Efficient sleep Scheduling algorithm base on Contact Probability for opportunistic networks)。算法通過精準(zhǔn)預(yù)測(cè)機(jī)制向前后預(yù)測(cè)錯(cuò)失相遇的下次喚醒時(shí)間,保證了預(yù)測(cè)下次相遇的準(zhǔn)確度,而且對(duì)重疊后的時(shí)間采用相遇概率最大化機(jī)制來提高相遇機(jī)會(huì),減小消息投遞時(shí)延。最后,對(duì)全文的研究內(nèi)容進(jìn)行了總結(jié),并且提出了機(jī)會(huì)網(wǎng)絡(luò)節(jié)點(diǎn)休眠調(diào)度算法的未來研究方向。
[Abstract]:As an important evolution direction of mobile ad hoc networks, opportunistic networks can also realize message delivery in disconnected networks, so it becomes an optional way to organize networks in the future. Network researchers at home and abroad are widely concerned. Routing algorithm is one of the most important research topics in opportunistic networks. However, most of the current opportunity networks use portable mobile devices to study routing algorithms, and most of the mobile devices are energy-constrained devices, which are often difficult to charge or replace power in a complex and harsh environment. This makes people begin to pay attention to the energy saving algorithm of opportunity network gradually. Sleep scheduling algorithm is an energy saving algorithm that enables nodes in the network to enter low power sleep state to save energy and prolong network life. The combination of sleep scheduling algorithm and opportunistic network routing algorithm will greatly save the energy of opportunistic network. Aiming at this idea, this paper combines the node sleep scheduling algorithm with the opportunistic network replication routing algorithm through a reasonable design strategy, and reduces the node energy consumption and prolongs the node life as far as possible without affecting the network performance. Firstly, this paper introduces the concept, characteristics and applications of opportunistic networks, classifies the existing scheduling algorithms of opportunistic networks, and introduces some typical replication routing algorithms and sleep scheduling algorithms in detail. Secondly, aiming at the problem that the nodes enter dormant state or encounter short time, which leads to the interruption of message transmission and reduces the success rate of message delivery, the existing opportunistic network sleep scheduling algorithms with fixed time are adopted. This paper presents a reliable sleep scheduling algorithm based on adaptive time adjustment RSATA (a reliable sleep scheduling algorithm base on Adaptive time Adjustment for opportunistic networks). Combined with RSSI ranging and message notification mechanism, the algorithm filters out the chance that the node can not send data by analyzing the node contact process, and then dynamically adjusts the wake-up time and the sleep time to avoid the interruption of message sending and receiving. Then, aiming at the problem of inaccurate encounter prediction and low contact probability after overlapping time moves in dormant scheduling algorithm with contact prediction mechanism, This paper presents an energy efficient sleep scheduling algorithm for opportunistic networks based on contact probability-EESCP (an Energy efficient sleep scheduling algorithm base on contact probability for opportunistic networks). The algorithm guarantees the accuracy of predicting the next encounter by accurate prediction mechanism to predict the next missed encounter time, and uses the maximum encounter probability mechanism to improve the chance of encounter. Reduce message delivery delay. Finally, the research content of this paper is summarized, and the future research direction of opportunistic network node sleep scheduling algorithm is proposed.
【學(xué)位授予單位】：重慶郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類號(hào)】：TN929.5

【參考文獻(xiàn)】

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

1 李季碧;李賓;任智;陳前斌;;自適應(yīng)動(dòng)態(tài)功率控制的機(jī)會(huì)網(wǎng)絡(luò)節(jié)能高效路由算法[J];西安交通大學(xué)學(xué)報(bào);2014年12期

2 吳大鵬;樊思龍;張普寧;呂翊;王汝言;;機(jī)會(huì)網(wǎng)絡(luò)中能量有效的副本分布狀態(tài)感知路由機(jī)制[J];通信學(xué)報(bào);2013年07期

3 卓碧華;郭振乾;徐正坤;張靖宇;陳良銀;;基于低占空比技術(shù)的機(jī)會(huì)網(wǎng)絡(luò)性能研究[J];計(jì)算機(jī)工程;2013年03期

4 陳良銀;劉振磊;鄒循;徐正坤;郭振乾;張靖宇;袁平;劉燕;;基于能量感知的移動(dòng)低占空比機(jī)會(huì)網(wǎng)絡(luò)糾刪編碼算法[J];軟件學(xué)報(bào);2013年02期

5 付凱;夏靖波;尹波;;DTN中一種基于接觸時(shí)間的休眠機(jī)制[J];計(jì)算機(jī)科學(xué);2013年02期

6 唐飛岳;葉暉;趙明;;機(jī)會(huì)網(wǎng)絡(luò)節(jié)點(diǎn)喚醒調(diào)度機(jī)制研究[J];計(jì)算機(jī)工程與應(yīng)用;2011年26期

7 袁俊玲;陳莉;;一種基于節(jié)點(diǎn)能量的機(jī)會(huì)網(wǎng)絡(luò)概率路由算法[J];微電子學(xué)與計(jì)算機(jī);2011年06期

8 任智;黃勇;陳前斌;;機(jī)會(huì)網(wǎng)絡(luò)路由協(xié)議[J];計(jì)算機(jī)應(yīng)用;2010年03期

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

，

本文編號(hào)：2122001