1296473 15328twf.doc/y 九、發明說明： 【發明所屬之技術領域】 本發明是有關於一種網路之路由方法，且特別是有關 於一種根據節點狀態來改變路由之分散式路由方法。 【先前技術】 對行動卩过思網路而言，路由協定的設計是一個很重要 的考畺〔概括來說，現有行動隨意網路的路由協定可區分 為三大類：主動式(proactive)、被動式(reactive)和混成式 (hybrid)路由協定。迄今，很多行動隨意網路的路由協定已 經被提出，在主動式路由協定中，每個節點需要維護一個 路^表’週期性交換路由資訊使節點能得知所有的網路節 點貝讯。在被動式路由協定中，通常以一個氾濫式⑽出叩) 的=播方法被來源地用來尋找到目的地的最佳路徑，在每 次尋找目的地時需要佔用整個網路頻寬。在混成式中，尋 找路由的方法可分成兩個階段，小區域用主動式路由協定 而大區域職動式路由協定來尋找路徑，最佳化時，混成 式路由協定可同時達成絲式路由龄和被械路由協定 的偻Et。 在主動式路由協定中，每個節點需要維護—個路由 表，此方法的優點為可以較少的時間延遲去決定一個路_ =達成保證品質服務的需求，但此職性交換路由資^ 方法，同時會導致較多的無線資源浪費。 、 在被動式路由龄巾，通常m監式(fi⑻㈣ 的廣播方法被來源地用來尋找到目的地的最佳路徑，此；巳 濫式的廣播方法可能造成整伽㈣塞，歧長路徑尋找 1296473 15328twf.doc/y 時的時間延遲。 現有混成式路由方法為區域式混成方法，網路每個節 點需要監督並控制區域大小以使網路最佳化，造成額外的 頻寬浪費，同時，當網路壅塞時，控制的封包並不能適時 的送出去，也不適合在此時調整區域，造成此方法不易實 現化。 、 【發明内容】 本發明的目的就是在提供一種分散式路由方法，盆係 由節點_自己的狀態去決㈣主動式路由方法或被動式路 由協定’以避免額外的頻寬浪費。 本發明的再一目的是提供一種分散式路由方法，由節 ，，自，《去決定用主動式路由方法或被動式路由協 疋’藉以时少的路由資訊達到傳送最多資料的性能。 本么月提出種分散式路由方法，其係適用於一網 私ΓΓ包括多數㈣點。此分散式路由方法包括首先 =1路。其^這些節點開機。接㈣^ i為收斂ί〗接者判斷網路是否收斂，而當判斷得知網 後:ίΓ被動式路由協定。然後，在啟動被動 式路由H此網路將工作麵路維護狀態。 依照本發明的較佳實路 協定。 —μ、·_為魏_，則啟動主動式路由 ，為二 否t述之判斷網路是否 照本發明的較佳實施例所述，上述之網路維護狀態 1296473 15328twf.doc/y 判·財之任—是否改變其運動狀態，且當 未贿動狀態時’則啟動被動式 接者’於啟動被動式路由協定後則判斷節點中 ΐ壬一 期性地傳送#料°然後’ 得知節點中 之任一未週期性地傳送#料時，即啟動 =:月的較佳實施例所述，取分散=方 啟動節點中之任一改變該運動狀態時，則 依照本發明的較佳實施例所述，上述之分 法更包括當_得知節財之任—週期性 ) 即啟動主動式路由協定。 貝针守 本發明再提出-種分散式路由方法，其係_於已存 在之網路’且此網路包括多數個節點。此分散式路由方法 包括首紐動絲搞自龄，其:路是否收敛， 且田判b/f知知網路為收斂時，則啟動被動式路由協定。而 且丄在啟動被動式路由協定後，網路將卫作在—網路維護 狀態。 、ϋ 本發明因採用由節點偵測自己的狀態去決定用主動式路 由方法或被動式路由協定，因此狀態路由協定本身為一混成 式隨意網路路由協定(Hybrid此此呢PiOt〇cQ；〇，藉以同時 達成主動式路由協定和鶴式路由協定的優點之外 時去增加網路控制封包。 ▲為讓本發明之上述和其他目的、特徵和優點能更明顯 易懂，下文特舉較佳實施例，並配合所附圖式，作詳細說 1296473 15328twf.doc/\ 明如下。 【貫施方式】 行動圖卜其雜示依縣發明—紐實施例的-種 個節意圖。此行動隨意網路1G上包括有多數 W 。/、中’如熟悉此技藝者可以輕易知曉，節 .、、、占102〜116可以是電腦。 2發明之較佳實施例中’網路係為 未緣示）。而在本實施例中，僅以行動隨意 稱10作說明，在實際上自#不以此為限。 實;轉照圖1與圖2，圖2雜示依照本發明一較佳 牧Γ 1、、齡散搞自方法之步麟程®。在此分散式 h方法中，首先會初始化此行動隨意網路10 (S202)。豆 ^此行動隨意網路1{)中之節點⑽〜116開機（侧）。接 2行動隨意麟1()會啟動錢人主賦路 ::=r以當伽〇2〜1— 在本實施例中，在步驟s2〇6之後為接著根據節點1〇2 〜116中之任一是否有移動（亦即節點⑽〜ιΐ6週樣 ，之路由資料是否相同）來判斷行動隨意網路1〇之網路拓樸 疋否收敛（S208)。因此’當判斷得知行動隨意網路忉之 網路拓樸收斂時，則啟動被動式路由協定，且節點⑽ =現有的路由資料傳送資料⑽0)。若有找不到目的地節點 時，再以主動式路由方式尋找目的地節點。 反之，當判斷得知行動隨意網路1〇之網路拓樸還未收 1296473 15328twf.doc/y 斂時’則回到步驟S206，並再次啟動主動式 在步驟s210之後，由於行動隨意網路1〇之 疋。而 都是以現有的路由資料作傳輸依據，故 : 將進入一網路維護狀態（s2l2)。 思思.用路1〇 請接著參關3 ’當行動隨意睛ω 態時（s302)，則會判斷節點搬〜116中之任=維達狀 變其運動狀態（S3G4)，其中，運動狀態係為節 處於靜止狀態或在網路範圍内緩慢地移動。 1判斷得知節.點102〜116中之任—並未改變其運動 狀恶時，則啟動被動式路由協定，且節點1〇2〜ιΐ6 =見有的路由資料作傳輸依據（祕）。反之，當判斷= :點102〜116中之任-已改變其運動狀態時，則啟動主動 式路由協定’且節點1〇2〜116開始週期性地傳送路由資 (s31〇) 〇 、 在啟動被動式路由協定後，則接著判斷節點1〇2〜ιΐ6 是否有週期性傳送資料的情形（_)。若判斷得知節點 102〜H6週期性傳送資料的情形時，則回到步驟s3i〇，啟 動主動式路由協定；反之，當判斷得知節點1〇2〜116沒有 週期性傳送資料的情形時，則回到步驟s3〇6，啟動被動式 路由協定。 仏在本實施例中，主動式路由只週期性的傳送路由資訊 、、’其鄰近節點(One Hop Neighbors)，當鄰近節點察覺周圍 網路^態改變時，才以擴張樹(Spanning Tree)方式廣播給 所有節點，而被動式動協定也是可以隨時找到目的地節 1296473 15328twf.doc/y 點，¥節點突然移動時，再以擴張 目的地節點，以避免盔绫網敗万式廣播尋找變動的 *本實施例?暴問題。 -開機時每台電腦均可執行; 時，網路節點狀態即變成被動式路疋，畜進入網路 。之後網路可以傳送:對:路ΐί無: 均作一^ 因此，如表1所示，狀態路由協定 量’即可達繼__。射，N: 網路直徑，z:混成式之區域摊。 核即』數，d: --~-—-- ------- 主動式 路由協 定 表1 -----~ 被動式 路由協 定 -------- 混成式路由 協定 ---—^_ 狀悲路由 協定 靜態網路的 路由資訊量 -----—_ 〇(N*N) 〇(N*d) 〇(N*d) 〇(〇7^^ 動態網路的 路由資訊量 一 —-- 〇(N*N) —----— 〇(N*d) 0(N*d) 0(N)^^ 路由資訊儲 存量 0(N) ----------- 0⑼ 〇(N*z/d) 多播功能 Μ 無 -----S 有 丑在本發明之較佳實施例中，在初始狀態完成後，此分 散式路由方法在無網路變動時，其路由負載資訊量為零， 1296473 15328twf.doc/y :達到佳化的路由協定，同時亦可讓賴點、多播或廣播 1達T呆證品質服務需求，當網路變動時，亦僅以較少 t貝几里的傳給鄰近節點，不會造成網路壅塞的廣播風 暴，故能達成較好的網路系統效能。 在本發明之較佳實施例中，此分散式路由方法網路節 ”占收斂後，並不產生任何的路由封包，不浪費網路頻寬， 且可讓所傳送的封包滿足頻寬保證服務品質之需求。 本I明之幸父佳貫施例中，此分散式路由方法適用於 似靜止％境，亦適用於高速移動環境。 、 怨，在網路餘時，即m動式路由傳輸，亦不 路頻寬，不影響正常封包傳送，亦可達成網路協定 間瑕佳化之功能。 ^本發明之難實_巾，此分散式路由方法為一同 二由=:運練態、朗路婦量考量設計的的混成式 2本伽讀佳實_巾，此錄式路#法可 ^丁動隨s麟，而行賴意祕的軍事·， 野戰環境、艦艦通信、或陸海空連戰運用 竿 二戈』、救火”为防、南速公路車與車之通 一未來之前瞻性通信技術。 。寺，為 車用無線電，可運用於各種頻段的通信機，給三j、、、。百 另—方面，可結合802·；!〗無線網路卡， 使用。 ^、無線涵蓋範 11 1296473 15328twf.doc/y 圍及戶外移動用戶使用。 在本發明之較佳實施例中，分散式路由方法可適用於 點對點、點對多與廣播中之任一。 雖然本發明已以較佳實施例揭露如上，然其並非用以 限定本發明，任何熟習此技藝者，在不脫離本發明之精神 和範圍内，當可作些許之更動與潤飾，因此本發明之保護 圍當視後附之申請專利範圍所界定者為準。 【圖式簡單說明】 圖1繪示依照本發明一較佳實施例的一種行動隨意 架構不意圖。 方 、圖2繪示依照本發明一較佳實施例的一種分散式路由 法之步驟流程圖。BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a routing method for a network, and more particularly to a decentralized routing method for changing a route according to a node state. [Prior Art] The design of routing protocols is an important consideration for mobile networks. [In summary, routing protocols for existing mobile networks can be divided into three categories: proactive, Reactive and hybrid routing protocols. So far, many routing protocols for mobile networks have been proposed. In active routing protocols, each node needs to maintain a router's periodic exchange routing information so that the node can know all the network nodes. In a passive routing protocol, usually a flooded (10) method is used to find the best path to the destination, and the entire network bandwidth needs to be occupied each time the destination is searched. In the hybrid, the method of finding a route can be divided into two stages. The small area uses the active routing protocol and the large area occupational routing protocol to find the path. When optimizing, the hybrid routing agreement can reach the silk routing age at the same time.偻Et with the mechanical routing agreement. In a proactive routing protocol, each node needs to maintain a routing table. The advantage of this method is that it can determine a path with less time delay. _ = Achieving the requirement of quality service, but this service exchange routing method At the same time, it will lead to more waste of wireless resources. In the passive routing age, usually the m-supervised (fi(8)(iv) broadcast method is used to find the best path to the destination, this; the flooding method may cause the whole gamma (four) plug, the long path looks for 1296647 The time delay of 15328twf.doc/y. The existing hybrid routing method is a regional hybrid method. Each node of the network needs to supervise and control the size of the area to optimize the network, resulting in extra bandwidth waste. When the network is blocked, the controlled packet cannot be sent out in time, and it is not suitable to adjust the area at this time, which makes the method difficult to implement. SUMMARY OF THE INVENTION The object of the present invention is to provide a distributed routing method, a basin system. It is determined by the node_own state (4) active routing method or passive routing protocol' to avoid extra bandwidth waste. A further object of the present invention is to provide a distributed routing method, by section, self, "decision decision The active routing method or the passive routing protocol 'has less routing information to achieve the performance of transmitting the most data. This month proposes a kind of decentralized The routing method is applicable to a network private network including a majority (four) point. The distributed routing method includes first = 1 way. The ^ nodes are powered on. (4) ^ i is a convergence ί 接 接 接 接 接 接 接 接 接 接 接 接 接When it is judged that the network is behind: Γ Γ passive routing agreement. Then, when the passive route is started, the network will maintain the working state. According to the preferred road agreement of the present invention, -μ, ·_ is Wei_, then start Active routing, whether or not the network determines whether the network is in accordance with a preferred embodiment of the present invention, and the above-mentioned network maintenance status 1296647 15328 twf.doc/y is the responsibility of the company - whether to change its motion state, and When the state of the bribe is not bribed, 'the passive receiver is activated', after the passive routing agreement is started, it is judged that the node transmits the material in the first phase and then 'knows that any one of the nodes does not periodically transmit the material. In the preferred embodiment of the start =: month, when any one of the decentralized/party initiating nodes changes the motion state, according to a preferred embodiment of the present invention, the above method further includes Knowing the task of saving money - periodicity ) Start the active routing protocol. The present invention further proposes a decentralized routing method which is based on the existing network 'and which includes a plurality of nodes. The decentralized routing method includes the first-time moving wire, which is: whether the road converges, and when the field judgment b/f knows that the network is converging, the passive routing protocol is started. And after starting the passive routing protocol, the network will be in the state of network maintenance. ϋ The invention uses the active routing method or the passive routing protocol by the node to detect its own state, so the state routing protocol itself is a hybrid random network routing protocol (Hybrid is this PiOt〇cQ; In order to achieve the advantages of the active routing protocol and the crane routing protocol at the same time, the network control packet is added. ▲ In order to make the above and other objects, features and advantages of the present invention more obvious, the following is a preferred embodiment. For example, in conjunction with the drawings, the details of 1296473 15328twf.doc/\ are as follows. [Comprehensive mode] The action diagrams are mixed with the inventions of the county--the embodiment of the invention. The road 1G includes a majority of W. /, medium 'as can be easily known by those skilled in the art, the section, the, 102 to 116 can be a computer. 2 In the preferred embodiment of the invention, the network is not shown ). In the present embodiment, the description is made by simply saying that the action is 10, and in fact, it is not limited to #. Turning to Figure 1 and Figure 2, Figure 2 shows a preferred method in accordance with the present invention. In this distributed h method, the mobile random network 10 is first initialized (S202). Bean ^This action random network 1{) in the node (10) ~ 116 boot (side). The 2 action random Lin 1 () will start the money owner's way::=r to be the gamma 2~1 - in this embodiment, after step s2〇6 is followed by the nodes 1〇2~116 Whether there is any movement (that is, the node (10) ~ ΐ 6 weeks, the routing data is the same) to determine whether the network topology of the mobile network is convergence (S208). Therefore, when it is judged that the network topology of the mobile network is converged, the passive routing protocol is started, and the node (10) = the existing routing data transmission data (10) 0). If the destination node is not found, then the destination node is found by active routing. On the other hand, when it is judged that the network topology of the mobile network is not yet received, 1296647 15328twf.doc/y is converged, then the process returns to step S206, and the active mode is started again after step s210, due to the mobile network. 1〇之疋. All of them are based on the existing routing data, so: will enter a network maintenance state (s2l2). Sisi. Use the road 1 〇 please follow the 3' when the action is in the ω state (s302), then it will be judged that the node ～ 116 is changed to its state of motion (S3G4), where It is a node that is stationary or moves slowly over the network. 1 judged that the node. Point 102~116 - does not change its motion, then activate the passive routing protocol, and node 1〇2 ~ ιΐ6 = see the routing data for transmission basis (secret). On the other hand, when it is judged =: any of the points 102 to 116 has changed its motion state, the active routing protocol is started and the nodes 1〇2 to 116 start to periodically transmit the routing resources (s31〇) 在 at the start After the passive routing protocol, it is then determined whether the nodes 1〇2 to ι6 have periodic transmission of data (_). If it is determined that the nodes 102 to H6 periodically transmit data, the process returns to step s3i, and the active routing protocol is started; otherwise, when it is determined that the nodes 1〇2 to 116 do not periodically transmit data, Then return to step s3〇6 to start the passive routing protocol. In this embodiment, the active route only periodically transmits routing information, and its neighboring nodes (One Hop Neighbors), and when the neighboring nodes perceive the changes of the surrounding network state, the Spanning Tree mode is adopted. Broadcast to all nodes, and the passive protocol can also find the destination section 1296647 15328twf.doc/y at any time. When the node suddenly moves, it will expand the destination node to avoid the change of the helmet. This embodiment is a storm problem. - Each computer can be executed at boot time; when the network node status becomes a passive route, the animal enters the network. After that, the network can transmit: Yes: Route ΐ ί None: All are made ^ ^ Therefore, as shown in Table 1, the status routing protocol quantity can be reached __. Shot, N: network diameter, z: mixed area spread. The core is the number, d: --~---- ------- Active routing protocol Table 1 -----~ Passive routing protocol -------- Hybrid routing protocol -- -—^_ 悲 悲 routing protocol static network routing information amount ----- _ (N*N) 〇 (N * d) 〇 (N * d) 〇 (〇 7 ^ ^ dynamic network Routing information one--- 〇(N*N) —----- 〇(N*d) 0(N*d) 0(N)^^ Routing information storage amount 0(N) ----- ------ 0(9) 〇(N*z/d) multicast function Μ no-----S ugly In the preferred embodiment of the present invention, after the initial state is completed, the distributed routing method is When there is no network change, the amount of routing load information is zero, 1296473 15328twf.doc/y: to achieve the routing protocol of Jiahua, and also allow the point, multicast or broadcast 1 to reach the quality service demand of the card. When the path changes, it is transmitted to the neighboring node with less t-bikes, and does not cause a broadcast storm of network congestion, so that a better network system performance can be achieved. In a preferred embodiment of the present invention, This decentralized routing method network section does not generate any routing packets after convergence, and does not waste network bandwidth, and Let the transmitted packets meet the requirements of bandwidth to ensure the quality of service. In this example, the distributed routing method is suitable for a static-like environment and is also suitable for high-speed mobile environments. The remaining time, that is, the m-type routing transmission, is not wide-bandwidth, does not affect the normal packet transmission, and can also achieve the function of improving the network protocol. ^ The difficulty of the invention _ towel, the distributed routing method is The same two by =: the training state, the Long Road women's consideration of the design of the hybrid 2 gamma read good _ towel, this recorded road #法可^丁动随s 麟, and the military that is loyal to the secret , field environment, ship communication, or land, sea, and air battles use 竿二戈, fire fighting to prevent, south speed road car and car pass a future forward-looking communication technology. Temple, for car radio, can be used in various The frequency band of the communication machine, for three j,,, and hundreds of other aspects, can be combined with 802·;!〗 wireless network card, use. ^, wireless coverage model 11 1296473 15328twf.doc / y and outdoor mobile users. In a preferred embodiment of the present invention, the distributed routing method can Applicable to any of the point-to-point, point-to-multipoint and broadcast. The present invention has been disclosed in the above preferred embodiments, but it is not intended to limit the invention, and those skilled in the art without departing from the spirit and scope of the invention In the meantime, the invention may be modified and retouched. Therefore, the protection of the present invention is defined by the scope of the appended claims. [FIG. 1 illustrates a preferred embodiment of the present invention. A flow-free architecture is not intended. FIG. 2 is a flow chart showing the steps of a distributed routing method in accordance with a preferred embodiment of the present invention.
圖、3繪不健、本發明—較讀施例的—種網路維護狀 之步驟流程圖。 【主要元件符號說明】 102〜116 :節點 S202〜s212 :各個步驟流程 s302〜s310 :各個步驟流程Figure 3, diagram is not healthy, the present invention - a flow chart of the steps of the network maintenance. [Description of main component symbols] 102~116: Node S202~s212: Flow of each step s302~s310: Flow of each step