| 摘要 |
Method of generating routing information, in the form of metrics of links, in a meshed network (201) comprising a plurality of mobile nodes (A,B,C,S,D), at least one of said nodes (A) preparing to leave said network (201), the method being characterized in that it comprises at least the following successive steps: evaluating (401) the routing information values associated with the group of links (A-S,A-B,A-D) linking said node (A) to its neighbour nodes (S,B,D), assigning (402) successively the lowest routing information value(s) from among those associated with the links of said group (A-S,A-B,A-D) to the immediately higher routing information value among those associated with the links of said group (A-S,A-B,A-D) and until the routing information values associated with the links of said group (A-S,A-B,A-D) are all equal, incrementing (403) simultaneously the set of routing information values associated with the links of said group (A-S,A-B,A-D) by a predetermined increment ?m and repeating this operation until said values reach a given maximum. |
