Wireless home network routing protocol

US2016006649A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2016006649-A1
Application numberUS-201514855386-A
CountryUS
Kind codeA1
Filing dateSep 16, 2015
Priority dateJan 23, 2009
Publication dateJan 7, 2016
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

An example method for a device to implement one of the nodes in a wireless network for processing packets includes 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, flooding the wireless network with a link-state advertisement, the link-state advertisement providing neighboring relationships of the node, constructing switching rules for the node based on a tree switching network portion of the network, processing the packets received by the node with the switching rules, 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, and in response to having determined a failed link to a neighboring node, informing a node at the end of an ingress wireless link and the network-management system of the failed link.

First claim

Opening claim text (preview).

I claim: 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; flooding the wireless network with a link-state advertisement, the link-state advertisement providing neighboring relationships of the node; constructing switching rules for the node based on a tree switching network portion of the network; processing the packets received by the node with the switching rules, 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; and in response to having determined a failed link to a neighboring node, 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 first tree structure for the tree switching network portion from the network-management system. 3 . The method of claim 1 , further comprising forming a first tree structure for the tree switching network portion in a distributed manner. 4 . 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. 5 . The method of claim 4 , further comprising sending the route history to the network-management system. 6 . 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. 7 . The method of claim 6 , 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. 8 . The method of claim 1 , further comprising: in response to having determined a receive buffer being full, selecting packets by age and discarding the selected packets when they are not marked as important. 9 . The method of claim 2 , further comprising receiving a second tree structure for the tree switching network portion from the network-management system, wherein the second tree structure compensates for the failed link. 10 . The method of claim 3 , further comprising forming a second tree structure for the tree switching network portion in a distributed manner, wherein the second tree structure compensates for the failed link. 11 . A non-transitory computer-readable storage medium encoded with computer-executable instructions, which in response to execution by a device, causes the device to implement one of the nodes in a wireless network for processing packets according to a method 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; flooding the wireless network with a link-state advertisement, the link-state advertisement providing neighboring relationships of the node; constructing switching rules for the node based on a tree switching network portion of the network; processing the packets received by the node with the switching rules, 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; and in response to having determined a failed link to a neighboring node, informing a node at the end of an ingress wireless link and the network-management system of the failed link. 12 . The non-transitory computer-readable storage medium of claim 11 , wherein the method carried out by the device executing the instructions further comprises receiving a first tree structure for the tree switching network portion from the network-management system. 13 . The non-transitory computer-readable storage medium of claim 11 , wherein the method carried out by the device executing the instructions further comprises forming a first tree structure for the tree switching network portion in a distributed manner. 14 . The non-transitory computer-readable storage medium of claim 11 , wherein the method carried out by the device executing the instructions further comprises recording a route history, the route history comprising the switching rules and days and times when the switching rules are used. 15 . The non-transitory computer-readable storage medium of claim 14 , wherein the method carried out by the device executing the instructions further comprises sending the route history to the network-management system. 16 . The non-transitory computer-readable storage medium of claim 11 , wherein the method carried out by the device executing the instructions further comprises submitting a request to the network-management system to join a group of a common interest and receive a membership list of the group. 17 . The non-transitory computer-readable storage medium of claim 16 , wherein the method carried out by the device executing the instructions further comprises 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. 18 . The non-transitory computer-readable storage medium of claim 11 , wherein the method carried out by the device executing the instructions further comprises, in response to having determined a receive buffer being full, selecting packets by age and discarding the selected packets when they are not marked as important. 19 . The non-transitory computer-readable storage medium of claim 12 , wherein the method carried out by the device executing the instructions further comprises receiving a second tree structure for the tree switching network portion from the network-management system, wherein the second tree structure compensates for the failed link. 20 . The non-transitory computer-readable storage medium of claim 13 , wherein the method carried out by the device executing the instructions further comprises forming a second tree structure for the tree switching network portion in a distributed manner, wherein the second tree structure compensates for the failed link.

Assignees

Inventors

Classifications

  • Discovery or management of network topologies · CPC title

  • Distribution of signals within a home automation network, e.g. involving splitting/multiplexing signals to/from different paths (adaptations of television systems for transmission by electric cable for domestic distribution H04N7/106; hybrid transport H04L12/6418; home network arrangements specially adapted for distribution of digital video signals H04N7/24) · CPC title

  • Arrangements for maintaining operational condition · CPC title

  • Communication routing or communication path finding · CPC title

  • Switching of information between an external network and a home network (access arrangements H04L12/2856) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2016006649A1 cover?
An example method for a device to implement one of the nodes in a wireless network for processing packets includes 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, flooding the wireless network with a link-state advertisement, the link-state advertisement…
Who is the assignee on this patent?
Empire Technology Dev Llc
What technology area does this patent fall under?
Primary CPC classification H04L45/48. Mapped technology areas include Electricity.
When was this patent published?
Publication date Thu Jan 07 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).