一個以Ant-Tabu為基礎的無基礎行動網路路由演算法

Abstract

無基礎行動網路(mobile ad hoc networks)可視為一種藉由行動通訊節點所自我組成(self-organized)的無線網路，其優點在於不需要任何基礎設備(infrastructure)的支援即可運作，其特點是動態網路拓樸(topology)與多點跳躍(multi-hop)的傳輸方式，由於無基礎行動網路的特點，使得傳統有線網路的路由方式無法適用於無基礎行動網路，因此有許多新的路由方式紛紛被提出來，然而這些路由方式只解決了動態網路拓樸環境下尋找路由路徑的問題，無法同時解決多點跳躍傳輸方式所產生的問題，有鑑於此，本研究將提出一新的路由演算法(Ant-Tabu-Based Routing Algorithm, ATBRA)以螞蟻演系統(ant system)與禁忌搜尋法(tabu search)為基礎，並證明其能同時解決動態網路拓樸與多點跳躍傳輸方式所產生的問題

Mobile ad hoc networks can be regard as the category of wireless networks self-organized by mobile nodes. Being capable of operating without the support of any infrastructure is its advantage; dynamic topology and multi-hop relaying are its features. Due to its features, conventional wired networks’ routing protocols can’t be applied into mobile ad hoc networks so there are more and more new routing protocols are proposed. However, those routing protocols are used to solve the problem of finding route in dynamic topology and can’t be used to solve the problem of multi-hop relaying as well. With a view to this situation, we will propose a new routing algorithm (Ant-Tabu-Based Routing Algorithm, ATBRA) which bases on ant system and tabu seatch. We will prove it can solve the problems resulted form dynamic topology and multi-hop relaying.