On the relevance of the edge-Markovian evolving graph model for real mobile networks

The development of wireless devices led the scientific community to focus more and more on systems of interaction composed of moving entities. In this context, different models have been proposed in an attempt to capture properties of the observed dynamics. Among those models, the edge-Markovian evolving graph model is appealing since it enables to highlight temporal dependencies in the evolution of the graphs. This model relies on two parameters accounting respectively for the creation and suppression of links in the graph. Thus it assumes that these two parameters are sufficient to characterise the dynamics during all the evolution of the graph. In this paper, we test this hypothesis by confronting the model to 6 datasets recording real traces of evolving networks. In particular, we study the proportion of created and deleted links over the time. The results show that 5 of the 6 case studies present an heterogeneous distribution of those fractions which contradicts the underlying hypothesis of the model. Besides, in order to understand the importance this might have as regard structural properties of real networks, we also study the impact the Markovian model has on the mean degree over the time. It turns out that even in the suitable case, the model fails to reproduce correctly this property which indicates its inadequacy for even more complex properties of real evolving networks.

[1]  Afonso Ferreira,et al.  On models and algorithms for dynamic communication networks : the case for evolving graphs † , 2007 .

[2]  Laurent Massoulié,et al.  The diameter of opportunistic mobile networks , 2007, CoNEXT '07.

[3]  Andrea E. F. Clementi,et al.  Flooding time in edge-Markovian dynamic graphs , 2008, PODC '08.

[4]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[5]  Andrea E. F. Clementi,et al.  Rumor Spreading in Random Evolving Graphs , 2013, ESA.

[6]  Elena Pagani,et al.  Opportunistic forwarding in workplaces , 2009, WOSN '09.

[7]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[8]  Marcelo Dias de Amorim,et al.  Otiy: Loactors tracking nodes , 2007, ArXiv.

[9]  Marcelo Dias de Amorim,et al.  The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing , 2009, IEEE INFOCOM 2009.

[10]  Andrea E. F. Clementi,et al.  Information Spreading in Stationary Markovian Evolving Graphs , 2011 .

[11]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[12]  Marcelo Dias de Amorim,et al.  Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs , 2011, IEEE Transactions on Communications.

[13]  Andrea E. F. Clementi,et al.  Flooding Time of Edge-Markovian Evolving Graphs , 2010, SIAM J. Discret. Math..

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

[15]  Alexandre Proutière,et al.  Hop limited flooding over dynamic networks , 2011, 2011 Proceedings IEEE INFOCOM.

[16]  Imrich Chlamtac,et al.  A Graph-Based Model for Disconnected Ad Hoc Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[17]  Céline Robardet,et al.  Description and simulation of dynamic mobility networks , 2008, Comput. Networks.

[18]  B. Bollobás The evolution of random graphs , 1984 .

[19]  Marcelo Dias de Amorim,et al.  Otiy: locators tracking nodes , 2007, CoNEXT '07.