透過您的圖書館登入
IP:3.15.218.254
  • 會議論文
  • OpenAccess

設計應用於物聯網具適切性之Wi-Fi樹狀網路演算法

摘要


因應近年IoT概念的興起,無線網路相關技術組織紛紛提出針對物聯網的通訊技術協定,其中Wi-Fi通訊相關架構協定愈臻成熟,市面上也有許多相關模組發展成熟且價格相對低廉,現有的主要的Wi-Fi路由演算法例如被動式路由AODV其在架構上容易產生大量封包,導致在有密集節點時容易引起廣播風暴,且其建網程序較為繁複導致建網速度較慢,而主動式路由OLSR則因其在維護路由上耗費太多資源,且建網程序亦較繁複,這兩種路由則皆有其不管是在連線建網或維護上的不足。因此本演算法提出設計應用於物聯網具適切性之Wi-Fi樹狀網路演算法,提出由路由伺服器負責硬體及運算等路由維護資源,解決了節點對於維護路由的運算負擔,由根節點作為橋樑連接路由伺服器與無線網路,網路節點負責維護父節點及子節點路由,減輕網路設備負擔,同時樹狀拓樸提供了更有彈性的建網及更少的建網階層,解決對於串鏈式網路中節點分佈造成網路不穩定或無法建網的影響,建網機制中具適切性階層以建立更小的階層長度,解決隨意建網的可能並建構更有效率的網路,廣播註冊機制採用隨機權重演算法,降低了密集節點發生廣播風暴的可能,並限制節點有限子節點數,降低網路節點負擔,最後在NS-3平台上模擬分析網路的可行性,並提出相關目標函數與建議設置參數值。

並列摘要


In response to the rise of the IoT concept in recent years, wireless network-related technology organizations have proposed communication technology agreements for the Internet of Things. The Wi-Fi protocols have become more mature, and many related modules on the market have developed and are relatively inexpensive. The existing main Wi-Fi routing algorithms, such as AODV, are easy to generate a large number of packets in the system while finding route, which causes broadcast storms when there are dense nodes, and the network construction process is complicated, resulting in slow network construction. Furthermore, OLSR consumes too many resources on the maintenance route, and the network construction procedure is also complicated. Both of these routes have their shortcomings in connection networking or maintenance. Therefore, this thesis proposes a Design Adaptive Tree Topology Algorithm For Wi-Fi Wireless Network, include the Routing Server is responsible for routing maintenance resources such as hardware and computing, solved the computing burden of nodes for maintaining routes. The Root acts as a bridge to connect the Routing Server to the wireless network. Other nodes are responsible for maintaining the parent node and child node routing, reducing the burden on the network device. At the same time, the tree topology provides a more flexible network and fewer hops, solving the node distribution causes the impact of network instability or network failure in a Linked-List network. Build a network with an adaptive hierarchy to create smaller hopping, dealing with the possibility of unconditional network construction and have a more efficient network. Broadcasting registration mechanism using striped random priority algorithm, reducing the possibility of broadcast storms on dense nodes. And limit the number of nodes with the limited number of nodes, reduce the burden on the network node. Finally, simulate the feasibility of the network on the NS-3 platform, and this thesis proposes object function and suggested parameter.

延伸閱讀