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

A construction method and multicast technology, applied in broadcast service distribution, electrical components, wireless communication, etc., can solve problems affecting the correctness of routing updates, unreliable communication methods, high protocol overhead, etc., to reduce the cost of multicast communication Effect

Inactive Publication Date: 2011-05-25
青海西部矿业科技有限公司
View PDF2 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • MCDS (minimum connected dominating set)-based method for constructing delay limit multicast forwarding structure
  • MCDS (minimum connected dominating set)-based method for constructing delay limit multicast forwarding structure
  • MCDS (minimum connected dominating set)-based method for constructing delay limit multicast forwarding structure

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0058] The technical scheme of a construction method of an MCDS-based delay-bounded multicast forwarding structure of the present invention will be further described below in conjunction with the drawings and embodiments.

[0059] Such as figure 1 - Figure 4 Shown, the present invention a kind of construction method based on MCDS delay bounding multicast forwarding structure comprises the following steps:

[0060] 1. MIS election based on graph coloring

[0061] The source s knows the minimum delay path to all multicast destination nodes , to find all destination nodes to source s The destination node of the longest path in , starting from the node adjacent to the destination node on the path, determines an independent set node every two hops, if there are k longest paths, execute k times until all independent set nodes are found. The following two situations may be encountered during the determination of these independent set nodes:

[0062] 1) The later determine...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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 ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04W4/06H04W40/02
Inventor 林大泽张永德周贤伟黄秋香张鸣鲁李永芳彭莱
Owner 青海西部矿业科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products