# US 2010/0246550 A1 · High performance wireless networks using distributed control and switch-stack paradigm

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0246550 A1
- Document ID: US20100246550A1
- Status: Published application
- Kind: A1
- Application number: 12/748,173
- Filed: 2010-03-26
- Published: 2010-09-30
- Earliest claimed: 2002-10-28
- Assignees: Mesh Dynamics, Inc.
- Inventors: Francis daCosta; Sriram Dayanandan
- Web page: https://patentgrep.com/patent/US20100246550A1

## CPC

- H04W 40/02: Communication route or path selection, e.g. power-based or shortest path routing
- H04L 41/0806: for initial configuration or provisioning, e.g. plug-and-play
- H04L 43/0811: by checking connectivity
- H04W 12/50: Secure pairing of devices
- H04W 28/18: Negotiating wireless communication parameters
- H04L 41/0654: using network fault recovery (ring fault isolation or reconfiguration in loop networks without recovery actions by a network management system H04L12/437)
- H04L 41/5022: by giving priorities, e.g. assigning classes of service
- H04L 41/5087: {wherein the managed service relates to voice services (management of VoIP services H04M7/0081)}
- H04L 41/509: {wherein the managed service relates to media content delivery, e.g. audio, video or TV}
- H04W 16/14: Spectrum sharing arrangements {between different networks}
- H04W 84/12: WLAN [Wireless Local Area Networks]
- H04W 88/08: Access point devices
- H04W 88/14: Backbone network devices
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A design and proof of concept of a new type of WLAN, complete with simulation and results from the simulation has been described. Each AP Node is implemented as a self-contained embedded OS unit, with all algorithms resident in its Operating system. The normal day-to-day functioning of the AP node is based entirely on resident control algorithms. Upgrades are possible through a simple secure communications interface supported by the OS kernel for each AP node. Benefits provided by a wireless network, as proposed in this invention, are that: it installs out of the box; the network is self-configuring; the network is redundant in that mesh network formalism is supported, ensuring multiple paths; load balancing is supported; there is no single point of failure; allows for decentralized execution; there is a central control; it is network application aware; there is application awareness; there is automatic channel allocation to manage and curtail RF interference, maximize non interference bandwidth and enable seamless roaming between adjoining wireless sub networks (BSS) and it supports the wireless equivalent for switching—for seamless roaming requirements.

## Claims

### Claim 1

A node-based mesh network comprising:
one or more root nodes in communication with an external network;
remaining nodes arranged in a hierarchy wherein each node other than a root node has a single parent node and zero or more child nodes;
wherein each parent node further comprises means for tracking child nodes in communication with each parent node; wherein each node comprises a means for tracking its parent node; wherein for every parent node having at least one child node, said at least one child node's children and any children of these child nodes are descendant nodes of said parent node wherein each parent node further comprises means for tracking all descendant nodes in communication with each parent node;
wherein data communications between nodes identifies a destination node of data sent from said external network or a source node; and
wherein each child node communicates with its respective parent node and upon receiving data from a child node, that child node's parent node sends the data along a route path toward a destination node.

### Claim 2 (depends on 1)

The node-based mesh network of claim 1 wherein each parent node further comprises a means to generate a route path for data received from a child.

### Claim 3 (depends on 2)

The node-based mesh network of claim 2 wherein the parent node routing means sends the data to the destination node having first selected the destination node on the basis of the destination of the data per three possibilities, wherein in a first possibility the destination of the data is a child or descendant node of the parent node therefore the destination is a child node of the parent node wherein said child is on a route path ending in said destination, wherein in a second possibility the destination of the data is the parent therefore the date is processed by the parent node, wherein neither is true, the destination is a parent node of the parent node.

### Claim 4 (depends on 1)

The node-based mesh network of claim 1 wherein communications from a parent node to a child node occur using wireless communications employing a first RF channel and a first radio contained in said parent node; and
wherein communications from said parent node to its parent node occur using wireless communications employing a second RF channel and a second radio contained in said parent node.

### Claim 5 (depends on 1)

The node-based network of claim 1 wherein two child nodes in wireless communication with each other exchange data independently of the shared parent node.

### Claim 6 (depends on 1)

The node-based network of claim 1 wherein each parent node excludes route path information about nodes other than its descendant nodes and its immediate parent node.

### Claim 7 (depends on 2)

The node-based network of claim 2 wherein the route path is updated in a node upon reconfiguration of the node-based network.

### Claim 8 (depends on 1)

The node-based network of claim 1 wherein each node further comprises a client-communication radio to exchange data with one or more client devices in wireless communication with the node.

### Claim 9 (depends on 1)

The node-based network of claim 1 wherein the network further comprises an access server wherein the access server communicates one or more operational constraints to network nodes.

### Claim 10

A method of routing voice and data traffic within a hierarchical node-based mesh network comprising:
storing data as individual data packets;
including in each data packet a destination node of the data packet;
sending the data from the data packet's source node to the source node's parent node;
processing the data by the parent node;
identifying the destination node of the data;
sending the data from the parent node toward the destination node.

### Claim 11 (depends on 10)

The method of routing data of claim 10 further comprising selecting the destination node on the basis of the destination information contained in the data packet.

### Claim 12 (depends on 11)

The method of routing data of claim 11 wherein the destination is selected by said parent node to be a destination child node if the destination information identifies the destination child node or if the destination information identifies the destination as a descendant of said child node; wherein the destination is selected to be the parent node if the destination information identifies the parent node; and wherein the destination is selected to be the parent node's parent otherwise.

### Claim 13 (depends on 12)

The method of routing data of claim 12 further comprising sending data from the parent node to its parent node on a first wireless frequency and a first wireless radio.

### Claim 14 (depends on 13)

The method of routing data of claim 13 further comprising sending data from the parent node to its child node on a second wireless frequency and a second wireless radio.

### Claim 15 (depends on 10)

The method of routing data of claim 10 further comprising a node communicating with one or more client devices in wireless communication with the node.

### Claim 16 (depends on 10)

The method of routing data of claim 10 wherein each node maintains a counter of child nodes in communication with the node; and the node maintains an identification of its parent node.

### Claim 17 (depends on 16)

The method of routing data of claim 16 wherein a subset of nodes further comprise a connection to an external network.

### Claim 18 (depends on 17)

The method of routing data of claim 17 wherein the external network comprises an Ethernet link.

### Claim 19

A method of routing voice and data traffic within a hierarchical node-based mesh network comprising:
storing data as individual data packets;
including in each data packet a destination node of the data packet;
receiving a data packet at a network node, wherein each network node has only one parent node, and said packet originates at said single parent of said network node;
determining if the packet destination is the network node itself or a descendant of the network node;
if the destination is the network node itself, processing the packet by said node;
if the destination is a child of said network node, sending the packet to the child node for processing by said child node; and
if the destination is a descendant of a child node of said network node, sending the packet to the child node that has the destination node as its descendant.

### Claim 20

A method of routing voice and data traffic within a hierarchical node-based mesh network wherein each node has only one parent node, comprising:
storing data as individual data packets;
including in each data packet a destination node of the data packet;
receiving at a node a packet from a child node of said node;
determining if the packet destination is the node itself or a descendant of the node;
if the destination is the node itself, processing the packet by said node;
if the destination is a descendant of said node, sending the packet to the child node that is either the destination or has the destination node as its descendant; and
if the destination node is neither the node itself nor a descendant of said node, sending the packet to the parent of said node.
