ON-DEMAND ROUTE SEARCH METHOD IN AD-HOC NETWORK

摘要

PURPOSE: An on-demand route search method in an Ad-hoc network is provided to enable all the nodes in an Ad-hoc network to rapidly optimize and search for the whole routes of the network by combining the merits of a table management method and an on-demand method. CONSTITUTION: If a route discovery message is received(S301), a mobile node defines a hop count as '1' and a transport flag as 'false'(S302). Then the mobile node judges whether 'pos', the value of an 'address_length' field, is smaller than '0'(S303). In case that 'pos' is smaller than '0', the mobile node judges whether the transport flag is defined as 'true'(S310). If 'pos' is not smaller than '0', the mobile node defines 'dest' as 'address(pos)'(S304) and judges whether the 'dest' address is its own address(S305). In case that the 'dest' address is its own address, the mobile node judges again whether the transport node is true(S310). However, if the 'dest' address is not its own address, the mobile node judges whether a route having a matched pair of£dest,next| exists in its own routing table(S306). If a route having a matched pair of£dest,next| exists, the mobile node compares the hop value of the route with the presently counted 'hop count' value(S307).