Due to the strong mobility of nodes, higher requirements for multicast routing and multicast group partition were required.And the General Multicast Routing Protocol often failed to meet the requirements of the network.A distributed kernel stable routing algorithm based on ODMRP was proposed in this study. The algorithm combined the improved greedy mechanism and optimized the path according to the routing condition.In order to reduce the burden of data processing, a distributed kernel node selection mechanism was proposed. The information of multicast group was stored in multiple kernel nodes, and the storage space of forwarding nodes was also released. In this study, the routing repair mechanism was used to monitor the change of routing status and repair the broken routes in advance to ensure the validity of the path. The simulation shows that compared with the ODMRP algorithm and VCMP algorithm the algorithm can optimize the transmission path, reduce end-to-end delay, increase the rate of packet delivery and improve the performance of the network.