基于粒子群算法的Ad Hoc網(wǎng)絡(luò)路由優(yōu)化方法研究
發(fā)布時(shí)間:2018-04-16 09:08
本文選題:Ad + Hoc ; 參考:《中北大學(xué)》2017年碩士論文
【摘要】:Ad Hoc網(wǎng)絡(luò)是由多個(gè)可移動(dòng)節(jié)點(diǎn)組成的無(wú)線網(wǎng)絡(luò),它以無(wú)中心、自組織、不需要基礎(chǔ)設(shè)施支持、采用分布式管理系統(tǒng)、網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)靈活變化等特點(diǎn)應(yīng)用在特殊領(lǐng)域,例如:災(zāi)區(qū)救援、戰(zhàn)場(chǎng)、傳感器網(wǎng)絡(luò)等。由于這些特殊領(lǐng)域?qū)W(wǎng)絡(luò)的傳輸速度、傳輸延時(shí)、傳輸過(guò)程中的消耗有更高的要求,原有的Ad Hoc網(wǎng)絡(luò)協(xié)議不能提供這些服務(wù),因此在網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)一直變化的Ad Hoc網(wǎng)絡(luò)中,提供有服務(wù)質(zhì)量保障的路徑是一個(gè)很重要的任務(wù)。本文的主要工作如下:(1)介紹標(biāo)準(zhǔn)PSO算法的思想、算法中參數(shù)的意義、算法的工作流程,在此基礎(chǔ)之上,引入慣性權(quán)重(RandWPSO)、線性遞減(LDWPSO)、收縮因子(CFPSO)、混沌(ACPSO)四種改進(jìn)粒子群算法,采用MATLAB進(jìn)行仿真實(shí)驗(yàn),把四種算法應(yīng)用到網(wǎng)絡(luò)中,實(shí)驗(yàn)結(jié)果表明:ACPSO可以更快找到最優(yōu)路徑并且快速傳輸數(shù)據(jù)。(2)AODV路由協(xié)議有兩個(gè)缺點(diǎn):沒(méi)有考慮實(shí)際網(wǎng)絡(luò)中帶寬、時(shí)延和代價(jià);路由表只存在唯一一條從源節(jié)點(diǎn)到目的節(jié)點(diǎn)的路徑。根據(jù)這兩個(gè)缺點(diǎn),結(jié)合混沌粒子群算法對(duì)AODV協(xié)議的RREQ、RREP數(shù)據(jù)包進(jìn)行改進(jìn),同時(shí)也改進(jìn)路由發(fā)現(xiàn),路由維護(hù)和修復(fù)機(jī)制。(3)基于NS2仿真平臺(tái),對(duì)改進(jìn)的AODV協(xié)議建立仿真模型并且進(jìn)行實(shí)驗(yàn),設(shè)置不同的網(wǎng)絡(luò)環(huán)境,測(cè)試分組投遞率、網(wǎng)絡(luò)延時(shí)、路由發(fā)現(xiàn)頻率。實(shí)驗(yàn)的結(jié)果表明:傳輸數(shù)據(jù)過(guò)程中,改進(jìn)的協(xié)議比AODV協(xié)議找到的路由性能更高,可以更快、更穩(wěn)定傳輸數(shù)據(jù)。
[Abstract]:Ad Hoc network is a wireless network composed of multiple mobile nodes. It is applied in special fields with the characteristics of no center, self-organization, no infrastructure support, distributed management system, flexible network topology, etc.For example: disaster relief, battlefield, sensor network and so on.Because these special fields require higher transmission speed, delay and consumption in the transmission process, the original Ad Hoc network protocol can not provide these services, so in the Ad Hoc network, the topology of the network has been changing.Providing a path to quality of service assurance is an important task.The main work of this paper is as follows: (1) this paper introduces the idea of standard PSO algorithm, the meaning of parameters in the algorithm, and the workflow of the algorithm. On this basis, four improved particle swarm optimization (PSO) algorithms are introduced, such as inertial weight, linear decrement, contraction factor and chaos.The simulation experiment with MATLAB is carried out, and the four algorithms are applied to the network. The experimental results show that the MATLAB can find the optimal path faster and transmit data quickly. The routing protocol has two disadvantages: it does not consider the bandwidth, delay and cost in the actual network;There is only one path from the source node to the destination node in the routing table.According to these two shortcomings, this paper combines chaotic particle swarm optimization algorithm to improve the RREQN RREP packet of AODV protocol, and also improves the routing discovery, route maintenance and repair mechanism based on the NS2 simulation platform.The simulation model of the improved AODV protocol is established and the experiments are carried out to set up different network environments to test packet delivery rate, network delay and route discovery frequency.The experimental results show that the improved protocol has higher routing performance, faster and more stable data transmission than the AODV protocol in the process of data transmission.
【學(xué)位授予單位】:中北大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2017
【分類號(hào)】:TP18;TN929.5
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 許君;魯海燕;石桂娟;;限制速度粒子群優(yōu)化和自適應(yīng)速度粒子群優(yōu)化在無(wú)約束優(yōu)化問(wèn)題中的應(yīng)用[J];計(jì)算機(jī)應(yīng)用;2015年03期
2 許婧,
本文編號(hào):1758213
本文鏈接:http://sikaile.net/kejilunwen/xinxigongchenglunwen/1758213.html
最近更新
教材專著