在無線網狀網路(Wireless Mesh Network)中，每個節點須幫助相鄰節點轉送資料及提供使用者網路存取，例如WLAN(IEEE 802.11s)、WMAN(IEEE 802.16)等，皆可利用多跳接方式將資料轉送至通訊閘道器(Gateway)。在無線網狀網路中，常利用密集佈建的方式來解決通訊死角的問題。當網路節點的密度增加時，無線訊號的干擾也會增強，並且各節點的效能會顯著下降。
在本研究中，將利用幾何學概念，解決網路干擾問題，並提出拓樸重建演算法來重建路徑，使網路干擾達到最小化。我們試著最小化節點與節點間的干擾，以提升整體無線網狀網路效能。我們將網路問題轉換成幾何問題，並定義在幾何圖形中線段交錯問題，之後驗證在幾何圖形中是否有線段交錯的現象發生。若發生線段交錯時，則將此線段從幾何圖形中移除，並且利用三角化演算法將此區域線段重新規劃，使相鄰節點間的干擾最小。當網路拓樸建立完成後，我們利用標準差公式將干擾較大的連線移除，使得網路效能提升。上述測試線段交錯及三角化多邊形演算法可在時間複雜度O(n log n)內找到干擾最小的解。最後，我們將利用網路模擬器(Network Simulator)驗證所提出的方法是否能達到預期的系統效能指標。 / In wireless mesh networks, such as WLAN (IEEE 802.11s), WMAN (IEEE 802.16), etc., each node should forward packets of neighboring nodes toward gateway using multi-hop routing mechanism. In wireless mesh network, as the density of network nodes increases, the RF interference will increase and the throughput of each node will drop rapidly.
In our research, we use the geometry to resolve the RF interference problem by rebuilding network topology. We try to minimize the interference between neighboring nodes and improve the throughput in wireless mesh network. We transform the network topology problem into geometry problem and define the line intersection problem in geometric graph, then check path intersection in the geometric graph. If line intersection occurs in the graph, we remove the intersection line from the graph and re-plan the region by triangulation algorithm. When the network topology is built up, we use a standard deviation formula to improve network performance by removing longer links. The line intersection algorithm and triangulation algorithm, both of time complexity O(n log n), are used to find the minimal interference solution. At the end of our research, we use network simulator to verify if the proposed methods can help to meet all those performance expectations.
| Identifer | oai:union.ndltd.org:CHENGCHI/G0094753023 |
| Creators | 方任瑋, Fang, Ren Wei |
| Publisher | 國立政治大學 |
| Source Sets | National Chengchi University Libraries |
| Language | 中文 |
| Detected Language | English |
| Type | text |
| Rights | Copyright © nccu library on behalf of the copyright holders |
Page generated in 0.0026 seconds