System and method for accepting information from routing messages into a list

1. A method, comprising:

storing, at a computing device in a network, data indicative of a set of next hop candidate nodes and path costs associated with the next hop candidate nodes;

receiving, at the computing device, a beacon message from a beacon originator, wherein the beacon message identifies the beacon originator, a path cost associated with a network path between the beacon originator and a destination node, and one or more nodes along the network path;

determining, by the computing device, that the set of next hop candidate nodes is full and that the beacon originator is not in the set of next hop candidate nodes based on the beacon message; and

in response to determining that the set of next hop candidate nodes is full:

determining, by the computing device, a total cost associated with the beacon originator based on the path cost associated with the network path and on a signal quality of the received beacon message,

comparing the total cost associated with the beacon originator with a stored path cost associated with a last entry of the set of next hop candidate nodes, and

replacing, by the computing device, the last entry in the stored set of next hop candidate nodes with the beacon originator when the total cost associated with the beacon originator is less than the stored path cost associated with the last entry.

2. The method as in claim 1 , wherein the stored path cost associated with the particular next hop candidate node is greater than the stored path costs associated with the other nodes in the set.

3. The method as in claim 1 , wherein the total cost associated with the beacon originator is calculated in response to determining that the signal quality of the received beacon message is below a threshold value.

4. The method as in claim 1 , further comprising:

determining, by the computing device, that the beacon originator is a next hop node of the computing device by determining that the computing device does not correspond to any of the one or more nodes along the network path identified by the beacon message.

5. The method as in claim 1 , wherein determining that the beacon originator is a next hop node of the computing device further comprises:

determining, by the computing device, that a hop count included in the beacon message and associated with the network path is less than or equal to a hop count between the computing device and the destination node.

6. The method as in claim 1 , further comprising:

sorting, by the computing device, the set of next hop candidate nodes based on their associated path costs.

7. The method as in claim 1 , further comprising:

probing, by the computing device, a network link between the computing device and the particular next hop candidate node to determine the path cost associated with the particular next hop candidate node.

8. The method as in claim 1 , wherein the path cost associated with the particular next hop candidate node is based in part on a ratio of successful communications between the computing device and the particular next hop candidate node.

9. An apparatus, comprising:

a wireless transceiver to communicate with a network;

a processor coupled to the network interfaces and configured to execute one or more processes; and

a memory configured to store a process executable by the processor, the process when executed operable to:

store data indicative of a set of next hop candidate nodes and path costs associated with the next hop candidate nodes;

receive a beacon message from a beacon originator via the wireless transceiver, wherein the beacon message identifies the beacon originator, a path cost associated with a network path between the beacon originator and a destination node, and one or more nodes along the network path;

determine that the set of next hop candidate nodes is full and that the beacon originator is not in the set of next hop candidate nodes based on the beacon message; and

in response to a determination that the set of next hop candidate nodes is full:

determine a total cost associated with the beacon originator based on the path cost associated with the network path and on a signal quality of the received beacon message,

compare the total cost associated with the beacon originator with a stored path cost associated with a last entry of the set of next hop candidate nodes, and

replace the last entry in the stored set of next hop candidate nodes with the beacon originator when the total cost associated with the beacon originator is less than the stored path cost associated with the last entry.

10. The apparatus as in claim 9 , wherein the stored path cost associated with the particular next hop candidate node is greater than the stored path costs associated with the other nodes in the set.

11. The apparatus as in claim 9 , wherein the total cost associated with the beacon originator is calculated in response to determining that the signal quality of the received beacon message is below a threshold value.

12. The apparatus as in claim 9 , wherein the process when executed is further operable to:

determine that the beacon originator is a next hop node of the apparatus by determining that the apparatus does not correspond to any of the one or more nodes along the network path identified by the beacon message.

13. The apparatus as in claim 9 , wherein the beacon originator is determined to be a next hop node of the apparatus by:

determining that a hop count included in the beacon message and associated with the network path is less than or equal to a hop count between the apparatus and the destination node.

14. The apparatus as in claim 9 , wherein the process when executed is further operable to:

sort the set of next hop candidate nodes based on their associated path costs.

15. The apparatus as in claim 9 , wherein the process when executed is further operable to:

probe a network link between the apparatus and the particular next hop candidate node to determine the path cost associated with the particular next hop candidate node.

16. The apparatus as in claim 9 , wherein the path cost associated with the particular next hop candidate node is based in part on a ratio of successful communications between the apparatus and the particular next hop candidate node.

17. A tangible, non-transitory, computer-readable media having software encoded thereon, the software when executed by a processor operable to:

store data indicative of a set of next hop candidate nodes and path costs associated with the next hop candidate nodes;

receive a beacon message from a beacon originator via a wireless transceiver, wherein the beacon message identifies the beacon originator, a path cost associated with a network path between the beacon originator and a destination node, and one or more nodes along the network path;

determine that the set of next hop candidate nodes is full and that the beacon originator is not in the set of next hop candidate nodes based on the beacon message; and

in response to a determination that the set of next hop candidate nodes is full:

determine a total cost associated with the beacon originator based on the path cost associated with the network path and on a signal quality of the received beacon message,

compare the total cost associated with the beacon originator with a stored path cost associated with a last entry of the set of next hop candidate nodes, and

replace the last entry in the stored set of next hop candidate nodes with the beacon originator when the total cost associated with the beacon originator is less than the stored path cost associated with the last entry.

18. The computer-readable media of claim 17 , wherein the stored path cost associated with the particular next hop candidate node is greater than the stored path costs associated with the other nodes in the set.

19. The computer-readable media of claim 17 , wherein the total cost associated with the beacon originator is calculated in response to determining that the signal quality of the received beacon message is below a threshold value.

20. The computer-readable media of claim 17 , wherein the software when executed by the processor is further operable to:

determine that the beacon originator is a next hop node of the apparatus by determining that the apparatus does not correspond to any of the one or more nodes along the network path identified by the beacon message.