Wireless home network routing protocol

1. A method for a device to implement one of the nodes in a wireless network for processing packets, comprising:

submitting a request to a network-management system in the network to become a node in the network;

after having registered with the network-management system, determining neighboring nodes;

measuring costs of wireless links to its neighboring nodes;

measuring radio characteristic levels of the wireless links to its neighboring nodes;

sending a link-state advertisement to the network-management system, the link-state packets providing its neighboring relationships and the costs of the wireless links to its neighboring nodes;

receiving link weights from the network-management system;

computing a routing table for a link-state routing protocol based on (1) the sum of the link weights and the radio characteristic levels for the corresponding wireless links to its neighboring nodes, and (2) a topology of the network; and

processing the packets using the routing table.

2. The method of claim 1 , wherein the radio characteristic levels comprise fading levels.

3. The method of claim 1 , wherein the link-state routing protocol is selected from the group consisting of PEFT, DEFT, and OSPF.

4. The method of claim 1 , further comprising constructing the topology of the network, comprising:

constructing a mesh backbone network portion of the network from neighboring relationships of first tier nodes, the neighboring relationships of the first tier nodes being received from one of (1) the network management system and (2) link-state advertisements from the first tier nodes; and

receiving a tree switching network portion of the network comprising the second tier and the third tier nodes from one of (1) the network management system and (2) one of the second tier and the third tier nodes, wherein tier types are based on at least one of mobility and power supply of the nodes.

5. The method of claim 1 , further comprising:

submitting a request to the network-management system to join a group of a common interest and receive a membership list of the group.

6. The method of claim 5 , further comprising:

after having become a member of the group, wirelessly transmitting a first multicast of packets to the nodes in the group and wirelessly receiving a second multicast of packets from the nodes in the group.

7. The method of claim 1 , further comprising detecting a wireless link has failed and then repeating said sending a link-state advertisement, said receiving link weights, and said computing a routing table.

8. A non-transitory computer-readable storage medium encoded with computer-executable instructions for execution by a device to implement one of the nodes in a wireless network for processing packets, the instructions comprising:

submitting a request to a network-management system in the network to become a node in the network;

after having registered with the network-management system, determining neighboring nodes;

measuring costs of wireless links to its neighboring nodes;

measuring radio characteristic levels of the wireless links to its neighboring nodes;

sending a link-state advertisement to the network-management system, the link-state packets providing its neighboring relationships and the costs of the wireless links to its neighboring nodes;

receiving link weights from the network-management system;

computing a routing table for a link-state routing protocol based on (1) the sum of the link weights and the radio characteristic levels for the corresponding wireless links to its neighboring nodes, and (2) a topology of the network; and

processing the packets using the routing table.

9. The medium of claim 8 , wherein the radio characteristic levels comprise fading levels.

10. The medium of claim 8 , wherein the link-state routing protocol selected from the group consisting of PEFT, DEFT, and OSPF.

11. The medium of claim 8 , wherein the instructions further comprise constructing the topology of the network, comprising:

constructing a mesh backbone network portion of the network from neighboring relationships of first tier nodes, the neighboring relationships of the first tier nodes being received from one of (1) the network management system and (2) link-state advertisements from the first tier nodes; and

receiving a tree switching network portion of the network comprising the second tier and the third tier nodes from one of (1) the network management system and (2) one of the second tier and the third tier nodes, wherein tier types are based on at least one of mobility and power supply of the nodes.

12. The medium of claim 8 , wherein the instructions further comprising:

submitting a request to the network-management system to join a group of a common interest and receive a membership list of the group.

13. The medium of claim 12 , wherein the instructions further comprising:

after having become a member of the group, wirelessly transmitting a first multicast of packets to the nodes in the group and wireless receiving a second multicast of packets from the nodes in the group.

14. The medium of claim 8 , wherein the instructions further comprise detecting a wireless link has failed and then repeating said sending a link-state advertisement, said receiving link weights, and said computing a routing table.

15. A device configured to implement one of the nodes in a wireless network, the device comprising:

a processor; and

a memory system, wherein the processor is configured to

submit a request to a network-management system in the network to become a node in the network,

after having registered with the network-management system, determine neighboring nodes,

measure costs of wireless links to its neighboring nodes,

measure radio characteristic levels of the wireless links to its neighboring nodes,

send a link-state advertisement to the network-management system, the link-state packets providing its neighboring relationships and the costs of the wireless links to its neighboring nodes,

receive link weights from the network-management system,

compute a routing table for a link-state routing protocol based on (1) the sum of the link weights and the radio characteristic levels for the corresponding wireless links to its neighboring nodes, and (2) a topology of the network, and

process the packets using the routing table.

16. The device of claim 15 , wherein the radio characteristic levels comprise fading levels.

17. The device of claim 15 , wherein the link-state routing protocol is selected from the group consisting of PEFT, DEFT, and OSPF.

18. The device of claim 15 , wherein the processor is further configured to:

construct a mesh backbone network portion of the network from neighboring relationships of first tier nodes, the neighboring relationships of the first tier nodes being received from one of (1) the network management system and (2) link-state advertisements from the first tier nodes; and

receive a tree switching network portion of the network comprising the second tier and the third tier nodes from one of (1) the network management system and (2) one of the second tier and the third tier nodes, wherein tier types are based on at least one of mobility and power supply of the nodes.

19. The device of claim 15 , wherein the processor is further configured to submit a request to the network-management system to join a group of a common interest and receive a membership list of the group.

20. The device of claim 15 , wherein the processor is further to detect a wireless link has failed and then repeat sending the link-state advertisement, receiving the link weights, and computing the routing table.