Summary: According to the iterative algorithm for creating Koch curves, we generate a Koch network by considering a tetrahedron as the basic unit of the iteration and investigate its structural properties, such as degree distribution, clustering coefficient, average path length and degree correlation, analytically. The results show that the network is scale-free and the exponent of the degree distribution is \(\gamma \approx 3.32\). The clustering coefficient tends to be 0.870435 in the limit of large iteration and the study of the average path length proves that the network exhibits the small world effect. We also find that the generated network is not degree uncorrelated because the function \(k_{nn}(k)\) is dependent on the degree of site.