The invention relates to a problem of minimizing the cost of a
multicast routing forwarding structure in an AdHoc network, and construction of a
delay limit
multicast forwarding structure in a
wireless network based on an MCDS (minimum
connected dominating set)
algorithm in a
graph theory. According to particularity of a
wireless signal transmission method, the cost and
delay function in the
wireless multicast routing are redefined. In the method for constructing the
delay limit multicast forwarding
structure based on the vertex coloring ideas in the
graph theory, which is proposed based on the MCDS theory in the
graph theory, by solving the MCDS, the purpose of constructing a multicast routing structure with the minimum cost is achieved, the concept of multicast routing delay limit is proposed, and the MCDS is constructed under the constraint. The
algorithm is proved to be correct by the theoretical derivation, and the
algorithm is proved to be effective by a lower approximate ratio compared with the similar algorithm. At the same time, the algorithm has a
time complexity of O(n) and a message complexity of O(n), thus the high efficiency of the algorithm is proved further; and the algorithm has the
advantage of adapting to flexible Adhoc networks.