MCDS (minimum connected dominating set)-based method for constructing delay limit multicast forwarding structure

Abstract

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.

Description

technical field [0001] The present invention relates to the technical field of wireless network communication, in particular to a MCDS-based delay demarcation multicast forwarding that relates to the dynamic adaptation of routing to mobile networks and the saving of energy and bandwidth resource consumption in wireless broadcast transmission in wireless networks method of constructing the structure. [0002] Background technique [0003] Ad Hoc network multicast forwarding structure is divided into three types: tree structure, mesh structure and hybrid structure. In the research on the multicast tree structure, it is generally believed that the bandwidth consumption of multicast is mainly reflected in the number of copies of information copied by nodes, that is, the total number of edges of the built multicast tree. To minimize the bandwidth of multicast consumption, it is necessary to minimize the number of edges of the multicast tree, that is, to minimize the number of ...

AI Technical Summary

Problems solved by technology

On the one hand, the broadcast storm brings high protocol overhead and the consequences of interference to ongoing communication; on the other hand, flooding is an unreliable communication method, and flooding will affect the selection of the shortest path in passive protocols. Or cannot find any path that should exist, which will cause the global information to be outdated in the a priori protocol, thus affecting the correctness of routing updates

Images