Research on key nodes of wireless sensor network based on complex network theory

On the basis of complex network theory, the issues of key nodes in Wireless Sensor Networks (WSN) are discussed. A model expression of sub-network fault in WSN is given at first; subsequently, the concepts of average path length and clustering coefficient are introduced. Based on the two concepts, a novel attribute description of key nodes related to sub-networks is proposed. Moreover, in terms of node deployment density and transmission range, the concept of single-point key nodes and generalized key nodes of WSN are defined, and their decision theorems are investigated.

[1]  Ren Yueqing,et al.  A study on topological characteristics of wireless sensor network based on complex network , 2010, 2010 International Conference on Computer Application and System Modeling (ICCASM 2010).

[2]  Ravi Mazumdar,et al.  Hybrid sensor networks: a small world , 2005, MobiHoc '05.

[3]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[4]  Edgar H. Callaway,et al.  Wireless Sensor Networks: Architectures and Protocols , 2003 .

[5]  Ahmed Helmy,et al.  Small worlds in wireless networks , 2003, IEEE Communications Letters.

[6]  Béla Bollobás,et al.  Random Graphs , 1985 .

[7]  M. Penrose The longest edge of the random minimal spanning tree , 1997 .

[8]  D. Watts The “New” Science of Networks , 2004 .

[9]  John A. Silvester,et al.  Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .

[10]  S. Jardosh,et al.  A Survey: Topology Control For Wireless Sensor Networks , 2008, 2008 International Conference on Signal Processing, Communications and Networking.