Nested growing network models for researching the Internet of Things

The purpose of implementing mathematical simulation based on evolution models is to predict the possible risk and to detect potential dangers, reduce the cost of investment, increase revenue and incomes in the Internet of Things (IoT). Investigating topological structure of networks and building up network models take an important part in more specifically to understand some of the networks' more microscopic and structural features. We focus on building up network models by constructive operations of graph theory, and try to provide various network models such that they may be economic and strong in building real networks of IoT.

[1]  J. Guan,et al.  Maximal planar scale-free Sierpinski networks with small-world effect and power law strength-degree correlation , 2007, 0706.3490.

[2]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[3]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.

[4]  Ted G. Lewis,et al.  Network Science: Theory and Applications , 2009 .

[5]  Henning Fernau,et al.  An exact algorithm for the Maximum Leaf Spanning Tree problem , 2009, Theor. Comput. Sci..

[6]  Chonghui Guo,et al.  A deterministic small-world network created by edge iterations , 2006 .

[7]  G. Fertin,et al.  High-dimensional Apollonian networks , 2005, cond-mat/0503316.

[8]  Hawoong Jeong,et al.  Scale-free trees: the skeletons of complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Shuigeng Zhou,et al.  A general geometric growth model for pseudofractal scale-free web , 2007 .

[10]  Bing Yao,et al.  Research on Edge-Growing Models Related with Scale-Free Small-World Networks , 2014 .

[11]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[12]  M. Newman.  Resource Letter CS-1: Complex Systems , 2011 .

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

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Shuigeng Zhou,et al.  Enumeration of spanning trees in a pseudofractal scale-free web , 2010, 1008.0267.

[16]  André Raspaud,et al.  Recursive graphs with small-world scale-free properties. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Xia Liu,et al.  Applying Graph theory to the Internet of Things , 2013, 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing.

[18]  Zhongzhi Zhang,et al.  Dissimilar behaviors of coherent exciton transport on scale-free networks with identical degree sequence , 2011 .