1. DALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs

M. Rahmaninia; E. Bigdeli; M. Zaker

Volume 2, Issue 1 , Winter and Spring 2014, , Pages 21-27

  Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, ...  Read More