Analysis of dynamic sensor networks: Power law then what?

Proceedings of the 2007 2nd International Conference on Communication System Software and Middleware and Workshops, COMSWARE 2007

Volumn , Issue , 2007, Pages

  Fleury, Éric ^a   Guillaume, Jean Loup ^a   Robardet, Céline ^b   Scherrer, Antoine ^a  

^a UNIV LYON   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA MINING; GRAPH THEORY; RANDOM PROCESSES;

COUPLED ARGUMENTS; DYNAMIC SENSOR NETWORKS; POWER LAW; RANDOM MODEL;

WIRELESS SENSOR NETWORKS;

EID: 34748877156     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/COMSWA.2007.382427     Document Type: Conference Paper

References (20)

1. K. E. Fox, "Revisiting "scale-free" networks," BioEssays, vol. 27, no. 10, pp. 1060-1068, 2005.
2. R. Albert, H. Jeong, and A. Barabasi, "The diameter of the World Wide Web," Nature, no. 401, pp. 130-131, 1999.
3. A. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, no. 286, pp. 509-512, 1999.
4. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power law relationships of the internet topology," Computer Communication Review, no. 29, pp. 251-262, 1999.
5. A. Broder, S. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, "Graph structure in the web," Computer Networks, vol. 33, no. 1-6, pp. 309-320, 2000.
6. G. Johnson, "First cells, then species, now the web," NY Times, pp. Section F, Page 1, Column 5, December 26 2000.
7. A. Chaintreau, J. Crowcroft, C. Diot, R. Gass, P. Hui, and J. Scott, "Pocket switched networks and the consequences of human mobility in conference environments," in ACM SIGCOMM 1st workshop on delay tolerant networking and applications (WDTN 2005), 2005.
8. R. Agrawal, T. Imielinski, and A. Swami, "Mining association rules between sets of items in large databases," in Proceedings ACM SIGMOD'93. ACM Press, 1993, pp. 207-216.
9. H. Mannila and H. Toivonen, "Levelwise search and borders of theories in knowledge discovery," Data Mining and Knowledge Discovery journal, vol. 1, no. 3, pp. 241-258, 1997.
10. C. Lucchese, S. Orlando, and R. Perego, "DcLclosed: A fast and memory efficient algorithm to mine frequent closed itemsets," in Proceedings of the Workshop on Frequent Itemset Mining Implementations, 2004.
11. J. Besson, C. Robardet, J.-F. Boulicaut, and S. Rome, "Constraint-based concept mining and its application to microarray data analysis," Intelligent Data Analysis, vol. 9, no. 1, pp. 59-82, 2005.
12. G. R. Grimmett and D. R. Stirzaker, Probability and Random Processes, 3rd edition. Oxford University Press, 2001.
13. A. Chaintreau, J. Crowcroft, C. Diot, R. Gass, P. Hui, and J. Scott, "Impact of human mobility on the design of opportunistic forwarding algorithms," in INFOCOM 2006, 2006.
14. L. Li, D. Alderson, R. Tanaka, J. C. Doyle, and W. Willinger, "Towards a theory of scale-free graphs: Definition, properties, and implications," Internet Mathematics, vol. 2, no. 4, pp. 431-523, 2005.
15. P. Doukhan, G. Oppenheim, and M. Taqqu, Eds., Theory and Applications of Long-Range Dependence. Birkhäuser, 2002.
16. M. Babu, N. Luscombe, L. Aravind, M. Gerstein, and S. Teichmann, "Structure and evolution of transcriptional regulatory networks," Curr Opin Struct Biol., vol. 14, no. 3, pp. 283-291, 2004.
17. M. Babu, L. Aravind, and S. Teichmann, "Evolutionary dynamics of prokaryotic transcriptional regulatory networks," J Mol Biol., vol. 358, no. 2, pp. 614-633, 2006.
18. A. Vazquez, J. Oliveira, and A.-L. Barabasi, "The inhomogeneous evolution of subgraphs and cycles in complex networks," Physical Review E, vol. 71, p. 025103, 2005.
19. P. Abry and D. Veitch, "Wavelet analysis of long-range dependent traffic," IEEE Trans, on Info. Theory, vol. 44, no. 1, pp. 2-15, Jan. 1998.
20. B. Bollobas, Random graphs. Academic Press, 1985.