本文選題：無線多跳網(wǎng)絡(luò) + 路由協(xié)議AODV��； 參考：《中南大學(xué)》2014年碩士論文

【摘要】：摘要：隨著無線設(shè)備的普及與廣泛應(yīng)用,學(xué)術(shù)界關(guān)于無線多跳網(wǎng)絡(luò)的研究方興正艾,一般來說,無線多跳網(wǎng)包括無線自適應(yīng)網(wǎng)、無線mesh網(wǎng)、無線傳感器網(wǎng)絡(luò),無線多跳網(wǎng)絡(luò)避免了集中式網(wǎng)絡(luò)的不足,網(wǎng)絡(luò)中的節(jié)點(diǎn)可以是數(shù)據(jù)傳輸終端,也可以是路由節(jié)點(diǎn),無線鏈路動(dòng)態(tài)、時(shí)變和丟失特性使無線多跳網(wǎng)具有較好的魯棒性,容易組裝,網(wǎng)絡(luò)吞吐量大等優(yōu)點(diǎn)。目前,各專家學(xué)者針對(duì)無線多跳網(wǎng)絡(luò)的研究涉及OSI結(jié)構(gòu)的各個(gè)領(lǐng)域,本文主要研究了無線多跳網(wǎng)絡(luò)的調(diào)度機(jī)制以及對(duì)經(jīng)典路由協(xié)議進(jìn)行了改進(jìn)。 無線多跳網(wǎng)絡(luò)的機(jī)會(huì)調(diào)度機(jī)制研究。分析了集中式與分布式調(diào)度機(jī)制的不同,以及分布式機(jī)會(huì)調(diào)度機(jī)制的難題,研究了OSAR算法的優(yōu)點(diǎn)與不足,在此基礎(chǔ)上提出了一種結(jié)合計(jì)算機(jī)中頁面訪問技術(shù)LRU算法,將其針對(duì)無線多跳網(wǎng)絡(luò)進(jìn)行適當(dāng)改進(jìn),仿真分析并比較兩種算法的優(yōu)缺點(diǎn),結(jié)果表明,改進(jìn)的LRU算法能保證網(wǎng)絡(luò)資源分配的公平性,擁有較好網(wǎng)絡(luò)吞吐量以及較小端到端的時(shí)延,提高了網(wǎng)絡(luò)服務(wù)質(zhì)量。 無線多跳網(wǎng)絡(luò)路由協(xié)議的研究。主要分析了多種經(jīng)典的路由協(xié)議,包括AODV(Ad hoc On-demand Distance Vector)、OLSR (Optimized Link State Routing)^DSR (Dynamic Source Routing)和TBRPF (Topology Dissemination Based on Reserve-path Forwarding),比較各種路由協(xié)議的優(yōu)缺點(diǎn),提出目前針對(duì)路由協(xié)議還存在的待解決難題。本文基于AODV就無線多跳網(wǎng)絡(luò)本地修復(fù)問題的解決辦法進(jìn)行了優(yōu)化,結(jié)合按需修復(fù)路由與提前修復(fù)路由的方法,本文提出一種新的CODA(Combined On-demand with Advance)方法,分析比較三種方法的性能,仿真結(jié)果表明,CODA基本上接近提前修復(fù)路由的端到端時(shí)延的良好性能,擁有較好的網(wǎng)絡(luò)吞吐率,同時(shí)也解決了提前修復(fù)可能修復(fù)不再投入使用路由的問題,它具備按需修復(fù)的優(yōu)點(diǎn),保證了網(wǎng)絡(luò)連接中斷的可修復(fù)性。
[Abstract]:Absrtact: with the popularity and wide application of wireless devices, the academic research on wireless multi-hop networks is booming. Generally speaking, wireless multi-hop networks include wireless adaptive networks, wireless mesh networks, wireless sensor networks.Wireless multi-hop networks avoid the shortcomings of centralized networks. The nodes in the network can be either data transmission terminals or routing nodes. The characteristics of wireless link dynamics, time-varying and loss make wireless multi-hop networks more robust and easy to assemble.Network throughput and other advantages.At present, the research of wireless multi-hop networks involves various fields of OSI architecture. This paper mainly studies the scheduling mechanism of wireless multi-hop networks and the improvement of classical routing protocols.Research on the opportunistic scheduling mechanism of wireless multi-hop networks.This paper analyzes the difference between centralized scheduling mechanism and distributed scheduling mechanism, as well as the difficult problem of distributed opportunity scheduling mechanism, studies the advantages and disadvantages of OSAR algorithm, and puts forward a LRU algorithm combined with page access technology in computer.The simulation results show that the improved LRU algorithm can ensure the fairness of resource allocation in wireless multi-hop networks.With better network throughput and small end-to-end delay, the quality of service is improved.Research on routing protocols in wireless multi-hop networks.This paper mainly analyzes several classical routing protocols, including AODV(Ad hoc On-demand Distance routing Link State routing ^ DSR dynamic Source routing) and TBRPF Topology Dissemination Based on Reserve-path forwarding, compares the advantages and disadvantages of various routing protocols, and puts forward the problems to be solved for routing protocols.This paper optimizes the solution to the local repair problem of wireless multi-hop network based on AODV. Combining the methods of repairing routing on demand and repairing route ahead of time, this paper proposes a new CODA(Combined On-demand with advance method, and analyzes and compares the performance of the three methods.The simulation results show that CODA is close to the good performance of end-to-end delay in repairing routing in advance, and has good network throughput. At the same time, it also solves the problem of repairing the route that may not be put into use in advance.It has the advantage of repairing on demand and ensures the repairability of network connection interruption.
【學(xué)位授予單位】：中南大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.04

【參考文獻(xiàn)】

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

1 夏海輪;丁煒;;Ad hoc網(wǎng)絡(luò)中基于擁塞的機(jī)會(huì)調(diào)度算法[J];電子科技大學(xué)學(xué)報(bào);2008年05期

2 蘭麗;單志龍;;Ad Hoc網(wǎng)絡(luò)中隱藏終端和暴露終端相關(guān)問題研究[J];計(jì)算機(jī)與數(shù)字工程;2010年07期

3 張?zhí)?張曉敏,李莉;IEEE 802.11 MAC層協(xié)議解析[J];山東大學(xué)學(xué)報(bào)(工學(xué)版);2002年06期

4 張簡(jiǎn)麗;許洪光;;基于DSR的路由協(xié)議綜述[J];通信技術(shù);2009年01期

，

本文編號(hào)：1767848