行動隨意網路下基於節點移動和地理方位之路由方法;A Routing Scheme Based on Node Mobility and Geographic Location in Mobile Ad Hoc Networks

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Communication Engineering > Electronic Thesis & Dissertation > Item 987654321/86456

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/86456

Title:	行動隨意網路下基於節點移動和地理方位之路由方法;A Routing Scheme Based on Node Mobility and Geographic Location in Mobile Ad Hoc Networks
Authors:	朱衡冰;ZHU, HENG-BING
Contributors:	通訊工程學系
Keywords:	行動隨意網路;地理路由;機會路由;節點移動趨勢
Date:	2021-10-12
Issue Date:	2021-12-07 12:51:29 (UTC+8)
Publisher:	國立中央大學
Abstract:	移動自組織網路(mobile ad-hoc network,MANET)是一個由幾十到上百個節點組成的、採用無線通信方式的、動態組網的網路，可以通過動態路由技術進行訊息的傳輸，但是也存在網路帶寬受限、對即時性業務支持較差和安全性不高等弊端。本文旨在提高節點對歷史資訊、地理位置和鄰域拓撲資訊的利用，從而減小訊息抵達目的地所花費的成本，提高訊息的成功抵達率。本文提出了一種在應用於MANET，基於節點的移動趨勢和地理位置選擇兩跳(Two-hop)的路徑進行訊息傳遞的方案，命名為Routing Scheme Based on Node Mobiility and Geographic Location(RSMG)。該方案首先以當前節點和目的地之間的連線作為基準線，限定掃描範圍，獲取範圍內符合要求的第一跳節點，之後以第一跳節點為基準，根據第一跳節點和目的地之間的連線，限定掃描範圍，得到第二跳節點，接著對所有路徑的偏移角度進行初步篩選，得到若干備選路徑，根據備選路徑中第二跳節點的移動趨勢，獲取速度向量與目的地之間的偏移角度，然後為所有備選的路徑計算分配權重值，最後根據權重值大小，對路徑進行最後一次篩選，進行數據傳輸。我們在ONE模擬器上進行參數仿真，以訊息抵達率和成本作為性能指標，結果顯示，我們的方案比Epidemic訊息抵達率低10%，但是成本減少了90%；對比其他兩種方案，我們的方案在訊息抵達率上高10\%至20%的情況下，還擁有著較小的成本。;Mobile ad-hoc network (MANET) is a decentralized wireless network composed of dozens to hundreds of nodes. Without those pro-existing networking infrastructures, MANET transmits messages through dynamic routing methods, which succeeds in data delivery between source and destination nodes. However, there are some disadvantages such as limited network bandwidth, poor support for real-time services, and low security. This study aims to reduce the cost of message transmission and increase the delivery rate.Thus, we proposes a message transmission scheme based on the nodes′ movement trend and geographic location to select a two-hop route for MANET, named Routing Scheme Based on Node Mobiility and Geographic Location (RSMG). Firstly, we use the connection between the current node and the destination as the baseline, limit the scanning range, and obtain the one-hop nodes within the range. Secondly, we take this information as the basis and scan the next-hop nodes to filter all paths, then obtain candidate paths. Thirdly, we calculate the offset angle according to the velocity vector, then calculate and assign a weight value for all paths. Finally, we filter all paths according to the weight value for data transmission.We take the delivery rate and cost as performance indicators. The results showed that our solution was 10% lower than the Epidemic delivery rate, but the cost was reduced by 90%; compared with the other two schemes, Our solution has a lower cost when the delivery rate is 10% to 20% higher.
Appears in Collections:	[Graduate Institute of Communication Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	188	View/Open

社群 sharing

Loading...