On the Ability of Mobile Sensor Networks to Diffuse Information

We examine the ability of networks formed by mobile sensor nodes to diffuse information in the case when communication is only possible during opportunistic encounters. Our setting assumes that mobile nodes are continuously sensing the world and acquiring new information. We form an abstract model of this situation and show by theoretical analysis, simulation, and real mobility data that the diffusion of information in this setting cannot be as efficient as when we allow arbitrary contact patterns between the nodes with the same overall contact statistics. This establishes a fundamental asymptotic limitation on the information diffusion capacity of such opportunistic mobile sensor networks - the encounter patterns arising out of physical motions in a geometric space are not ideal for information diffusion.

[1]  M. Gribaudo,et al.  2002 , 2001, Cell and Tissue Research.

[2]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[3]  Yuval Peres,et al.  Mobile geometric graphs: detection, coverage and percolation , 2010, Probability Theory and Related Fields.

[4]  Eli Upfal,et al.  Tight bounds on information dissemination in sparse mobile networks , 2011, PODC '11.

[5]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[6]  T. Delot,et al.  Dissemination of information in inter-vehicle ad hoc networks , 2008, 2008 IEEE Intelligent Vehicles Symposium.

[7]  Ellen W. Zegura,et al.  A framework for characterizing the wireless and mobile network continuum , 2011, CCRV.

[8]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[9]  Pierre Fraigniaud,et al.  Parsimonious flooding in dynamic graphs , 2009, PODC '09.

[10]  Emanuele Viola,et al.  On the Complexity of Information Spreading in Dynamic Networks , 2013, SODA.

[11]  B. Pittel.  On spreading a rumor , 1987 .

[12]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[14]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[15]  Matthias Grossglauser,et al.  CRAWDAD dataset epfl/mobility (v.2009-02-24) , 2009 .

[16]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[17]  David P. Dobkin,et al.  Efficient and small representation of line arrangements with applications , 2001, SCG '01.

[18]  Alexandros G. Dimakis,et al.  The Impact of Mobility on Gossip Algorithms , 2012, IEEE Transactions on Information Theory.

[19]  Agathoniki Trigoni,et al.  Efficient Data Propagation in Traffic-Monitoring Vehicular Networks , 2011, IEEE Transactions on Intelligent Transportation Systems.

[20]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[21]  Andrea E. F. Clementi,et al.  MANETS: High Mobility Can Make Up for Low Transmission Power , 2009, ICALP.

[22]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[23]  A. Azzouz.  2011 , 2020, City.

[24]  Peter I. Corke,et al.  Data muling over underwater wireless sensor networks using an autonomous underwater vehicle , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..