Yi Wang
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.
- D. Aldous and J. Fill. Reversible markov chains and random walks on graphs. manuscript available at http://www.stat.berkeley.edu/aldous/RWG/book.html.Google Scholar
- A. Bar-Noy, I. Kessler, and M. Sidi. Mobile users: to update or not to update? In Proceedings of the Joint Conference of the IEEE Computer and Communications Societies(INFOCOM), 1994.Google ScholarCross Ref
- L. Breslau, D. Estrin, K. Fall, S. Floyd, J. Heidemann, A. Helmy, P. Huang, S. McCanne, K. Varadhan, Y. Xu, and H. Yu. Advances in network simulation. In IEEE Computer, volume 33, pages 59--67, May 2000. Google ScholarDigital Library
- J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, October 1998. Google ScholarDigital Library
- J. Burgess, B. Gallagher, D. Jensen, and B. Levine. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networking. In Proc. of IEEE Infocom, April 2006.Google ScholarCross Ref
- T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc network research. In Wireless Communications & Mobile Computing(WCMC): Special Issue on Mobile Ad Hoc Networking: Reaearch, Trends, and Applications, volume 1, pages 483--502, 2001.Google Scholar
- S. R. Das, C. E. Perkins, and E. M. Royer. Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks. In Proceedings of the Joint Conference of the IEEE Computer and Communications Societies(INFOCOM), March 2000.Google ScholarCross Ref
- M. Demirbas, A. Arora, and M. Gouda. A pursuer-evader game for sensor networks. In Sixth Symposium on SelfStabilizing Systems (SSS'03), pages 1--16, 2003. Google ScholarDigital Library
- T. Dimitriou, S. Nikoletseas, and P. Spirakis. The infection time of graphs. Discrete Applied Mathematics, 154:2577--2589, 2006. Google ScholarDigital Library
- Kevin Fall. A delay-tolerant network architecture for challenged internets. In SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pages 27?34, New York, NY, USA, 2003. ACM. Google ScholarDigital Library
- J. J. Garcia-Luna-Aceves and E. L. Madrga. A Multicast Routing Protocol for Ad-Hoc Networks. In Proceedings of the Joint Conference of the IEEE Computer and Communications Societies(INFOCOM), 1999.Google Scholar
- A. Jindal and K. Psounis. Performance analysis of epidemic routing under contention. In IWCMC '06: Proceeding of the 2006 international conference on Communications and mobile computing, pages 539--544, New York, NY, USA, 2006. ACM Press. Google ScholarDigital Library
- D. Johnson and D. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, T. Imelinsky and H. Korth, eds, pages 153--181. Kluwer Academic Publishers, 1996.Google Scholar
- G. F. Miller and D. Cliff. Protean behavior in dynamic games: arguments for the co-evolution of pursuit-evasion tactics. In Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3, 1994. Google ScholarDigital Library
- moteiv. Telosb motes datasheet. http://www.moteiv.com/products/docs/telos-revb-datasheet.pdf.Google Scholar
- L. Mottola, A. L. Murphy, and G. P. Picco. Demonstrating Pervasive Game Development using Tiny Devices and the TinyLIME Middleware. In 5th Workshop on Network and System Support for Games (NetGames), Oct 2006.Google Scholar
- S. Mount, E. Gaura, M. Newman, A. Beresford, S. Dolan, and M. Allen. Trove: a Physical Game Running on an Ad-Hoc Wireless Sensor Network. In Joint sOc-EUSAI, pages 235--240, October 2005. Google ScholarDigital Library
- L. Schenato, S. Oh, and S. Sastry. Swarm coordination for pursuit evasion games using sensor networks. In Proc. of the International Conference on Robotics and Automation, Barcelona, Spain, 2005.Google ScholarCross Ref
- R. Shah, S. Roy, S. Jain, and W. Brunette. Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks. Elsevier Ad Hoc Networks Journal, 1, September 2003.Google ScholarCross Ref
- T. Spyropoulos, K. Psounis, and C. Raghavendra. Single-Copy Routing in Intermittently Connected Mobile Networks. In Proc. of IEEE SECON, April 2004.Google ScholarCross Ref
- A. Vahdat and D. Becker. Epidemic routing for partially-connected ad hoc networks. Technical report, Department of Computer Science, Duke University, 2000.Google Scholar
- Y. Wang, S. Kapadia, and B. Krishnamachari. MIGM: Mobile Interaction Games with Motes. In Proc. of IEEE CCNC, Janurary 2008.Google ScholarCross Ref
Index Terms
- Infection spread in wireless networks with random and adversarial node mobilities
Recommendations
Node Mobility Support Scheme Between the Mobile Network and PMIPv6 Networks
NETCOM '09: Proceedings of the 2009 First International Conference on Networks & CommunicationsTo support network mobility in wireless network, NEMO BSP is proposed by IETF. Mobility support paradigm is going to move from the MN to Network. PMIPv6 is the latest protocol based on local mobility management and network-based mobility. The mobile ...
Relay Node Placement in Wireless Sensor Networks
A wireless sensor network consists of many low-cost, low-power sensor nodes, which can perform sensing, simple computation, and transmission of sensed information. Long distance transmission by sensor nodes is not energy efficient since energy ...
Handling large-scale node failures in mobile sensor/robot networks
In Wireless Sensor Networks (WSNs), maintaining connectivity with the sink node is a crucial issue to collect data from sensors without any interruption. While sensors are typically deployed in abundance to tolerate possible node failures, a large ...
Comments