Abstract
We investigated data gathering time in an epidemically data sharing system with opportunistically communicating mobile sensors. We proposed a stochastic process of the system where N sensors moved randomly and independently on the d–dimensional square grid with size L and when meeting opportunistically at the same position on the grid, the sensors shared and stored all possessing data epidemically. We focused on three data gathering times, that is, latency times that (1) at least one sensor collects all (2) every sensor collects at least one common data (3) every sensor collects all. As a result, we found that in general the complementary cumulative distribution functions of these times decay exponentially in their asymptotic regions.We also examined a decay speed, which is also called relaxation time, of the exponential decay numerically with varying d, L, and N. Finally we showed scaling relations of the relaxation times. We think that these relations are useful for estimating the minimum required number of sensors to collect data within a certain short period of time when the sensors are densely covered on the system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zhang, Z.: Routing in Intermittently Connected Mobile Ad Hoc Networks and Delay Tolerant Networks: Overview and Challenges. IEEE Communications Surveys and Tutorials 8(1), 24–37 (2006)
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technocal Report CS-2000-06, Department of Computer Science, Duke University (2000)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In: Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking (2005)
Brugess, J., Gallagher, B., Jensen, D., Levine, B.N.: MaxProp: Routing for vehicle-based disruption-tolerant networks. In: Proc. IEEE INFOCOM (2006)
Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L.-S., Rubenstein, D.: Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet. In: ASPLOS-X Conference (2002)
Zhang, P., Sadler, C.M., Lyon, S.A., Martonosi, M.: Hardware Design Experiences in ZebraNet. In: Proc. of the 2nd International Conference on Embedded Networked Sensor Systems, Baltimore, USA (2004)
Small, T., Haas, Z.J.: The Shared Wireless Infostation Model - A New Ad Hoc Networking Paradigm (or Where there is a Whale, there is a Way). In: MobiHoc 2003, Annaplis, Maryland, USA (2003)
Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., Scott, J.: Pocket Switched Networks: Real-world mobility and its consequences for opportunistic forwarding. University of Cambridge, Computer Lab Technical Report, UCAM-CL-TR-617 (2005)
Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., Scott, J.: Impact of Human Mobility on Opportunistic Forwarding Algorithms. IEEE Transactions on Mobile Computing 6(6) (2007)
Karagiannis, T., Boudec, J.-Y.L., Vojnovic, M.: Power law and exponential decay of inter contact times between mobile devices. Technical Report MSR-TR-2007-24, Microsoft Research (2007)
Redner, S.: A Guide to First-passage Processes. Cambridge (2007)
Shah, R.C., Roy, S., Jain, S., Brunette, W.: Data MULEs: Modeling a Three-tier Architecture for Sparse Sensor Networks. In: Proc. of the First International Workshop on Sensor Network Protocols and Applications, pp. 30–41 (2003)
Matsuda, T., Takine, T.: (p,q)-Epidemic Routing for Sparsely Populated Mobile Ad Hoc Networks. IEEE Journal on Selected Areas in Communications 26(5) (2008)
Fujihara, A., Miwa, H.: Efficiency Analysis on an Information Sharing Process with Randomly Moving Mobile Sensors. In: 2008 International Symposium on Applications and The Internet (SAINT 2008), pp. 241–244 (2008)
Fujihara, A., Miwa, H.: Relaxation times of information gathering in an epidemically information sharing process with randomly moving sensors in a bounded space. In: 2009 the 2nd International Workshop on Information Network Design, pp. 360–365 (2009)
Aldous, D., Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs. Continuous State, Infinite State and Random Environment, ch. 13, p. 21 (2001), http://www.stat.berkeley.edu/~aldous/RWG/book.html
Grimmett, G., Stirzaker, D.: Probability and Random Processes, 3rd edn., Oxford (2001)
Fujihara, A.: ZebraNet and its Theoretical Analysis on Distribution Functions of Data Gathering Times. In: The 2nd International Workshop on Moble Opportunistic Networking (MobiOpp 2010), Pisa, Italy (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fujihara, A., Miwa, H. (2010). Scaling Relations of Data Gathering Times in an Epidemically Data Sharing System with Opportunistically Communicating Mobile Sensors. In: Caballé, S., Xhafa, F., Abraham, A. (eds) Intelligent Networking, Collaborative Systems and Applications. Studies in Computational Intelligence, vol 329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16793-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-16793-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16792-8
Online ISBN: 978-3-642-16793-5
eBook Packages: EngineeringEngineering (R0)