# US 2013/0155919 A1 · Method of potential routing, method of potential scheduling, and mesh node

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

- Number: US 2013/0155919 A1
- Document ID: US20130155919A1
- Status: Published application
- Kind: A1
- Application number: 13/407,881
- Filed: 2012-02-29
- Published: 2013-06-20
- Earliest claimed: 2011-12-20
- Assignees: Korea Basic Science Institute
- Inventors: Sangsu Jung
- Web page: https://patentgrep.com/patent/US20130155919A1

## CPC

- H04L 45/12: Shortest path evaluation
- H04W 40/18: based on predicted events
- H04W 40/20: based on geographic position or location
- H04W 72/12: Wireless traffic scheduling
- H04W 84/18: Self-organising networks, e.g. ad-hoc networks or sensor networks
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A method of potential routing, a method of potential scheduling, and a mesh node are provided. Here, the mesh node includes a potential routing unit that transmits a data packet to a preset routing path by calculating a multiple potential, wherein the multiple potential indicates each potential of all destination nodes including a plurality of mesh nodes; and a potential scheduler that schedules a packet transmission order using the multiple potential.

## Claims

### Claim 1

A method of potential routing of one of a plurality of mesh nodes that form a wireless ad-hoc mesh network, the method comprising:
calculating multiple potential, wherein the multiple potential indicates potential for each of all destination nodes comprising the plurality of mesh nodes; and
transmitting a data packet to a preset routing path using the multiple potential.

### Claim 2 (depends on 1)

The method of claim 1, wherein the calculating of multiple potential comprises applying a length and dynamic parameter of queue in a standby state for transmission when calculating the multiple potential, wherein the dynamic parameter represents potential sensitiveness according to a length change of queue in a standby state for transmission and the length of queue in a standby state for transmission is calculated through an applied function value.

### Claim 3 (depends on 2)

The method of claim 2, wherein the calculating of multiple potential comprises minimizing a value of the dynamic parameter when the length of queue in a standby state for transmission is a previously defined threshold value or less and increasing a value of the dynamic parameter in proportional to the length of queue in a standby state for transmission when the length of queue in a standby state for transmission exceeds a previously defined threshold value.

### Claim 4 (depends on 2)

The method of claim 2, wherein the calculating of multiple potential comprises
determining whether a previously defined potential calculation condition is satisfied;
generating, if a previously defined potential calculation condition is not satisfied, at least one virtual node until a triangle having a calculable potential value is formed within a transmission area; and
generating, if a previously defined potential calculation condition is satisfied or after generating at least one virtual node, the at least one virtual node and calculating the multiple potential.

### Claim 5 (depends on 2)

The method of claim 2, wherein the calculating of multiple potential comprises calculating the multiple potential through the following Equation.
φ
k
,
mn
d
=
∑
s
=
0
j
-
1

(
φ
k_nei
s

mn
d

r
→
k
,
k_nei
s
-
1

mn
d
-
φ
k_nei
s
-
1

mn
d

r
→
k
,
k_nei
s

mn
d
)
·
(
r
→
k
,
k_nei
s
-
1

mn
d
-
r
→
k
,
k_nei
s

mn
d
)
A
s
+
α

(
q
k
)
·
q
k
∑
s
=
0
j
-
1


r
→
k
,
k_nei
s
-
1

mn
d
-
r
→
k
,
k_nei
s

mn
d

2
A
s
φk,mnd is potential of a destination node mnd of a mesh node k, qk is a length of queue in a standby state for transmission in a mesh node k, φk—neis-1nmd is potential of an (s−1)st one-hop neighbor node node k_neismnd, φk—neismnd is potential of an sth one-hop neighbor node k_neismnd, {right arrow over (r)}k,k—neis 1mnd is distance information of an (s−1)st one-hop neighbor node k_neis-1mnd and a mesh node k, {right arrow over (r)}k,k—neismnd is distance information of an sth one-hop neighbor node k_neisnmd and a mesh node k_neismnd and a mesh node k, AS is an area of a triangle that is formed by an (s−1)st one-hop neighbor node k_neis-1mnd and an sth one-hop neighbor node k_neisnmd and a mesh node k, and α(qk) is a dynamic parameter representing sensitiveness of potential according to a change of a length qk of queue in a standby state for transmission in a mesh node k.

### Claim 6 (depends on 1)

The method of claim 1, further comprising receiving the multiple potential of each of the neighbor nodes from the neighbor nodes before the calculating of multiple potential,
the transmitting of a data packet comprises
selecting a neighbor node having a routing path having a relatively largest difference between potential of a specific destination node and potential of the neighbor nodes; and
transmitting the data packet to the selected neighbor node.

### Claim 7 (depends on 6)

The method of claim 6, wherein the selecting of a neighbor node comprises selecting the neighbor node through the following Equation.
arg


min
n
∈
N
k

φ

(
n
)
-
φ

(
k
)

r
→
n
-
r
→
k

