NLL: A Complex Network Model with Compensation for Enhanced Connectivity

The canonical scale-free model to describe complex networks is BA model with an power-law exponent γ = 3. Researchers further propose DS model (1 <; γ ≤ 4) to consider link failure besides node growth in preferential attachment. However, both models assume globally preferential attachment which is difficult to achieve in real networks. This paper proposes a new scale-free model, i.e. Neighborhood Log-on and Log-off model (NLL) which considers locally preferential connectivity. NLL incorporates both node growth and removal in topology evolvement. Unlike BA and DS, NLL adds compensation mechanism to enhance connectivity. The analysis shows that NLL has 1 <; γ ≤ 3. We conduct simulations to evaluate NLL performance and show that, NLL has short average path length and large clustering coefficient, compared with BA and DS models.

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

[2]  Guanrong Chen,et al.  Complexity and synchronization of the World trade Web , 2003 .

[3]  Yue Wang,et al.  Scale-free model for wireless sensor networks , 2013, 2013 IEEE Wireless Communications and Networking Conference (WCNC).

[4]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[5]  Kin K. Leung,et al.  Connectivity in Selfish, Cooperative Networks , 2010, IEEE Communications Letters.

[6]  Kin K. Leung,et al.  Residual energy-aware cooperative transmission (REACT) in wireless networks , 2010, The 19th Annual Wireless and Optical Communications Conference (WOCC 2010).

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

[8]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[9]  Kin K. Leung,et al.  Clique-Based Utility Maximization in Wireless Mesh Networks-Algorithm, Simulation, and Mathematical Analysis , 2009, 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops.

[10]  Liming Liu,et al.  Degree distributions of evolving networks , 2006 .

[11]  Panos M. Pardalos,et al.  Handbook of Optimization in Complex Networks , 2012 .

[12]  S. N. Dorogovtsev,et al.  Scaling Behaviour of Developing and Decaying Networks , 2000, cond-mat/0005050.

[13]  S. Strogatz Exploring complex networks , 2001, Nature.

[14]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

[15]  Arun Somani,et al.  Distributed fault detection of wireless sensor networks , 2006, DIWANS '06.

[16]  Pan Hui,et al.  Handbook of Optimization in Complex Networks , 2012 .

[17]  David R. Karger,et al.  Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.

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

[19]  Xiang Li,et al.  A local-world evolving network model , 2003 .