MCDS approximation algorithm-based multicast route method with minimized resource consumption

A technology of resource consumption and approximate algorithm, applied in the directions of reducing energy consumption, energy-saving ICT, broadcast service distribution, etc., can solve problems affecting the correctness of routing updates, affecting the shortest path, and unreliability, so as to reduce network resource consumption and optimize The effect of resource consumption

Active Publication Date: 2009-10-21
WESTERN MINING CO LTD
View PDF0 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In the passive protocol, the unreliability of flooding will affect the selection of the shortest path, or cannot find any path that

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 approximation algorithm-based multicast route method with minimized resource consumption
  • MCDS approximation algorithm-based multicast route method with minimized resource consumption
  • MCDS approximation algorithm-based multicast route method with minimized resource consumption

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0061] The MCCDS-MA algorithm of the present invention applies the idea of ​​constructing CDS to construct a multicast tree, and the obtained non-leaf nodes of the dominant tree are the nodes in the CDS node set.

[0062] Method steps:

[0063] (1) Construct MIS

[0064] Node 0 first identifies itself as black, and then broadcasts a BLACK message. Nodes 4, 5, and 8 identify themselves as gray, and then they broadcast a GRAY message respectively. The y value of node 10 is 1, so the GRAY message sent by node 8 is received Then identify itself as black, and then broadcast BALCK message; nodes 9, 12, 14, and 16 identify themselves as gray, and they broadcast GRAY messages respectively, and the y values ​​​​of nodes 2, 11, and 15 are reduced to 0, and they identify themselves as black; They broadcast BALCK messages, and nodes 1, 3, 6, and 7 identify themselves as gray. All black nodes are MIS node sets

[0065] (2) Construct the dominator tree

[0066] Node 0 broadcasts the CON...

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 belongs to a route optimization technique in wireless network communication, relates to the problem of saving energy and bandwidth resource consumption of the wireless broadcast transmission in a wireless network, and provides a construction method for a distributive multicast tree with minimized network communication resource consumption based on the problem of MCDS (minimum connected dominating set) in a graph theory. Based on the established multicast tree, the MCDS approximation algorithm-based multicast route method with minimized resource consumption finds a maximum independent set MIS, and then finds all MIS nodes connected with of a dominating node set so as to obtain a dominating multicast tree. The method optimizes the resource consumption of the multicast communication in the communication network. Due to the broadcasting nature of a wireless medium, the bandwidth and energy consumption in the multicast communication mainly depends on the message relay times in the multicast tree. Therefore, the method achieves the aim of reducing the network resource consumption through the reduction of the number of the nodes undertaking the relay mission in the multicast tree.

Description

technical field [0001] The invention belongs to the routing optimization technology in wireless network communication, and relates to the problem of saving the energy and bandwidth resource consumption of wireless broadcast transmission in the wireless network. Based on the MCDS (minimum connected dominating set) problem in graph theory, a method of minimizing A method for constructing a distributed multicast tree for network communication resource consumption. Background technique [0002] The wireless Ad hoc network is composed of some mobile nodes, these nodes are directly connected through the wireless link between them or connected through a series of multi-hop links of intermediate nodes. The establishment of the network does not require pre-established infrastructure and centralized control of central control nodes. Some special properties of Ad hoc networks require the support of special algorithms and protocols, and its characteristics include dynamic topology, mul...

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/06H04W8/08H04W40/04H04W84/18
CPCY02B60/50Y02D30/70
Inventor 林大泽周贤伟张永德彭莱吴敏李永芳汪林
Owner WESTERN MINING CO LTD
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap