IP Library Granted Patent US 11,096,208
Granted Patent B2
US 11,096,208 · App. 16/175,490 · Granted Aug 17, 2021

Scheduler for power-efficient time slotted protocol

Inventors: Arvind K. Raghu (Plano, TX); Ariton E. Xhafa (Plano, TX); Ramanuja Vedantham (Allen, TX); Xiaolin Lu (Plano, TX)
Assignee: Texas Instruments Incorporated
H04W72/1289H04W72/1273Y02D30/70
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,096,208
App. No.
16/175,490
Granted
Aug 17, 2021
Kind
B2
Abstract

A network includes a parent node and at least one child node configured to communicate with the parent node via a wireless network protocol. The parent node includes a broadcast coordinator to transmit a broadcast message from the parent node to the child node at predetermined time intervals according to the wireless network protocol. A scheduler generates a scheduling packet that is communicated in the broadcast message. The scheduling packet includes a data field to instruct each child node to activate and receive data communicated from the parent node in a prescribed time slot following the broadcast message that is defined by the scheduling packet.

Claims (32)

1. A method for operating a network device, the method comprising:

generating, at a first network device, a scheduling packet including receive time slot information;

transmitting, from the first network device, a broadcast message with the scheduling packet to a second network device according to a network protocol; and

during a first time frame, receiving a first transmission from the second network device, the first transmission including an indication field containing a value N, the indication field indicating that the second network device will transmit a second transmission N frames later than the first time frame when N is greater than zero.

2. The method of claim 1 , wherein the transmitting and the receiving are performed using a wireless network and the network protocol is a wireless network protocol.

3. The method of claim 2 , wherein the transmitting of the broadcast message onto the wireless network includes transmitting the broadcast message from a media access control (MAC) layer utilizing a time slotted channel hopping protocol (TSCH) as the wireless network protocol.

4. The method of claim 1 , wherein the first network device is configured as a parent node in a communication network and the scheduling packet includes a data field having a virtual node identifier to identify the second network device to be a child node from a map of child nodes in the communication network.

5. The method of claim 4 , further including assigning the virtual node identifier when the child node joins the communication network.

6. The method of claim 4 , wherein the map includes a receive map that includes the receive time slot information included in the scheduling packet.

7. The method of claim 4 , wherein the map includes at least one of a receive map to enable or disable a receive time slot in at least one of the child nodes, a shared map to enable or disable a shared time slot in at least one of the child nodes, and a mode map to enable or disable a selected mode of operation in at least one of the child nodes.

8. The method of claim 7 , wherein, when the map includes the mode map, the selected mode of operation includes an over-the-air programming mode that uses contiguous time slots for communication.

9. The method of claim 1 , wherein, when N is equal to 0, the indication field indicates the first network device, as of the first time frame, has no expectation of a receiving second transmission from the second network device in a future time frame from a source of the first transmission.

10. The method of claim 1 , wherein the indication field corresponds to a byte in the first transmission.

11. A method for operating a network device, the method comprising:

identifying a set of data to be transmitted over a network over a plurality of time frames that includes at least a first time frame and a second time frame, the first and second time frames being non-adjacent time frames separated by an intervening time frame;

sending a first transmission during the first time frame, the first transmission including a first portion of the set of data and also including an indication field including a value N that indicates a total number of intervening time frames that separates the first and second time frames; and

sending a second transmission during the second time frame, the second time frame occurring after the first time frame and the second transmission including a second portion of the set of data.

12. The method of claim 11 , wherein the intervening time frame is a first intervening time frame, the total number of intervening time frames is a first number of first intervening time frames, and the indication field is a first indication field, the plurality of time frames including a third time frame that occurs after the second time frame and is separated from the second time frames by the second time frame, the second transmission also including a second indication field including a value M indicating a second total number of second intervening time frame that separates the second and third time frames.

13. The method of claim 11 , wherein the network is a wireless network using a wireless network protocol.

14. The method of claim 13 , wherein the wireless network protocol is a time slotted channel hopping protocol (TSCH) and the first and second transmission are sent in accordance with the TSCH protocol.

15. The method of claim 13 , wherein the network device is a node of a destination oriented directed acyclic graph (DODAG) utilizing a routing for low power (RLP) network protocol via the wireless network protocol.

16. The method of claim 15 , wherein the network device is a leaf node of the DODAG.

17. The method of claim 11 , wherein the indication field corresponds to a byte in the first transmission.

18. A method for operating a network device, the method comprising:

identifying a set of data to be transmitted over a network over a plurality of time frames that includes at least a first time frame, a second time frame, and a third time frame the first and second time frames being non-adjacent time frames separated by a first intervening time frame and the third time frame occurring after the second time frame and separated from the second time frame by a second intervening time frame;

sending a first transmission during the first time frame, the first transmission including a first portion of the set of data and also including a first indication field including a value N that indicates a first total number of first intervening time frames that separates the first and second time frames; and

sending a second transmission during the second time frame, the second time frame occurring after the first time frame and the second transmission including a second portion of the set of data and a second indication field including a value M indicating a second total number of second intervening time frames that separates the second and third time frames.

19. The method of claim 18 , wherein the network is a wireless network using a wireless network protocol.

20. The method of claim 19 , wherein the wireless network protocol is a time slotted channel hopping protocol (TSCH) and the first and second transmission are sent in accordance with the TSCH protocol.

21. The method of claim 19 , wherein the network device is a node of a destination oriented directed acyclic graph (DODAG) utilizing a routing for low power (RLP) network protocol via the wireless network protocol.

22. The method of claim 21 , wherein the network device is a leaf node of the DODAG.

23. The method of claim 18 , wherein the indication field corresponds to a byte in the first transmission.

Continuity (3)
Continuation 14816512 · Aug 3, 2015
Provisional Application 62090704 · Dec 11, 2014
Related Publication 20190069315A1 · Feb 28, 2019