Abstract. Aiming at localization algorithms in 3D space which has some problems such as high complexity, large power consumption, long delay and so on, a 3D localization algorithm was proposed which combines DV-Hop with cube shell intersection method. This algorithm improves the DV-Hop in a special situation to get the unknown nodes' initial positions and employs the Cube Radius scale to get the final position. The theoretical analysis shows this algorithm has low complexity. Compared with 3D-DV-Hop, the location accuracy and fraction of coverage of this algorithm were improved obviously.