METHOD FOR SCHEDULING CLOSED LOOP INFORMATION IN WIRELESS NETWORKS

• US 20180302908A1
• Filed: 04/13/2017
• Published: 10/18/2018
• Est. Priority Date: 04/13/2017
• Status: Active Grant

• Current Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Original Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Inventors: AIJAZ, Adnan
• Granted Patent: US 10,349,427 B2
• Time in Patent Office: Days
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04W 40/02 Communication route or path selection, e.g. power-based or shortest path routing
• CPC Class Codes: H04W 40/12 based on transmission quality or channel quality
• CPC Class Codes: H04W 40/22 using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
• CPC Class Codes: H04W 40/244 using a network of reference devices, e.g. beaconing
• CPC Class Codes: H04W 72/0446 Resources in time domain, e.g. slots or frames
• CPC Class Codes: H04W 72/12 Wireless traffic scheduling
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

Arrangements described herein provide a distributed means of scheduling communications originating from a control node to nodes in a multi-hop wireless network. By listening for other messages assigning schedules to other nodes, each node is able to create its own local record of scheduled transmissions in its area. This allows each node to determine a preliminary schedule. Having said this, the parent node of the node will have additional information regarding the scheduled local transmissions. Accordingly, the node sends the preliminary schedule to its parent node for confirmation that it provides no collisions/conflicts with other scheduled transmissions. As the parent node is involved in the scheduling of each child node, it is better able to determine whether the child nodes are proposing schedules that may conflict with each other.

Claims

1. A method for determining a transmission schedule for one or more transmissions from a first node to a first set of one or more child nodes in a multi-hop wireless network, wherein each node is a child node to a corresponding parent node, each child node being configured to receive messages originating from a sink node via its corresponding parent node and wherein the method comprises a parent node of the first node:

listening for signals indicating scheduled timeslots for transmission between nodes in the network and, if a signal is detected, updating a record of scheduled transmissions;

receiving from the first node a preliminary schedule specifying one or more timeslots for transmission to each of the first set of one or more child nodes;

determining, based on the record of scheduled transmissions, whether the preliminary schedule includes any scheduled transmissions that would conflict with any scheduled transmissions in the record of scheduled transmissions or whether the length of the preliminary schedule can be reduced without conflicting with any other scheduled transmissions in the record of scheduled transmissions; and

responsive to a determination that there would be a conflict or that the length of the preliminary schedule can be reduced without conflict;

determining an updated schedule for the first node by determining a set of scheduled timeslots that minimises the number of scheduled timeslots without conflicting with any of the scheduled transmissions in the record of scheduled transmissions; and

sending the updated schedule to the first node to assign the updated schedule to the first node.

2. The method of claim 1 wherein the method further comprises, responsive to a determination that there would be no conflict or that the length of the preliminary schedule cannot be reduced without conflict, sending to the first node a signal to confirm the assignment of the preliminary schedule.

15. A wireless node comprising:

a wireless transceiver configured to communicate wirelessly with other nodes in a wireless network;

memory; and

a controller configured to control the wireless node to perform the method of any of claims 1-14.

3. A method for determining a transmission schedule for a first node in a multi-hop wireless network, wherein each node is a child node to a corresponding parent node, each child node being configured to receive one or more messages originating from a sink node via its corresponding parent node and wherein the method comprises the first node:

listening for signals indicating scheduling timeslots for transmission between nodes in the network and, if a signal is detected, updating a record of scheduled transmissions;

determining whether to schedule a transmission of a corresponding message to each of one or more child nodes of the first node;

determining a preliminary schedule specifying, for each of the one or more child nodes, a corresponding timeslot for transmission to the respective child node, the preliminary schedule being based on the record of scheduled transmissions;

sending the preliminary schedule to the corresponding parent node of the first node for approval; and

setting an assigned schedule based on a response from the corresponding parent node.

4. A method according to claim 3 wherein determining the preliminary schedule comprises determining a set of scheduled timeslots that minimises the number of scheduled timeslots without conflicting with any of the scheduled transmissions in the record of scheduled transmissions.

5. A method according to claim 3 or claim 4 wherein the response indicates either that the preliminary schedule has been approved by the corresponding parent node or provides a new schedule that is assigned to the first node by the corresponding parent node.

6. A method according to any of claims 3-5 wherein the first node determines to schedule a transmission to each of the one or more child nodes in response to the receipt from the corresponding parent node of a schedule specifying one or more scheduled transmissions from the corresponding parent node to the first node that the first node is required to forward on to the one or more child nodes of the first node.

7. A method according to any of claims 3-6 wherein the wherein the method further comprises the first node, in response to a determination to schedule, determining a signalling timeslot for sending the preliminary schedule that avoids conflicts with other scheduled transmissions in the record, wherein the preliminary schedule is sent during the signalling timeslot.

8. A method according to claim 7 wherein the method comprises the first node, in response to a detection that the sending of the preliminary schedule to the corresponding parent node for approval collided with another transmission in the network, resending the preliminary schedule during the next signalling timeslot that is free according to the record of scheduled transmissions.

9. A method according to claim 7 or claim 8 wherein the signalling timeslot for sending the preliminary schedule is determined based on a priority assigned to the first node by the corresponding parent node, the priority indicating a scheduling priority relative to other child nodes of the corresponding parent node.

10. A method according to claim 9 wherein the signalling timeslot is determined based on a next available signalling timeslot that is communicated to the first node by the corresponding parent node.

11. A method according to any of claims 7-10 wherein the method further comprises the first node, in response to a transmission schedule being assigned to the first node, sending the assigned schedule to each of the one or more child nodes and sending a corresponding assigned priority to each of the one or more child nodes.

12. A method according to claim 11 wherein the corresponding assigned priority for each of the one or more child nodes is determined by the first node based on a unique node ID assigned to each of the one or more child nodes, each unique node ID being based on the distance of the respective child node from the sink node.

13. A method according to any of claims 3-12 further comprising, determining an uplink schedule for transmissions to the sink node by determining a preliminary uplink schedule based on the record of scheduled transmissions, sending the preliminary uplink schedule to the corresponding parent node and setting an assigned uplink schedule based on a response from the corresponding parent node.

14. A method according to any of claims 3-12 wherein the method further comprises the first node:

listening to communications between other nodes;

determining whether a communication between other nodes has failed to be received by its intended recipient; and

in response to a determination that a communication has failed, attempting to send the failed communication to its intended recipient.

16. A computer implemented method for scheduling closed loop communication within a multi-hop wireless network, the wireless network comprising a control node and a plurality of slave nodes, the slave nodes being configured to relay downlink communications from the control node and uplink communications towards the control node, the control node being configured to send a downlink communication in a downlink direction to a first set of one or more sink nodes, each sink node in the first set being configured to send an uplink response to the downlink communication, the method comprising:

scheduling downlink transmissions sequentially, on a node by node basis, starting from the control node and moving downlink through the network;

scheduling uplink transmissions, wherein the uplink transmissions are scheduled on a node by node basis in a slave node order that minimises the time difference between each slave node of the first set receiving the downlink communication and the corresponding uplink response being sent.