Abstract
Self-stabilization is an attractive approach to tolerate transient faults such as link failures or new link creations due to nodes mobility in mobile ad hoc networks. Multicasting is an important communication service that allows the source node to efficiently transmit copies of data packet to a set of destination nodes. In this paper, a self-stabilizing distributed multicast algorithm is presented based on the computation of all-pairs shortest paths. Furthermore, the correctness proof is given. The cost of multicast tree constructed by the proposed approach is lower than that by the existing approach.