# US 2021/0084675 A1 · High-performance wireless battery area network

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

- Number: US 2021/0084675 A1
- Document ID: US20210084675A1
- Status: Published application
- Kind: A1
- Application number: 16/574,969
- Filed: 2019-09-18
- Published: 2021-03-18
- Earliest claimed: 2019-09-18
- Assignees: Kabushiki Kaisha Toshiba
- Applicants: Kabushiki Kaisha Toshiba
- Inventors: Adnan AIJAZ; Aleksandar STANOEV
- Web page: https://patentgrep.com/patent/US20210084675A1

## CPC

- H04W 72/1273: of downlink data flows
- H04W 72/541: using the level of interference
- H04W 72/044: based on the type of the allocated resource
- H04J 3/1694: {Allocation of channels in TDM/TDMA networks, e.g. distributed multiplexers (Passive Optical Networks H04Q11/0062)}
- H04W 72/20: Control channels or signalling for resource management
- H04W 72/56: based on priority criteria
- H04W 84/18: Self-organising networks, e.g. ad-hoc networks or sensor networks
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)

## Abstract

A method of generating a communication schedule for a plurality of nodes in a multi-hop network, the plurality of nodes comprising a first node, a second node and a third node, wherein: the second node is a primary parent of the first node and the third node is a secondary parent of the first node. The method comprises requesting, by the first node, a first resource in the communication schedule for communication from the first node to the second node and a second resource in the communication schedule for communication from the first node to the third node. The method further comprises allocating, by at least one of the second or third node, a second set of resources in the communication schedule comprising a third resource in the communication schedule for communication from the first node to the second node and a fourth resource in the communication schedule for communication from the first node to the third node; wherein: at least the third resource does not generate a conflict in the communication schedule.

## Claims

### Claim 1

A method of generating a communication schedule for a plurality of nodes in a multi-hop network, the plurality of nodes comprising a first node, a second node and a third node, wherein: the second node is a primary parent of the first node and the third node is a secondary parent of the first node, the method comprising:
requesting, by the first node;
a first resource in the communication schedule for communication from the first node to the second node; and
a second resource in the communication schedule for communication from the first node to the third node; and
allocating, by at least one of the second or third node, a second set of resources in the communication schedule comprising:
a third resource in the communication schedule for communication from the first node to the second node; and
a fourth resource in the communication schedule for communication from the first node to the third node; wherein:
at least the third resource does not generate a conflict in the communication schedule.

### Claim 2 (depends on 1)

A method according to claim 1 wherein a resource is a timeslot on a frequency channel and the method further comprises:
determining, by at least one of the second or the third node, whether the first resource or the second resource generates a conflict in the communication schedule;
and if not;
assigning the third resource equal to the first resource; and
assigning the fourth resource equal to the second resource.

### Claim 3 (depends on 2)

A method according to claim 2 further comprising:
receiving by the first node, a downlink signalling message (DLS) comprising a relative transmission priority for each node that uses the second node as a primary parent; and
requesting, by the first node, the first resource and the second resource on a scheduling channel based on the relative transmission priority of the first node in the downlink signalling message (DLS).

### Claim 4 (depends on 3)

A method according to claim 3 wherein the downlink signalling message (DLS) further comprises a relative transmission priority for each node that uses the second node as a secondary parent.

### Claim 5 (depends on 1)

A method according to claim 1 wherein:
the first node requests the first resource and the second resource by transmitting a multi-packet request for uplink slots message (MP-RFS-U); and
the second set of resources is allocated by the second node.

### Claim 6 (depends on 5)

A method according to claim 5 wherein the third node is a primary parent of a fourth node and the method further comprises:
receiving, by the third node, from the fourth node, after receiving the request from the first node, a request for a fifth resource in the communication schedule; and
transmitting, by the third node a multi-packet assignment message (MP-ASG) comprising:
an indication of whether the second resource or the fifth resource generates a conflict in the communication schedule.

### Claim 7 (depends on 1)

A method according to claim 1 wherein the second set of resources is allocated by the second node and the third node, and the method further comprises:
requesting, by the first node, the first resource by transmitting a first Request-for-Slots (RFS) message to the second node; and
requesting, by the first node, the second resource by transmitting a second Request-for-Slots (RFS) message to the third node.

### Claim 8 (depends on 2)

A method according to claim 2 wherein a fifth node acts as the primary parent to the third node, and the method further comprises:
requesting, by the third node a plurality of resources in the communication schedule comprising:
a sixth resource for transmitting data generated by the third node; and
a number of resources equal to a number of nodes that associate the third node as a parent node.

