A heuristic algorithm, DLHMA, was proposed, which was adapted to destination nodes joining the multicast tree dynamically. This algorithm was based on MPH algorithm. It added the destination node to the tree step by step based on satisfying the delay constraint and increasing the multicast tree cost least. At last, the validity was proven, the dynamic was analyzed, and the simulation was done. The results show that the new destination node can be added dy-namically and the cost of the multicast tree is low.