This paper analyzed optimal coverage for routing in three-dimensional wireless sensor networks.For this NP-hard combinatorial optimization problem

we proposed a new solution used techniques from Computational Geometry

Graph Coloring and established a new model for optimal coverage.We also proposed an energy-efficient distributed heuristic algorithm to find the optimal coverage routing path.Based on the model and algorithm

we presented a three-dimensional optimal coverage routing protocol in a distributed manner.To evaluate the performance of the algorithm

a time complexity analysis was given for each operation.In the end

we analyzed the coverage quality and compared the network lifetime with several typical protocols.Simulation results show that proposed routing protocol has low time complexity and it is considerably effective

scalable and robust.