Simulating the Statistics of the First Meetings Using Dynamic "Open Environments"

Algorithms and protocols for opportunistic, delay tolerant and wireless ad-hoc networks are designed and validated by simulating the people interactions induced by the nodes mobility. There are cases in which we are interested in simulating just the first interaction between a pair of nodes, for instance to assess the performance of a discovery or epidemic routing protocol. In this cases nodes rapidly extinguish their utility hence it is not convenient to simulate these scenarios using a fixed amount of nodes. Thus we present a novel simulation methodology that introduces the "open environment" where nodes enter, can interact through meeting with other nodes and then exit, keeping the focus on the environment rather than on what happen before and after the nodes stay in the interesting area. The proposed approach uses the statistical distribution extracted from the real traces to reproduce directly the human interaction pattern without going through the traditional random way point approach. Meetings are simulated by a time-varying graph that holds the state of the interactions in the environment, while adapting to the statistics of single node to its history. We show that even in a simple scenario, the epidemic infection, Markov memory-less models have been fairly far from the interaction scenarios that the method reproduces.

[1]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

[2]  Giuseppe Bianchi,et al.  Delay performance of a Publish Subscribe system deployed over a memory-constrained, Delay Tolerant Network , 2011, 2011 The 10th IFIP Annual Mediterranean Ad Hoc Networking Workshop.

[3]  Timur Friedman,et al.  Characterizing pairwise inter-contact patterns in delay tolerant networks , 2007, Autonomics.

[4]  Sebastien Ardon,et al.  EMO: A statistical encounter-based mobility model for simulating delay tolerant networks , 2008, 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[5]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[6]  Pan Hui,et al.  Pocket Switched Networks: Real-world mobility and its consequences for opportunistic forwarding , 2005 .

[7]  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).

[8]  Pan Hui,et al.  Wireless Epidemic Spread in Dynamic Human Networks , 2008, BIOWIRE.

[9]  Kevin C. Almeroth,et al.  Towards realistic mobility models for mobile ad hoc networks , 2003, MobiCom '03.

[10]  Pan Hui,et al.  CRAWDAD dataset cambridge/haggle (v.2009-05-29) , 2009 .

[11]  Bhaskar Krishnamachari,et al.  Findings from an empirical study of fine-grained human social contacts , 2009, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services.

[12]  Lorenzo Bracciale,et al.  Human time-scale duty cycle for opportunistic WiFi based mobile networks , 2013, 2013 24th Tyrrhenian International Workshop on Digital Communications - Green ICT (TIWDC).

[13]  Andrea Detti,et al.  Effectiveness of overlay multicasting in mobile ad-hoc network , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[14]  Marco Conti,et al.  Characterising Aggregate Inter-contact Times in Heterogeneous Opportunistic Networks , 2011, Networking.

[15]  Cecilia Mascolo,et al.  Mobility Models for Systems Evaluation , 2009, Middleware for Network Eccentric and Mobile Applications.

[16]  Cecilia Mascolo,et al.  CTG: a connectivity trace generator for testing the performance of opportunistic mobile systems , 2007, ESEC-FSE '07.

[17]  Tristan Henderson,et al.  CRAWDAD: a community resource for archiving wireless data at Dartmouth , 2005, CCRV.

[18]  Qinghua Li,et al.  Wakeup scheduling for energy-efficient communication in opportunistic mobile networks , 2013, 2013 Proceedings IEEE INFOCOM.