Simple mesh network for wireless transceivers

Patent metadata

Field	Value
Publication number	US-9742578-B2
Application number	US-201414582401-A
Country	US
Kind code	B2
Filing date	Dec 24, 2014
Priority date	Dec 24, 2014
Publication date	Aug 22, 2017
Grant date	Aug 22, 2017

Abstract

A method of operating a node of a network is disclosed. The method includes receiving a data frame having a header with plural addresses. The node determines if a first address of the plural addresses is an address of a descendant of the node and if a second address of the plural addresses is a parent address of the node. If so, the node changes a second address of the plural addresses to its own address in response to the step of determining. The node then transmits the data frame to at least one descendant of the node.

First claim

What is claimed is:

1. A method of operating a node of a network, comprising the steps of:
receiving a data frame having a header with plural sequential addresses;
determining if a second sequential address of the plural addresses is an address of a parent of the node;
changing the second sequential address to an address of the node in response to the step of determining;
transmitting the data frame to at least one descendant of the node;
setting a recipient address of an acknowledgement frame to an address of the parent of the node; and
transmitting the acknowledgement frame to the parent of the node.

2. A method as in claim 1 , comprising determining if a first sequential address of the plural addresses is an address of the node.

3. A method as in claim 1 , comprising determining if a first sequential address of the plural addresses is an address of a descendant node.

4. A method as in claim 1 , wherein the node only acknowledges receipt of a data frame from its immediate parent.

5. A method as in claim 1 , wherein the step of receiving comprises receiving a downlink frame.

6. A method as in claim 5 , wherein the downlink frame is encrypted, and wherein a final destination node decrypts the downlink frame with an access point (AP) address.

7. A method of operating a node of a network, comprising the steps of:
receiving a data frame having a header with plural sequential addresses;
determining if a first sequential address of the plural addresses is an address of the node;
changing the first sequential address to an address of a parent of the node in response to the step of determining;
transmitting the data frame to the parent of the nod;
setting a recipient address of an acknowledgement frame to an address of a descendant of the node; and
transmitting the acknowledgement frame to the descendant of the node.

8. A method as in claim 7 , comprising determining if a second sequential address of the plural addresses is a descendant of the node.

9. A method as in claim 8 , comprising registering a new descendant if the second sequential address is not an address of a descendant of the node.

10. A method as in claim 7 , wherein the acknowledgement frame includes depth bits to indicate the depth of the node.

11. A method as in claim 7 , wherein the step of receiving comprises receiving an uplink frame.

12. A method as in claim 11 , wherein the uplink frame is encrypted with an access point (AP) address as a basic service set identification (BSSID) input for encryption.

13. A method of operating a node of a network, comprising the steps of:
receiving a data frame having a header with plural addresses;
determining if the frame is in the node's basic service set;
determining if a receive address (RA) of the frame is a descendant of the node;
changing a transmit address (TA) of the frame to an address of the node in response to the step of determining if a receive address (RA) of the frame is a descendent of the node;
transmitting the data frame;
determining if a receive address (RA) is an address of the node;
changing RA to a transmit address (TA) of an acknowledgement frame in response to the step of determining if a receive address (RA) is an address of the node; and
transmitting the acknowledgement frame to the parent of the node.

14. A method as in claim 13 , comprising:
determining that the data frame is a multicast frame; and
transmitting the multicast frame.

15. A method as in claim 13 , comprising:
determining if RA is a descendant of the node;
changing a transmit address (TA) of the data frame to an address of the node in response to the step of determining if RA is a descendant of the node; and
transmitting the data frame to at least one descendant of the node.

16. A method as in claim 13 , wherein the data frame is one of a unicast and a multicast data frame.

17. A method as in claim 13 , comprising:
receiving an uplink (UL) data frame having a header with plural addresses;
determining if the UL frame is in the node's basic service set;
changing a basic service set identification of the UL frame to an address of a parent of the node; and
transmitting the UL frame to the parent of the node.

Assignees

• Texas Instruments Inc

Inventors

• Ben-Yehezkel Yoav
• Baum Avraham
• Tzoreff Yaniv

Classifications

• H04W72/20

  Control channels or signalling for resource management · CPC title

• H04W72/30

  Resource management for broadcast services · CPC title

• H04L69/22

  Parsing or analysis of headers · CPC title

• H04W72/0446

  Resources in time domain, e.g. slots or frames · CPC title

• H04W8/26

  Network addressing or numbering for mobility support · CPC title