# US 2010/0165880 A1 · Methods for supporting rapid network topology changes with low overhead costs and devices of the same

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0165880 A1
- Document ID: US20100165880A1
- Status: Published application
- Kind: A1
- Application number: 12/581,113
- Filed: 2009-10-16
- Published: 2010-07-01
- Earliest claimed: 2008-10-17
- Assignees: Skyphy Networks Limited
- Inventors: Gang QIANG; Yang Zhang; Quan Chen; Xiao Ming Lan; Peng Li
- Web page: https://patentgrep.com/patent/US20100165880A1

## CPC

- H04W 40/20: based on geographic position or location
- H04L 45/123: {Evaluation of link metrics (techniques for monitoring network metrics H04L43/08)}
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present invention discloses a wireless communication method of supporting rapid changes in network topology. The present method may include broadcasting the first protocol message using the first broadcast cycle, the first protocol message being used for establishing a routing information between a node and destination node; and broadcasting the second protocol message using the second broadcast cycle, the second protocol message being used for establishing a link information between the node and a neighbor node, wherein the first broadcast cycle is different from the second broadcast cycle, and the first broadcast cycle is dynamically adjusted depending on a corresponding a detailed message contained in a plurality of segments in the first protocol message so as to reduce a number of broadcast of the first protocol message and the second protocol message.

## Claims

### Claim 1

A wireless communication method of supporting rapid changes in a network topology, said method comprising:
broadcasting a first protocol message with a first broadcast cycle, said first protocol message being used for establishing a routing information between a node and a destination node; and
broadcasting a second protocol message with a second broadcast cycle, said second protocol message being used for establishing a link information between said node and a neighbor node,
wherein said first broadcast cycle is different from said second broadcast cycle, and said first broadcast cycle is dynamically adjusted depending on a corresponding detailed message contained in a plurality of segments in said first protocol message so as to reduce a number of broadcast of said first protocol message.

### Claim 2 (depends on 1)

The communication method of claim 1, further comprising utilizing a cost value to determine whether to adjust said first broadcast cycle and said second broadcast cycle, wherein said coat value is calculated with a time parameter, and wherein said cost value of said first protocol message is said time parameter from said node to said destination node, and said cost value of said second protocol message is said time parameter from said node to said neighbor node.

### Claim 3 (depends on 2)

The communication method of claim 2, wherein said cost value is calculated by the following equation: a cost value=a current cost value+a configurable parameter*a new cost value, wherein said configurable parameter is a value between 0 and 1.

### Claim 4 (depends on 2)

The communication method of claim 2, wherein said time parameter is based on a wireless connection status, a network traffic, a packet size, a data transmission rate, or any combination thereof.

### Claim 5 (depends on 2)

The communication method of claim 2, further comprising manually setting a threshold so that when a change in said cost value exceeds said threshold, said first broadcast cycle and said second broadcast cycle are adjusted.

### Claim 6 (depends on 1)

The communication method of claim 1, further comprising setting a maximum hop so as to limit an area of neighbor nodes.

### Claim 7 (depends on 2)

The communication method of claim 2, further comprising determining whether to perform a freeze step or a switch step depending on said cost value so as to avoid a loop.

### Claim 8 (depends on 7)

The communication method of claim 7, wherein if a sub-optimum height exists, then perform said switch step, or else, perform said freeze step.

### Claim 9 (depends on 1)

The communication method of claim 1, further comprising dynamically adjusting said second broadcast cycle.

### Claim 10 (depends on 1)

The communication method of claim 1, wherein said corresponding detailed message include a query message, a reply message, an update message, or any combination thereof.

### Claim 11 (depends on 10)

The communication method of claim 10, wherein said query message and said reply message are broadcasted in a cycle shorter than a cycle for broadcasting said update message.

### Claim 12 (depends on 1)

The communication method of claim 1, wherein said second protocol message include a neighbor message.

### Claim 13 (depends on 1)

The communication method of claim 1, further comprising calculating a ramp value based on a cycle time provided by said second protocol message, said ramp value recording a number of packets lost in said second broadcast cycle, wherein when said ramp value exceeds a predetermined value, a link is considered not operational.

### Claim 14 (depends on 1)

The communication method of claim 1, wherein said first protocol message is a height beacon.

### Claim 15 (depends on 1)

The communication method of claim 1, wherein said second protocol message is a neighbor beacon.

### Claim 16 (depends on 1)

The communication method of claim 1, wherein said first protocol message is broadcasted in an event-driven manner.

### Claim 17 (depends on 2)

The communication method of claim 2, further comprising recording said cost value of said first protocol message and said cost value of said second protocol message in said routing information and said link information, respectively.

### Claim 18 (depends on 1)

The communication method of claim 1, wherein said routing information may be a route table, and said link information may be a neighbor route table.

### Claim 19 (depends on 1)

The communication method of claim 1, further comprising broadcasting different detailed messages depending on a status of a life cycle of a route.

### Claim 20 (depends on 6)

The communication method of claim 6, wherein said maximum hop is smaller than a sum of a hop to a source and a hop to a destination.

### Claim 21 (depends on 1)

A device for supporting a rapid change in a network topology, said device utilizing said communication method of claim 1.
