To solve the problem of optimal deployment of nodes in three dimensional sensor networks, an algorithm of
maximal efficient volume per node is presented by analyzing some popular deployment patterns of space-filling polyhedrons
such as cube and truncated octahedron. This algorithm can calculate the minimal number of sensors needed to achieve both
full coverage and connectivity of networks. Finally, the deployment performances of regular polyhedrons are compared by
some simulations. Optimal deployment patterns under the condition of different values of ????/???? are obtained, where ???? is
communication range and ???? is sensing range, and the deployment efficiency of networks is improved.