关键词: 无线传感器网络, 聚类系数, 平均路径长度, 能量损耗

Abstract: Abstract: Hierarchical routing algorithm is now a hotspot in the field of wireless sensor network. Aiming at the problems that the energy of sensor nodes are limited, a hierarchical routing algorithm for wireless sensor network based on small world model (HASWNM) was proposed in this thesis. The wireless sensor network could reflect characteristics of the small world by adding nodes with high performance as well as shortcuts among cluster heads. As the energy consumption is mainly concentrated in the data transmission phase, the energy of the cluster head of itself was taken into account while choosing the inter cluster relay. Besides, the different adaptive search area was determined according to the distance between the cluster head and the base station. Finally, it proved that the network can show the characteristics of small world when the number of high-performance nodes reaches100 and compared to the algorithms of CSMN、TSWN、DASM, the number of deaths rounds of the first node is delayed by 6%，6%，29% separately, and the average energy consumption per round of the network is reduced by 5%，12%，17% respectively. Thus the wireless sensor network constructed by the proposed algorithm has the characteristics of small world and low energy consumption.

Key words: wireless sensor network, clustering coefficient, average path length, energy consumption