Research Article
The Social Relationship Based Adaptive Multi-Spray-and-Wait Routing Algorithm for Disruption Tolerant Network
| Select the next hop | | Begin | | For each message in AllMessage: | | If timeout then | | Get all connections and generate node list of all current connection | | Calculate each node’s metric value and rank them in descend | | Send message to the first nodes in the node list | | Else | | Get all connections and generate node list of all current connection | | Calculate each node’s metric value and rank them in descend. | | Calculate similarities of destination node with the first node in the list and the node with current message respectively | | If the similarity of node is higher | | Then transfer message to node | | End if | | End if | | End for | | End |
|
