Granted Patent B2

US 12,192,859 · App. 17/690,798 · Granted Jan 7, 2025

Inventors: Qing An (Beijing, CN); Wenbing Chen (Hangzhou, CN)

Assignee: ALIBABA (CHINA) CO., LTD.

H04W4/12H04W4/80H04W88/04

Abstract

Claims (50)

1. A computer-implemented method, comprising:

obtaining relay-state information associated with a plurality of neighboring nodes of a respective node in a wireless network, which comprises receiving a relay-state message from a respective neighboring node, and wherein the relay-state message comprises address information, a relay-state indicator, and neighbor information associated with the respective neighboring node;

identifying, among the plurality of neighboring nodes, a set of relay neighbors capable of relaying messages based on the obtained relay-state information;

determining a connectivity status of the set of relay neighbors;

determining an expected relay state of the respective node based on a count and the connectivity status of the set of relay neighbors; and

adjusting a relay state of the respective node based on the expected relay state.

2. The method of claim 1 , further comprising:

in response to determining that the respective neighboring node is a relay neighbor based on the relay-state information, storing an entry corresponding to the respective neighboring node in a neighbor list maintained by the respective node; and

updating the entry in response to receiving a subsequent relay-state message from the respective neighboring node.

3. The method of claim 2 , wherein the entry comprises a timestamp associated with the relay-state message, and wherein the method further comprises:

in response to determining, based on the timestamp, that an entry in the neighbor list expires, deleting the expired entry; and

in response to determining, based on the timestamp, that an entry in the neighbor list needs to be updated, sending a state-request message to a corresponding neighboring node.

4. The method of claim 2 , wherein updating the entry comprises deleting the entry from the neighbor list in response to determining, based on the relay-state indicator included in the subsequent relay-state message, that the relay state of the respective neighboring node is “off”.

5. The method of claim 1 , wherein determining the expected relay state comprises:

determining that the expected relay state is “on,” in response to determining that the count of the set of relay neighbors equals or exceeds a predetermined neighbor threshold and that the set of relay neighbors are all relay neighbors of each other.

6. The method of claim 5 , further comprising:

in response to detecting a flooding event in the wireless network, decrementing the neighbor threshold.

7. The method of claim 1 , further comprising:

periodically sending relay-state messages; and

adjusting a period for sending the relay-state messages based on a number of previously sent relay-state messages.

8. The method of claim 1 ,

wherein determining the expected relay state comprises periodically executing a relay-decision operation, and

wherein a period for executing the relay-decision operation is adjusted based on a number of previously executed relay-decision operations.

9. The method of claim 1 , wherein adjusting the relay state comprises sending a relay-configuration message from a centralized controller to the respective node to instruct the respective node to adjust the relay state.

10. A computer system, comprising:

a processor; and

a storage device coupled to the processor and storing instructions, which when executed by the processor cause the processor to perform a method, the method comprising:

obtaining relay-state information associated with a plurality of neighboring nodes of a respective node in a wireless network, which comprises receiving a relay-state message from a respective neighboring node, and wherein the relay-state message comprises address information, a relay-state indicator, and neighbor information associated with the respective neighboring node;

identifying, among the plurality of neighboring nodes, a set of relay neighbors capable of relaying messages based on the obtained relay-state information;

determining a connectivity status of the set of relay neighbors;

determining an expected relay state of the respective node based on a count and the connectivity status of the set of relay neighbors; and

adjusting a relay state of the respective node based on the expected relay state.

11. The computer system of claim 10 , wherein the method further comprises:

in response to determining that the respective neighboring node is a relay neighbor based on the relay-state information, storing an entry corresponding to the respective neighboring node in a neighbor list associated with the respective node; and

updating the entry in response to receiving a subsequent relay-state message from the respective neighboring node.

12. The computer system of claim 11 , wherein the entry comprises a timestamp associated with the relay-state message, and wherein the method further comprises:

in response to determining, based on the timestamp, that an entry in the neighbor list expires, deleting the expired entry; and

in response to determining, based on the timestamp, that an entry in the neighbor list needs to be updated, sending a state-request message to a corresponding neighboring node.

13. The computer system of claim 11 , wherein updating the entry comprises deleting the entry from the neighbor list in response to determining, based on the relay-state indicator included in the subsequent relay-state message, that the relay state of the respective neighboring node is “off”.

14. The computer system of claim 10 , wherein determining the expected relay state comprises:

determining that the expected relay state is “on,” in response to determining that the count of the set of relay neighbors equals or exceeds a predetermined neighbor threshold and that the set of relay neighbors are all relay neighbors of each other.

15. The computer system of claim 14 , wherein the method further comprises:

in response to detecting a flooding event in the wireless network, decrementing the neighbor threshold.

16. The computer system of claim 10 , wherein the method further comprises:

periodically sending relay-state messages; and

adjusting a period for sending the relay-state messages based on a number of previously sent relay-state messages.

17. The computer system of claim 10 ,

wherein determining the expected relay state comprises periodically executing a relay-decision operation, and

wherein a period for executing a relay-decision operation is adjusted based on a number of previously executed relay-decision operations.

18. The computer system of claim 10 , wherein adjusting the relay state comprises sending a relay-configuration message from a centralized controller to the respective node to instruct the respective node to adjust the relay state.

Assignments (1)

Priority Claims (1)

Continuity (1)

References Cited (22)