Patent Document ID: 7496680
Application ID: 10534929
Patent Flag: 1

Claim One:
1. A method for routing messages from a source node (S) to a destination node in a dynamic network, said source node including a routing table, each row in the routing table representing a possible destination node (D) for a data message transmitted from the source node (S), and each row in the routing table including one probability value p(k,D) for each neighbor node (k) of the source node (S), the method comprising: updating the probability values with quality measurements taken each time a data message is sent from the source node (S) to the destination node (D); routing a tunable predefined percentage of the messages by choosing the neighbor node with the highest probability value in the row for a destination node (D) in the routing table; and routing the other messages by distributing the messages among the neighbor nodes according to the probability values given in the same row in the routing table, wherein the probability values of using a specific neighbor node (k) of the source node (S) for transmitting data from the source node (S) to the destination node (D) are updated according to the following expression: p ⁡ ( k , D ) ⁢ ( old ) + δ 1 + δ where δ represents the measured quality of a path through the node k, and p(k,D)(old) represents the old probability value amount of using the node (k) for transmitting data from the source node (S) to the destination node (D), and the remaining probability values in the routing table are adjusted in such a way that all the probability values in each row of the routing table sum to one.