System and method for managing a list of entries containing routing information
First Claim
Patent Images
1. A method comprising:
- receiving, at a first network node, a beacon message from a second network node, wherein the beacon message includes an advertised cost of routing messages to a destination through the second network node;
measuring, based on receiving the beacon message, a signal quality associated with the beacon message;
determining, based on information included in the beacon message, whether the second network node is a next hop node of the first network node for routing messages to the destination;
based on determining that the second network node is a next hop node of the first network node for routing messages to the destination, selecting a candidate next hop list of entries corresponding to the destination;
determining whether the signal quality exceeds a threshold;
determining whether the second network node is present in the candidate next hop list;
based on determining that the signal quality exceeds the threshold and determining that the second network node is not present in the candidate next hop list, determining at least one of whether the candidate next hop list is empty and whether a timer is active; and
based on determining that at least one of the candidate next hop list is empty and the timer is active, adding to an entry in the candidate next hop list information from the beacon message, including at least one of an identifier of the second network node, a hop count from the second network node to the destination and a list of identifiers of nodes in a routing path from the second network node to the destination.
0 Assignments
0 Petitions
Accused Products
Abstract
A system and method adds and manages entries on a list of entries of routing information to allow the top entry to be used for routing to a destination corresponding to the list. Costs of a wireless link may be a function of the success rate experienced on that wireless link.
31 Citations
21 Claims
-
1. A method comprising:
-
receiving, at a first network node, a beacon message from a second network node, wherein the beacon message includes an advertised cost of routing messages to a destination through the second network node; measuring, based on receiving the beacon message, a signal quality associated with the beacon message; determining, based on information included in the beacon message, whether the second network node is a next hop node of the first network node for routing messages to the destination; based on determining that the second network node is a next hop node of the first network node for routing messages to the destination, selecting a candidate next hop list of entries corresponding to the destination; determining whether the signal quality exceeds a threshold; determining whether the second network node is present in the candidate next hop list; based on determining that the signal quality exceeds the threshold and determining that the second network node is not present in the candidate next hop list, determining at least one of whether the candidate next hop list is empty and whether a timer is active; and based on determining that at least one of the candidate next hop list is empty and the timer is active, adding to an entry in the candidate next hop list information from the beacon message, including at least one of an identifier of the second network node, a hop count from the second network node to the destination and a list of identifiers of nodes in a routing path from the second network node to the destination. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A method comprising:
-
sending, by a network node, a message to a first next hop node for routing to a destination, wherein the first next hop node is selected from a candidate next hop list associated with the destination; based on establishing that sending the message to the first next hop node for routing to the destination is an unsuccessful attempt, incrementing a first attempt counter associated with the first next hop node; based on determining that a value of the first attempt counter exceeds a predetermined threshold value, including an indication of the unsuccessful attempt in a first entry associated with the first next hop node in the candidate next hop list; selecting a second entry from the candidate next hop list; initializing a second attempt counter associated with the second entry; sending the message for routing to the destination to a second next hop node corresponding to the second entry; based on receiving an acknowledgement from the second next hop node indicating successful reception of the message, determining, using a value of the second attempt counter, a number of attempts for successfully sending the message to the second next hop node; computing a cost of routing messages to the destination using the second next hop node based on the determined number of attempts; and storing, in the second entry, the computed cost of routing messages to the destination using the second next hop node. - View Dependent Claims (12, 13)
-
-
14. A method comprising:
-
selecting, by a network node, a candidate next hop list associated with a destination stored at the network node; examining an entry in the candidate next hop list corresponding to a default next hop node for routing messages to the destination; based on information included in the entry corresponding to the default next hop node, determining a total cost of routing messages to the destination using the default next hop node, a hop count for the routing and a list of identifiers of a predetermined number of nodes in a path of routing messages using the default next hop node; computing an adjusted hop count by incrementing the hop count by one; forming an adjusted list of nodes for routing messages to the destination by adding an identifier of the default next hop node to the list of identifiers of the predetermined number of nodes; forming a beacon message by including in the beacon message the total cost, the adjusted hop count, the adjusted list of nodes and an identifier of the next node; and broadcasting the beacon message. - View Dependent Claims (15, 16)
-
-
17. A computer program product embodied in a computer-readable non-transitory medium including instructions executable by a processor and configured to cause the processor to perform operations comprising:
-
receiving, at a first network node, a beacon message from a second network node, wherein the beacon message includes an advertised cost of routing messages to a destination through the second network node; measuring, based on receiving the beacon message, a signal quality associated with the beacon message; determining, based on information included in the beacon message, whether the second network node is a next hop node of the first network node for routing messages to the destination; based on determining that the second network node is a next hop node of the first network node for routing messages to the destination, selecting a candidate next hop list of entries corresponding to the destination; determining whether the signal quality exceeds a threshold and whether the second network node is present in the candidate next hop list; based on determining that the signal quality exceeds a threshold and the second network node is not present in the candidate next hop list, determining at least one of whether the candidate next hop list is empty and whether a timer is active; and based on determining that at least one of the candidate next hop list is empty and the timer is active, adding to an entry in the candidate next hop list information from the beacon message, including at least one of an identifier of the second network node, a hop count from the second network node to the destination and a list of identifiers of nodes in a routing path from the second network node to the destination. - View Dependent Claims (18, 19, 20, 21)
-
Specification