Loading...
Please wait, while we are loading the content...
Similar Documents
Infection spread in wireless networks with random and adversarial node mobilities
| Content Provider | ACM Digital Library |
|---|---|
| Author | Kapadia, Shyam Krishnamachari, Bhaskar Wang, Yi |
| 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. |
| Starting Page | 17 |
| Ending Page | 24 |
| Page Count | 8 |
| File Format | |
| ISBN | 9781605581118 |
| DOI | 10.1145/1374688.1374692 |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2008-05-26 |
| Publisher Place | New York |
| Access Restriction | Subscribed |
| Subject Keyword | Node mobility Adversarial Infection spread Random Wireless network |
| Content Type | Text |
| Resource Type | Article |