Analysis of Dynamic Sensor Networks: Power Law Then What?

Recent studies on wireless sensor networks (WSN) have shown that the duration of contacts and inter-contacts are power law distributed. While this is a strong property of these networks, we will show that this is not sufficient to describe properly the dynamics of sensor networks. We will present some coupled arguments from data mining, random processes and graph theory to describe more accurately the dynamics with the use of a random model to show the limits of an approach limited to power law contact durations.

[1]  Patrice Abry,et al.  Wavelet Analysis of Long-Range-Dependent Traffic , 1998, IEEE Trans. Inf. Theory.

[2]  Walter Willinger,et al.  Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications , 2005, Internet Math..

[3]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[4]  Jean-François Boulicaut,et al.  Constraint-based concept mining and its application to microarray data analysis , 2005, Intell. Data Anal..

[5]  AgrawalRakesh,et al.  Mining association rules between sets of items in large databases , 1993 .

[6]  M. Gerstein,et al.  Structure and evolution of transcriptional regulatory networks. , 2004, Current opinion in structural biology.

[7]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[8]  Pan Hui,et al.  Pocket Switched Networks and the Consequences of Human Mobility in Conference Environments , 2005, SIGCOMM 2005.

[9]  Heikki Mannila,et al.  Levelwise Search and Borders of Theories in Knowledge Discovery , 1997, Data Mining and Knowledge Discovery.

[10]  S. Teichmann,et al.  Evolutionary dynamics of prokaryotic transcriptional regulatory networks. , 2006, Journal of molecular biology.

[11]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[12]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[13]  Salvatore Orlando,et al.  DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets , 2004, FIMI.

[14]  A. Barabasi,et al.  Inhomogeneous evolution of subgraphs and cycles in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[16]  Evelyn Fox Keller,et al.  Revisiting "scale-free" networks. , 2005, BioEssays : news and reviews in molecular, cellular and developmental biology.

[17]  G. Grimmett,et al.  Probability and random processes , 2002 .

[18]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[19]  Pan Hui,et al.  Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.