Connectivity of random graphs and mobile networks: validation of Monte Carlo simulation results
Proceedings of the 2001 ACM symposium on Applied computing
A Framework for Generating Network-Based Moving Objects
Geoinformatica
Competitive online routing in geometric graphs
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Multicast algorithms in service overlay networks
Computer Communications
Multi-agent Model Analysis of the Containment Strategy for Avian Influenza (AI) in South Korea
BIBM '08 Proceedings of the 2008 IEEE International Conference on Bioinformatics and Biomedicine
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Hi-index | 0.00 |
This study examines the problem of disease spreading and containment in spatial networks, where the computational model is capable of detecting disease progression to initiate processes mitigating infection spreads. This paper focuses on disease spread from a central point in a 1 x 1 unit square spatial network, and makes the model respond by trying to selectively decimate the network and thereby contain disease spread. Attention is directed on the kinematics of disease spreading with respect to how damage is controlled by the model. In addition, the authors analyze both the sensitivity of disease progression on various parameter settings and the correlation of parameters of the model. As the result, this study suggests that the radius of containment process is the most critical parameter and its best values with the computational model would be a great help to reduce damages from disease spread of a future pandemic. The study can be applied to controlling other virus spread problems in spatial networks such as disease spread in a geographical network and virus spread in a brain cell network.