Research Article
Self-Administered Information Sharing Framework Using Bioinspired Mechanisms
Algorithm 1
Search routes to alternative (distant) exits.
| (1) | While a SP with novelty-seeking characteristic reaches a node do | | (2) | if the node is not an alternative exit then | | (3) | Examine if any route to the alternative exists in the mailbox | | (4) | if there are routes to an alternative exist then | | (5) | Choose the top-ranked route and store it in the cognitive map of SP | | (6) | Generate a random value between 0 and 1 | | (7) | ifthen | | (8) | Choose the next hop in the to follow | | (9) | else | | (10) | Choose a random neighbour node as the next hop | | (11) | end if | | (12) | else | | (13) | Choose a random neighbour node as the next hop | | (14) | end if | | (15) | else | | (16) | Stop searching and generate an ACK | | (17) | end if | | (18) | end while |
|
