本文選題：Ad + Hoc　； 參考：《南京理工大學(xué)》2014年博士論文

【摘要】：無線Ad Hoc網(wǎng)絡(luò)的組網(wǎng)靈活性及抗毀性等特點(diǎn),使其在軍用和民用領(lǐng)域內(nèi)得到了廣泛的應(yīng)用,但是其劇烈變化的拓?fù)浣Y(jié)構(gòu)、有限的帶寬資源以及共享信道上的競爭沖突給Ad Hoc網(wǎng)絡(luò)技術(shù)的發(fā)展帶來了挑戰(zhàn),也使得無線Ad Hoc網(wǎng)絡(luò)的相關(guān)技術(shù)成為研究的熱點(diǎn)。本文利用生滅過程和擬生滅過程對(duì)Ad Hoc網(wǎng)絡(luò)的分簇算法、節(jié)點(diǎn)故障維護(hù)策略以及MAC層接入?yún)f(xié)議技術(shù)進(jìn)行了建模和分析,具體體現(xiàn)在以下幾個(gè)方面：1)建立了多信道接入的分簇網(wǎng)絡(luò)中簇頭節(jié)點(diǎn)處理數(shù)據(jù)請(qǐng)求過程的生滅模型。利用概率分析的方法,引入阻塞概率和信道的平均利用率作為額外的簇頭選舉因子對(duì)分簇Ad Hoc網(wǎng)絡(luò)中的按需加權(quán)自適應(yīng)分簇算法(Adaptive On-demand Weighted, AOW)進(jìn)行了改進(jìn),并進(jìn)行了仿真實(shí)驗(yàn),實(shí)驗(yàn)結(jié)果表明,改進(jìn)算法后,減少了數(shù)據(jù)請(qǐng)求阻塞,提高了簇頭的平均服務(wù)時(shí)間,使網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)更加穩(wěn)定。2)建立了無線Ad Hoc網(wǎng)絡(luò)中按需路由協(xié)議路由發(fā)現(xiàn)過程中源節(jié)點(diǎn)生成子樹生滅過程模型(Sub-Tree-BD模型),利用矩陣分析方法進(jìn)行求解,推導(dǎo)出了生成子樹規(guī)模變化以及生存時(shí)間的概率表達(dá)式；基于該模型,建立了Ad Hoc網(wǎng)絡(luò)節(jié)點(diǎn)故障及生成子樹維護(hù)過程的擬生滅模型,利用概率分析方法,推導(dǎo)了在系統(tǒng)達(dá)到穩(wěn)定狀態(tài)下,節(jié)點(diǎn)故障率、維護(hù)過程空閑策略以及系統(tǒng)載荷之間的關(guān)系式,對(duì)空閑策略對(duì)網(wǎng)絡(luò)性能和網(wǎng)絡(luò)載荷的影響進(jìn)行了分析,并通過仿真實(shí)驗(yàn)進(jìn)行了驗(yàn)證,實(shí)驗(yàn)結(jié)果表明,該模型可優(yōu)化Ad Hoc網(wǎng)絡(luò)中的資源分配,為制定維護(hù)策略提供參考。3)在對(duì)單跳和多跳Ad Hoc網(wǎng)絡(luò)中MAC層上分布式協(xié)調(diào)功能(Distributed Coordination Function, DCF)協(xié)議的節(jié)點(diǎn)數(shù)據(jù)發(fā)送過程分析的基礎(chǔ)上,依次建立了單跳網(wǎng)絡(luò)無限隊(duì)長擬生滅模型、單跳網(wǎng)絡(luò)有限隊(duì)長擬生滅模型、多跳網(wǎng)絡(luò)無限隊(duì)長擬生滅模型和多跳網(wǎng)絡(luò)有限隊(duì)長擬生滅模型,利用矩陣分析和數(shù)學(xué)歸納方法對(duì)模型進(jìn)行分析求解,推導(dǎo)了節(jié)點(diǎn)緩沖隊(duì)列無限大時(shí)避免網(wǎng)絡(luò)達(dá)到飽和的控制條件,并建立了數(shù)據(jù)速率的閾值方程；推導(dǎo)了節(jié)點(diǎn)緩沖隊(duì)列為有限時(shí)過程的平穩(wěn)分布,建立了丟包率、平均延遲等網(wǎng)絡(luò)指標(biāo)的概率表達(dá)式。并通過仿真實(shí)驗(yàn)進(jìn)行了驗(yàn)證,實(shí)驗(yàn)結(jié)果表明,理論結(jié)果與實(shí)驗(yàn)數(shù)據(jù)吻合較好,表明該模型可以描述Ad Hoc網(wǎng)絡(luò)節(jié)點(diǎn)數(shù)據(jù)發(fā)送過程中的競爭退避過程,該模型為Ad Hoc中通過數(shù)據(jù)速率控制避免網(wǎng)絡(luò)擁塞提供了一個(gè)量化依據(jù),也為特定網(wǎng)絡(luò)規(guī)模下路由協(xié)議的選擇提供了一種參考。4)在多跳網(wǎng)絡(luò)有限隊(duì)長擬生滅模型和二進(jìn)制指數(shù)退避(Binary Exponential Backoff, BEB)算法的基礎(chǔ)之上,提出了一種基于擬生滅過程的動(dòng)態(tài)最大重試次數(shù)退避算法。引入動(dòng)態(tài)最大重試次數(shù)以及節(jié)點(diǎn)數(shù)據(jù)發(fā)送速率作為影響因子對(duì)BEB算法進(jìn)行改進(jìn),推導(dǎo)出了考慮延遲和丟包率約束的平衡方程,并進(jìn)行了仿真實(shí)驗(yàn),實(shí)驗(yàn)結(jié)果表明,改進(jìn)算法后,與標(biāo)準(zhǔn)退避算法相比,延遲和丟包率顯著改善,為網(wǎng)絡(luò)服務(wù)質(zhì)量控制提供了一種參考。
[Abstract]:The wireless Ad Hoc network has the characteristics of flexibility and destruction resistance, which makes it widely used in military and civil fields. However, the topology structure, limited bandwidth resources and the competition conflict on the shared channel have brought challenges to the development of Ad Hoc network technology and the related technologies of wireless Ad Hoc network. In this paper, the clustering algorithm of Ad Hoc network, node failure maintenance strategy and MAC layer access protocol technology are modeled and analyzed by using the birth and death process and the quasi birth and death process, which are embodied in the following aspects: 1) the birth and death process of cluster head nodes in the cluster network with multi channel access is established. Using the method of probability analysis, the congestion probability and the average utilization rate of the channel are introduced as an additional cluster head election factor to improve the Adaptive On-demand Weighted (AOW) algorithm (Adaptive On-demand Weighted, AOW), and the simulation results are carried out. The experimental results show that the improved algorithm reduces the data after the improved algorithm. Blocking, improving the average service time of the cluster head and making the network topology more stable.2), the source node generation and death process model (Sub-Tree-BD model) of the source node in the routing protocol routing of the wireless Ad Hoc network is established, and the matrix analysis method is used to solve it, and the variation of the generation tree size and the survival are derived. Based on the model, a quasi birth and death model of Ad Hoc network node failure and the maintenance process of subtree is established. By using the probability analysis method, the relationship between the node failure rate, the idle strategy of maintenance process and the system load is derived by using the probability analysis method. The influence of network load is analyzed and verified by simulation experiments. The experimental results show that the model can optimize the allocation of resources in Ad Hoc network and provide a reference.3 for the development of maintenance strategy. The distributed coordination function (Distributed Coordination Function, DCF) protocol on the MAC layer of single hop and multi hop Ad Hoc networks is the node. On the basis of data transmission process analysis, a single hop network infinite captain quasi birth and death model, a single jump network finite captain quasi birth and death model, a multi hop network infinite captain quasi birth and death model and a multi hop network finite captain quasi birth and death model are established in turn, and the model is analyzed and solved by using matrix analysis and mathematical induction, and the node delay is derived. When the impulse queue is infinite, the control condition of the network is avoided and the threshold equation of the data rate is established. The stationary distribution of the node buffer queue as the limited time process is deduced. The probability expression of the network index, such as the packet loss rate and the average delay, is established. The experimental results show that the theoretical results have been verified. The experimental results show that the theoretical results are obtained. It is in good agreement with the experimental data, which shows that the model can describe the competitive backoff process in the node data transmission of Ad Hoc network. This model provides a quantitative basis for avoiding network congestion through data rate control in Ad Hoc, and provides a reference.4 for the selection of routing protocols under specific network scale). On the basis of the quasi birth and extinction model and the Binary Exponential Backoff (BEB) algorithm, a dynamic maximum retrial time backoff algorithm based on the quasi birth and death process is proposed. The dynamic maximum retrial times and the node data transmission rate are introduced as the influence factors to improve the BEB algorithm. The equilibrium equation of delay and packet loss constraint is considered and the simulation experiment is carried out. The experimental results show that, after the improved algorithm, the delay and packet loss rate are significantly improved compared with the standard backoff algorithm, which provides a reference for the quality control of network service.
【學(xué)位授予單位】：南京理工大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN929.5

【參考文獻(xiàn)】

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

1 謝海波;崔毅東;徐惠民;;一種聯(lián)合路由層信息設(shè)計(jì)的多跳AdHocMAC層協(xié)議[J];電子學(xué)報(bào);2006年12期

2 陳超;鄭寶玉;趙賢敬;;一種利用跨層優(yōu)化策略選擇中繼的協(xié)作路由算法[J];電子與信息學(xué)報(bào);2007年12期

3 夏輝;賈智平;張志勇;Edwin H-M Sha;;移動(dòng)Ad Hoc網(wǎng)絡(luò)中基于鏈路穩(wěn)定性預(yù)測的組播路由協(xié)議[J];計(jì)算機(jī)學(xué)報(bào);2013年05期

4 史定華,劉斌;具有N-策略休假的M/G/1排隊(duì)的隨機(jī)分解與最優(yōu)策略[J];應(yīng)用概率統(tǒng)計(jì);1996年01期

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

1 張棋飛;無線自組織網(wǎng)絡(luò)媒體接入控制機(jī)制研究[D];華中科技大學(xué);2007年

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

1 付娜;廣義泊松過程及其疊加過程研究[D];重慶師范大學(xué);2012年

，

本文編號(hào)：1922686