Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A routing update method

An update method and routing technology, applied in data exchange through path configuration, digital transmission system, electrical components, etc., can solve the problems of less control overhead, complicated routing update method, and large control overhead, so as to avoid update and save maintenance and update overhead, the effect of reducing costs

Inactive Publication Date: 2008-01-09
BEIHANG UNIV
View PDF0 Cites 35 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to overcome the problems of complex routing update method and large control overhead in existing wireless networks, and provide a routing update that is simple in calculation, less in control overhead, high in data transmission efficiency and reliability, and can adapt to dynamic changes in network topology method

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
  • A routing update method
  • A routing update method
  • A routing update method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0050] Fig. 2 is the flow chart of specific embodiment one of route update method of the present invention, is the method for its routing table update processing after the node monitors and newly-built link with a newly-increased neighbor node, specifically comprises the following steps:

[0051] Step 110, the node detects that a link is established with a newly added neighbor node;

[0052] Step 121, the node sends an inquiry packet to the newly added neighbor node, requiring the newly added neighbor node to send the identity number and the hop count to it, and then obtains the identity number and the hop count of the newly added neighbor node;

[0053] Step 122, the node recalculates its own hop count according to its own uplink routing table and the hop count of the newly added neighbor node;

[0054] Step 131, judging whether the recalculated hop count of the node is equal to the hop count of the newly-added neighbor node, if equal, the node and the newly-added neighbor no...

Embodiment 2

[0066] Fig. 3 is the flow chart of the specific implementation two of the routing update method of the present invention, which is a method for updating the routing table of this node after the node detects that it has disconnected the link with an original adjacent node, and specifically includes the following steps:

[0067] Step 210, the node detects that it is disconnected from an original neighbor node;

[0068] Step 220, the node calculates the new hop count of the node according to the hop count of the current neighboring node still connected, and updates the original hop count;

[0069] Step 231, judging whether the new hop count of the node is equal to the original hop count, if equal, execute step 232, if not equal, then the new hop count of the node is greater than the original hop count, the node is a lower layer node that disconnects adjacent nodes, execute Step 262;

[0070] Step 232, judging whether the new hop count of the node is equal to the hop count of the...

Embodiment 3

[0081] This embodiment is based on the technical solutions of Embodiment 1 and Embodiment 2. When the node in steps 160 and 262 is a lower layer node for adding or disconnecting a link, a processing method for updating its routing table. Fig. 4 is in the routing updating method of the present invention, after the node adds the link, it is used as the routing table processing flowchart of the lower node, namely above-mentioned step 160 specifically is:

[0082] A60, adding the identity number and the hop count of the newly added neighbor node to the upper node list of the node routing table;

[0083] A61. The node sends its identity number and hop count to its peer nodes and lower nodes, that is, the affected nodes;

[0084] A62, judging whether the node has received the identity number and hop count of the affected node, if yes, execute step A63, otherwise no affected node needs to be updated, and the update of this node ends;

[0085] A63, judge whether the hop count of this...

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 method comprises: after a node detects a variation of connection state happened in the link between network nodes, it recalculates its own hop numbers and compares its own hop numbers with the hop numbers of neighboring node in order to judge the hierarchical relation with the neighboring node; when the judging result is they are the nodes in same layer, said node updates the relevant node route table.

Description

technical field [0001] The invention relates to a routing updating method, in particular to a stable and efficient proactive routing updating method based on a tree structure wireless network. Background technique [0002] With the continuous development of wireless communication technology, a variety of wireless communication network technologies have been proposed and implemented in practical applications, such as mobile ad hoc "Ad Hoc" network (hereinafter referred to as MANET), wireless local area network (Wireless Local Area Network, hereinafter referred to as WLAN), wireless mesh network (WirelessMesh Net, hereinafter referred to as WMN), etc. [0003] MANET is a distributed wireless multi-hop network composed of many mobile nodes with routing functions. It does not depend on the preset infrastructure and is temporarily established. The mobile nodes in the network use their own wireless transceiver devices to exchange information. When within the communication range o...

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): H04L12/56H04L12/28H04L45/02
Inventor 张军刘凯李献昌施璇
Owner BEIHANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com