隨義式無線網路是指由一群可隨意移動之行動站台所組成，且不需要經由中控台戶或是預先設置好的基礎架構即可運作的行動特殊網。在這樣的一個行動特殊網路中，傳輸資料的路徑往往是由多節點共同組成，而繞境演算法則必須面對站台能隨意移動的能力以及無線傳輸上頻寬的限制。目前已有多種針對隨意式無線網路所提出來的繞徑演算法。而近年來這方面的研究有朝互動、隨選式繞境演算法發展的趨勢。本文分別提出目前所常見的兩種協定DSDV以及AODV進行介紹以及模擬分析，最後我們用Simulation來評估效能上的改善。
Ad-hoc Networks is free to move by a group formed by the action site. Households, or through the console and does not require a pre-set a good infrastructure networks can be the operation of the special operations. In such an action to a special network, Transmit data path from the Multi-hop is often composed of. And the algorithm around the site throughout must be able to freely move the face of capacity and bandwidth constraints on the wireless transmission. At present, a variety of wireless network infrastructure for the non-referred out around the track algorithm. In recent years research in this area tends to reactive, on-demand algorithm around the trend of development. This paper proposed two kinds of agreements being currently common DSDV (Destination-sequenced Distance-vector Routing Protocol) and AODV (Ad-hoc On-demand Distance Vector) introduced and simulation.
