Dynamic broadcast routing method

A routing and dynamic technology, applied in the direction of data exchange, digital transmission systems, electrical components, etc. through path configuration

Active Publication Date: 2011-10-12
上海寰创通信科技股份有限公司
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The present invention aims to solve the problems caused by broadcast routing in Ad hoc and similar network systems, thereby effectively reducing the impact of broadcast storms on the normal operation of the network
[0009] In order to effectively solve the problems of broadcast storms and routing self-loops, the present invention adopts the method of dynamically generating extended trees in the network

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
  • Dynamic broadcast routing method
  • Dynamic broadcast routing method
  • Dynamic broadcast routing method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0047] The method of the present invention will be further described below in conjunction with the accompanying drawings.

[0048] Figure 4 Take the wireless ad-hoc network composed of four network nodes A, B, C, and D as an example, assuming that the neighbor relationship is as follows:

[0049] ●B is a neighbor node of A

[0050] ●C and D are neighbor nodes of B

[0051] ●B and D are neighbor nodes of C

[0052] ●B and C are neighbor nodes of D

[0053] Set node A as the root node of a broadcast tree, set its hop count to 0, and set its cost value to the maximum, and flood call packets to nodes B, C, and D in the network; because node B goes to root node A The number of hops is the smallest and the cost is the largest. Set node B as the parent node of nodes C and D, and nodes C and D declare the hops and cost values ​​to parent node B and root node A in the call message.

[0054]1) Network node B receives the broadcast message from parent node A, because nodes C and D ...

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 present invention discloses a route diffusion method for dynamically generating expansion tree in the network, specifically suitable for the scene of broadcast routing in an Ad hoc Network or a Wireless Mesh Network. The invention takes route cost and hop together as criterion to select an optimum route, and every node in the network uses the flooding of the call packet to establish, update and delete the corresponding node in the broadcast tree. The method includes: broadcast tree generation, wherein, network nodes select and determine father nodes according to the hop of packets for reaching interactive root nodes; broadcast tree updating, in the broadcast tree updating process, according to the setting triggering criterion, when reaching the corresponding triggering condition, the broadcast tree updates according to the broadcast tree updating method; and broadcast packet transmit-receive. The route diffusion method for dynamically generating expansion tree in the network adopted by the invention can realize the effective spreading of the broadcast packet, and effectively inhibit the generation of broadcast storm and routing self-loop; the method has relative simple and practical protocol, application in micro scale networking, and fast network convergence rate.

Description

technical field [0001] The invention relates to a method for performing broadcast routing in a routing network. It is especially suitable for broadcast routing scenarios in an Adhoc (full name in English, Ad hoc Network, hereinafter referred to as Ad hoc) or MESH (full name in English, WirelessMesh Network, hereinafter referred to as MESH) network. Background technique [0002] Ad hoc is a mobile, multi-hop, self-healing network system. Each network node in the network can determine its different roles in the network through certain criteria (such as transmit power, battery remaining information, etc.), so as to realize the function of routing and forwarding under the premise of normal communication. [0003] Since the nodes in the Ad hoc network have mobile characteristics and do not depend on fixed network equipment, their physical locations are not fixed, and their routing relationships are not fixed. In order to enable normal communication between nodes, a certain routi...

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
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/56H04L12/28H04W40/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

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