Wireless home network routing protocol
View Patent ↗Techniques for a node in a wireless network to process packets are disclosed. An example method includes registering with a network-management system in the network to become a node in the network, determining neighboring nodes, sending a link-state advertisement to the network-management system, the link-state packets providing its neighboring relationships, processing the packets using switching rules for a tree switching network portion of the network, the switching rules defining at least one of (1) an ingress link to a parent node and (2) egress links to child nodes, determining if a wireless link to a neighboring node has failed, and when a wireless link to a neighboring node has failed, informing a node at the end of an ingress wireless link and the network-management system of the failed link.
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;
sending a link-state advertisement to the network-management system, the link-state advertisement providing neighboring relationships of the node;
processing the packets using switching rules for a tree switching network portion of the network, the switching rules defining at least one of (1) an ingress link to a parent node with a power capability greater than the node and (2) egress links to child nodes with a mobility greater than the node, wherein the network-management system is not a part of the tree switching network portion;
determining if a wireless link to a neighboring node has failed; and
when a wireless link to a neighboring node has failed, informing a node at the end of an ingress wireless link and the network-management system of the failed link.
2. The method of claim 1 , further comprising receiving a tree structure for the tree switching network portion from the network-management system and constructing the switching rules from the tree structure.
3. The method of claim 1 , further comprising recording a route history, the route history comprising the switching rules and days and times when the switching rules are used.
4. The method of claim 3 , further comprising sending the route history to the network-management system.
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 one of sending a multicast of packets to the nodes in the group and receiving a multicast of packets from the nodes in the group.
7. The method of claim 1 , further comprising:
determining if a receive buffer is full; and
when the receive buffer is full, selecting packets by age and discarding the selected packets when they are not marked as important.
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;
sending a link-state advertisement to the network-management system, the link-state advertisement providing neighboring relationships of the node;
processing the packets using switching rules for a tree switching network portion of the network, the switching rules defining at least one of (1) an ingress link to a parent node with a power capability greater than the node and (2) egress links to child nodes with a mobility greater than the node, wherein the network-management system is not a part of the tree switching network portion;
determining if a wireless link to a neighboring node has failed; and
when a wireless link to a neighboring node has failed, informing a node at the end of an ingress wireless link and the network-management system of the failed link.
9. The medium of claim 8 , wherein the instructions further include receiving a tree structure for the tree switching network portion from the network-management system and constructing the switching rules from the tree structure.
10. The medium of claim 8 , wherein the instructions further include recording a route history, the route history comprising the switching rules and days and times when the switching rules are used.
11. The medium of claim 10 , wherein the instructions further include sending the route history to the network-management system.
12. The medium of claim 8 , wherein the instructions further include 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 include one of sending a multicast of packets to the nodes in the group and receiving a multicast of packets from the nodes in the group.
14. The medium of claim 8 , wherein the instructions further include:
determining if a receive buffer is full; and
when the receive buffer is full, selecting packets by age and discarding the selected packets when they are not marked as important.