wherein φ(n) is potential of a neighbor node n, φ(k) is potential of the one mesh node k, Nk is a plurality of mesh nodes constituting the wireless ad-hoc mesh network, {right arrow over (r)}n is a position of a neighbor node n, and {right arrow over (r)}k is a position of the one mesh node k.

### Claim 8 (depends on 6)

The method of claim 6, further comprising broadcasting a hello message in which the multiple potential is written to neighbor nodes after the calculating of multiple potential,
wherein the receiving of the multiple potential comprises receiving a hello message in which multiple potential of each of the neighbor nodes is recorded.

### Claim 9 (depends on 8)

The method of claim 8, wherein the hello message comprises the multiple potential and three-dimensional position information.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
forming a potential management table comprising a destination field, a potential field thereof, a potential field of a neighbor node, a position information field of a neighbor node, and a queue information field thereof; and
updating the multiple potential and potential and position information of a neighbor node that is acquired from the hello message to the potential management table.

### Claim 11

A method of potential scheduling of one of a plurality of mesh nodes that form a wireless ad-hoc mesh network, the method comprising:
calculating potential by a potential equation to which a dynamic parameter is applied, wherein the dynamic parameter represents potential sensitiveness according to a length change of queue in a standby state for transmission;
receiving potential of one-hop neighbor nodes that are calculated by the potential calculation equation;
calculating a difference between potential of the one mesh node and potential of one-hop neighbor node and a potential difference between the one-hop neighbor node and a neighbor node of the one-hop neighbor node; and
scheduling a packet transmission order based on the difference between potentials.

### Claim 12 (depends on 11)

The method of claim 11, wherein the scheduling of a packet transmission order comprises
aligning the differences between potentials; and
providing a channel access priority to a link having a largest difference between potentials.

### Claim 13 (depends on 11)

The method of claim 11, further comprising exchanging differences between potentials that are calculated at the calculating of a difference with neighbor nodes corresponding to the specific destination.

### Claim 14

A mesh node that forms a wireless ad-hoc mesh network, the mesh node comprising:
a potential routing unit that transmits a data packet to a preset routing path by calculating a multiple potential, wherein the multiple potential indicates each potential of all destination nodes comprising a plurality of mesh nodes; and
a potential scheduler that schedules a packet transmission order using the multiple potential.

### Claim 15 (depends on 14)

The mesh node of claim 14, wherein the potential routing unit applies a length and dynamic parameter of queue in a standby state for transmission when calculating the multiple potential, wherein the dynamic parameter represents potential sensitiveness according to a length change of queue in a standby state for transmission and the length of queue in a standby state for transmission is calculated through an applied function value.

### Claim 16 (depends on 15)

The mesh node of claim 15, wherein the potential routing unit minimizes a value of the dynamic parameter when the length of queue in a standby state for transmission is a previously defined threshold value or less and increases a value of the dynamic parameter in proportional to the length of queue in a standby state for transmission when the length of queue in a standby state for transmission exceeds a previously defined threshold value.

### Claim 17 (depends on 15)

The mesh node of claim 15, wherein the potential routing unit determines whether a previously defined potential calculation condition is satisfied; generates, if a previously defined potential calculation condition is not satisfied, at least one virtual node until a triangle having a calculable potential value is formed within a transmission area; and generates, if a previously defined potential calculation condition is satisfied or after generating at least one virtual node, the at least one virtual node and calculates the multiple potential.

### Claim 18 (depends on 15)

The mesh node of claim 15, wherein the potential routing unit receives the multiple potential of each of neighbor nodes from the neighbor nodes, selects a neighbor node having a routing path having a relatively largest difference between potential of a specific destination node and potential of the neighbor nodes, and transmits the data packet to the selected neighbor node.

### Claim 19 (depends on 15)

The mesh node of claim 15, wherein the potential routing unit broadcasts a hello message in which the multiple potential is recorded to neighbor nodes and receives a hello message in which multiple potential of each of the neighbor nodes is recorded.

### Claim 20 (depends on 19)

The mesh node of claim 19, wherein the potential routing unit forms a potential management table comprising a destination field, a potential field thereof, a potential field of a neighbor node, a position information field of a neighbor node, and a queue information field thereof and updates the calculated potential and information of a neighbor node that is acquired from a hello message to the potential management table.

### Claim 21 (depends on 14)

The mesh node of claim 14, wherein the potential scheduler schedules a packet transmission order by calculating a difference between potential that is calculated by a potential calculation equation to which the dynamic parameter is applied and potentials of one-hop neighbor nodes and a difference between potentials of the one-hop neighbor nodes and neighbor nodes of the one-hop neighbor nodes.

### Claim 22 (depends on 21)

The mesh node of claim 21, wherein the potential scheduler provides a channel access priority to a link having a largest difference between the potentials.

### Claim 23 (depends on 22)

The mesh node of claim 22, wherein the potential scheduler exchanges differences between potentials with neighbor nodes corresponding to a specific destination.