|
When a node receives discovery Interests, it will store the sending node¡¯s information in a separate table. This table contains two fields: the neighbor nodes¡¯ speed and the neighbor nodes¡¯ direction.If the nodes are heading toward each other and the distance between the two nodes is constant, the direction value is set to one. Otherwise, the direction value is set to 0. Each of the neighbor nodes in the table will then be rated based on these two values. Suppose a neighbor node has a direction value of 1 and a lower speed. In that case, it will be ranked higher as a connection with a node that moves slower and heads toward or in the same direction will have a higher probability of lasting longer. |