Self-Administered Information Sharing Framework Using Bioinspired Mechanisms
Algorithm 2
Disperse messages when a new exit is generated.
(1)
When the network is initialised:
(2)
for all the node in the network do
(3)
Set the path to exits at node to null
where , is the number of exits. Term depicts the path to the -th exit
(4)
end for
(5)
When a new exit is generated:
(6)
for all the exit in the network
(7)
Broadcast SPs among the entire network
(8)
When a SP arrives a node, the node will extract the route from the SP
(9)
/ If the previous path is worse than the newly obtained one, then replace it /
(10)
if
(11)
Then
where represents the route to exit in the newly reached SP. and depict the QoS of the previous and new routes to exit , respectively. In our treatment, the QoS is number of hops to an exit