### Claim 9 (depends on 2)

A method according to claim 2 further comprising:
determining, by the first node, whether an assignment message (ASG) has been received after requesting at least one of the first resource or the second resource; and if not:
requesting at least a seventh resource in the communication schedule, wherein the seventh resource is on a different frequency channel to the first or the second resource.

### Claim 10 (depends on 2)

A method according to claim 2 wherein the method further comprises:
requesting by the third node, a plurality of resources in the communication schedule comprising:
an eighth resource for transmitting data generated by the third node;
a resource for each node that associate the third node as a primary parent node; and
at least one resource for transmitting a combined message, wherein the combined message is formed by combining data received from a node that associates the third node as a primary parent and data received from a node that associates the third node as a secondary parent.

### Claim 11

A method of operating a network comprising a leak node and a plurality of nodes logically distributed between a first set of nodes and a second set of nodes, the method comprising:
communicating by the first set of nodes with a first controller node on a first frequency; and
communicating by the second set of nodes with a second controller node on a second frequency; wherein:
the first frequency is different from the second frequency; and
the first set of nodes and the second set of nodes communicate in parallel.

### Claim 12 (depends on 11)

A method according to claim 11 wherein:
the first set of nodes communicate with the first controller node on the first frequency according to a first uplink and downlink schedule;
the second set of nodes communicate with the second controller node on the second frequency according to a second uplink and downlink schedule; and the method further comprises:
the first set of nodes communicating with the second controller node on the second frequency according to a first redundant uplink and downlink schedule once the first uplink and downlink schedule is completed; and
the second set of nodes communicating with the first controller node on the first frequency according to a second redundant uplink and downlink schedule once the second uplink and downlink schedule is completed;

### Claim 13 (depends on 12)

A method according to claim 12 wherein a timeslot allocated to a node in the first/second redundant uplink and downlink schedule is determined by adjusting the timeslot allocated to the node in the first/second uplink and downlink schedule by a fixed offset.

### Claim 14 (depends on 13)

A method according to claim 13 wherein the first controller node is within communicative range of the second controller node and wherein the method further comprises:
generating a communication schedule by:
initiating, by the first controller node, construction of the first uplink and downlink schedule for the first set of nodes;
receiving, by the second controller node, communication between the first controller node and the first set of nodes;
allocating, by the second controller node, the first redundant uplink and downlink schedule for communication between the second controller node and the first set of nodes based on the first uplink and downlink schedule;
initiating, by the second controller node, construction of the second uplink and downlink schedule for the second set of nodes once construction of the first uplink and downlink schedule has been completed;
receiving, by the first controller node, communication between the second controller node and the second set of nodes; and
allocating, by the first controller node, the second redundant uplink and downlink schedule for communication between the first controller node and the second set of nodes based on the second uplink and downlink schedule.

### Claim 15 (depends on 13)

A method according to claim 13 further comprising:
receiving, by each node in the first/second set of nodes, a first downlink communication containing a message via the first/second downlink schedule and a second downlink communication containing the message via the first/second redundant downlink schedule; and
selecting, by each node, one of the first downlink communication or the second downlink communication for subsequent processing.

### Claim 16 (depends on 15)

A method according to claim 15 wherein each node selects the downlink communication with the strongest signal strength for subsequent processing.

### Claim 17 (depends on 12)

A method according to claim 12 further comprising:
requesting, by the leak node, a downlink signal strength report from a node in the plurality of nodes;
reporting, by the node, a signal strength of communications received from the first controller node and the second controller node; and
determining, by the leak node, whether to transmit in the first/second downlink schedule or the first/second redundant downlink schedule based on the signal strength.

### Claim 18 (depends on 12)

A method according to claim 12 wherein communicating with the first/second controller node comprises transmitting a message comprising data and an error correcting code.

### Claim 19 (depends on 12)

A method according to claim 12 wherein:
each node transmits:
a first uplink communication comprising data via the first/second uplink schedule; and
a second uplink communication comprising forward error correction via the first/second redundant uplink schedule; and the method further comprises:
decoding, by the leak node, the first uplink communication using the second uplink communication.

### Claim 20

A network comprising a leak node and a plurality of nodes logically distributed between a first set of nodes and a second set of nodes, the network configured so that:
the first set of nodes communicate with a first controller node on a first frequency; and
the second set of nodes communicate with a second controller node on a second frequency; wherein:
the first frequency is different from the second frequency; and
the first set of nodes and the second set of nodes communicate in parallel.
