Infection spread in wireless networks with random and adversarial node mobilities

Authors:
Yi Wang;Shyam Kapadia;Bhaskar Krishnamachari
Affiliations:
University of Southern California, Los Angeles, CA, USA;University of Southern California, Los Angeles, CA, USA;University of Southern California, Los Angeles, CA, USA
Venue:
Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models
Year:
2008

Citing 8
Cited 3

Protean behavior in dynamic games: arguments for the co-evolution of pursuit-evasion tactics

SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
A performance comparison of multi-hop wireless ad hoc network routing protocols

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Advances in Network Simulation

Computer
A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Trove: a physical game running on an ad-hoc wireless sensor network

Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies
Performance analysis of epidemic routing under contention

Proceedings of the 2006 international conference on Wireless communications and mobile computing
The infection time of graphs

Discrete Applied Mathematics
A pursuer-evader game for sensor networks

SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems

Findings from an empirical study of fine-grained human social contacts

WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Tight bounds on information dissemination in sparse mobile networks

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Information dissemination via random walks in d-dimensional space

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the process of the spread of an infection among mobile nodes moving on a finite, grid based map. A random walk and a novel adversarial model are considered as two extreme cases of node mobility. With N nodes, we present analytical and simulation results for both mobility models for a square grid map with size √G × √G. A key finding is that with random mobility the total time to infect all nodes decreases with N while with an adversarial model we observe a reverse trend. Specifically, the random case results in a total infection time of Θ(GlogGlogN/(N) as opposed to the adversarial case where the total infection time is found to be Θ(√(Glog(N). We also explore the possibility of emulating such an infection process as a mobile interaction game with wireless sensor motes, and the above results are complimented by traces obtained from an empirical study with humans as players in an outdoor field.