天堂国产午夜亚洲专区-少妇人妻综合久久蜜臀-国产成人户外露出视频在线-国产91传媒一区二区三区

當前位置:主頁 > 科技論文 > 信息工程論文 >

基于粒子群算法的Ad Hoc網絡路由優(yōu)化方法研究

發(fā)布時間:2018-04-16 09:08

  本文選題:Ad + Hoc; 參考:《中北大學》2017年碩士論文


【摘要】:Ad Hoc網絡是由多個可移動節(jié)點組成的無線網絡,它以無中心、自組織、不需要基礎設施支持、采用分布式管理系統(tǒng)、網絡拓撲結構靈活變化等特點應用在特殊領域,例如:災區(qū)救援、戰(zhàn)場、傳感器網絡等。由于這些特殊領域對網絡的傳輸速度、傳輸延時、傳輸過程中的消耗有更高的要求,原有的Ad Hoc網絡協(xié)議不能提供這些服務,因此在網絡拓撲結構一直變化的Ad Hoc網絡中,提供有服務質量保障的路徑是一個很重要的任務。本文的主要工作如下:(1)介紹標準PSO算法的思想、算法中參數的意義、算法的工作流程,在此基礎之上,引入慣性權重(RandWPSO)、線性遞減(LDWPSO)、收縮因子(CFPSO)、混沌(ACPSO)四種改進粒子群算法,采用MATLAB進行仿真實驗,把四種算法應用到網絡中,實驗結果表明:ACPSO可以更快找到最優(yōu)路徑并且快速傳輸數據。(2)AODV路由協(xié)議有兩個缺點:沒有考慮實際網絡中帶寬、時延和代價;路由表只存在唯一一條從源節(jié)點到目的節(jié)點的路徑。根據這兩個缺點,結合混沌粒子群算法對AODV協(xié)議的RREQ、RREP數據包進行改進,同時也改進路由發(fā)現,路由維護和修復機制。(3)基于NS2仿真平臺,對改進的AODV協(xié)議建立仿真模型并且進行實驗,設置不同的網絡環(huán)境,測試分組投遞率、網絡延時、路由發(fā)現頻率。實驗的結果表明:傳輸數據過程中,改進的協(xié)議比AODV協(xié)議找到的路由性能更高,可以更快、更穩(wěn)定傳輸數據。
[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.
【學位授予單位】:中北大學
【學位級別】:碩士
【學位授予年份】:2017
【分類號】:TP18;TN929.5

【參考文獻】

相關期刊論文 前10條

1 許君;魯海燕;石桂娟;;限制速度粒子群優(yōu)化和自適應速度粒子群優(yōu)化在無約束優(yōu)化問題中的應用[J];計算機應用;2015年03期

2 許婧,

本文編號:1758213


資料下載
論文發(fā)表

本文鏈接:http://sikaile.net/kejilunwen/xinxigongchenglunwen/1758213.html


Copyright(c)文論論文網All Rights Reserved | 網站地圖 |

版權申明:資料由用戶d4e6a***提供,本站僅收錄摘要或目錄,作者需要刪除請E-mail郵箱bigeng88@qq.com