Routing method for mobile infrastructureless network

Abstract

The present invention provides a method for selecting and routing data in an ad-hoc mobile wireless network having a plurality of Nodes including multiple sources and destinations. The method includes sending a forward control packet from a source to the destination via at least one intermediate Node at intervals of time, where the intermediate Node is randomly selected. Each of the intermediate Nodes store weights of the neighbor Nodes. When the forward control packets reach the destination Node, they are evaluated in accordance with one or more given parameters and send back as backward control packets storing the evaluation results. As each of the intermediate Nodes receive the backward control packets, the weights of the corresponding neighbor Nodes are modified based on the stored evaluation results. Similarly, as the backward control packets are received at the source Nodes and the weights of the corresponding neighbor Nodes are modified based on the stored evaluation results. Finally, a group of routing routes to the destination are selected based on the modified weights of the neighbor Nodes and data packets are send from the source to the destination via the intermediate Nodes upon selection of the group.

1 - 51 . (canceled)  
   
   
       52 . A method for biasing a routing process in an ad-hoc mobile wireless network having a plurality of nodes including multiple sources and destinations, comprising: 
 sending from a destination at least one trail control packet via at least one intermediate node at intervals of time, wherein said intermediate node is randomly selected and each of the intermediate nodes storing weights for each of its neighbor nodes;    receiving the trail control packets at the intermediate nodes; and    modifying the weights of each of the neighbor nodes at each of the intermediate nodes immediately upon receipt of the trail control packets at the intermediate nodes.    
   
   
       53 . The method of  claim 52  further comprising: 
 selecting a group of routing paths to said destinations via said intermediate nodes based on the modified weights of said neighbor nodes.    
   
   
       54 . The method of  claim 53  further comprising: 
 sending data packets from the sources to the destinations via said intermediate nodes upon the selection of said group of routing paths.    
   
   
       55 . The method of  claim 52  further comprising: 
 selecting the optimal routing path to said destinations via said intermediate nodes based on the modified weight of said neighbor nodes.    
   
   
       56 . The method of  claim 55  further comprising: 
 sending data packets from the sources to the destinations via said intermediate nodes upon the selection of the optimal routing path.    
   
   
       57 . The method of  claim 52  further comprising: 
 sending the data to said destinations via said intermediate nodes based on criteria of said weights of the neighbor nodes for said intermediate node.    
   
   
       58 . The method of  claim 57  wherein said criteria comprise weights equal to or greater than a value.  
   
   
       59 . The method of  claim 57  wherein said criteria comprise maximum weight.  
   
   
       60 . The method of  claim 52  further comprising: 
 sending from a source at least one forward control packet storing the data to be sent, via at least one intermediate node to one or more destinations at intervals of time, wherein said intermediate node is randomly selected and each of the intermediate nodes storing weights for each of its neighbor nodes.