Initiating or postponing radio transmissions according to dwell time limits

The gating system optimizes dwell time usage by reserving time for management packets, addressing inefficiencies in existing systems by deferring data packets when dwell time is insufficient, thus enhancing network efficiency and reducing traffic.

JP7591555B2Active Publication Date: 2024-11-28LANDIS GYR TECH INC
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
JP2022504623
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2019-07-25
Filing Date
2020-07-22
Publication Date
2024-11-28
Estimated Expiration
2040-07-22

AI Technical Summary

Technical Problem

Existing wireless communication systems inefficiently utilize dwell time on each channel, particularly during high traffic conditions, leading to dropped packets and unnecessary network traffic due to the inability to send management packets like beacons and acknowledgments when dwell time limits are exceeded.

Method used

A gating system that reserves a portion of dwell time for management packets, deferring or dropping data packets if there is insufficient time, ensuring that only allowed packets are transmitted during reserved time, thereby optimizing dwell time usage.

Benefits of technology

This approach reduces unnecessary network traffic and ensures compliance with dwell time limits by prioritizing the transmission of management packets, improving network efficiency and reducing packet drops.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007591555000001
    Figure 0007591555000001
  • Figure 0007591555000002
    Figure 0007591555000002
  • Figure 0007591555000003
    Figure 0007591555000003
Patent Text Reader

Abstract

The method includes identifying a packet for transmission and determining a wireless channel for transmission of the packet. The method further includes determining that the packet is in a restricted class and, in response to the packet being in the restricted class, determining a dynamic maximum available time on the wireless channel based on a reservation time and a residence time limit. The method further includes calculating a remaining residence time on the wireless channel based on a comparison of a spent residence time on the wireless channel to the dynamic maximum available time. Furthermore, the method includes determining a transmission duration for transmitting the packet on the wireless channel and, in response to the remaining residence time being less than the transmission duration, postponing the packet.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] Various embodiments of the present invention relate to wireless communications, and more particularly, to initiating or postponing wireless transmissions in compliance with dwell time constraints. [Background technology]

[0002] Radio frequency (RF) radios are required by regulations of the Federal Communications Commission (FCC) or other regulatory agencies to limit the channel occupancy time of each available radio channel. More specifically, the FCC requires that each radio occupy the channel for no more than 400 milliseconds during each rolling 20-second window. This restriction applies to data packets with substantial content, as well as acknowledgments and other network maintenance packets. Furthermore, this restriction applies to each radio individually, with a separate channel occupancy limit for each radio channel. Utility meters may typically incorporate an RF radio for the purpose of participating in a mesh network or other network and communicating with other nodes in the network. As a result, utility meters are required to comply with any regulations related to channel occupancy time (also known as dwell time) on a radio channel.

[0003] Nodes, including utility meters, in a mesh network hop between wireless channels according to an established channel hopping schedule. For example, the schedule indicates the order of channels to be used by the mesh network, and nodes typically transmit and receive on a single channel of that order for a time slot having a predetermined length. Thus, each node knows which channel to use for each time slot and which channel to hop to at the end of the time slot.

[0004] In the field of utility meters, mesh networks are used to transmit not only substantial data packets but also management packets such as beacons and acknowledgments. Beacons are transmitted periodically to maintain synchronization between radios in the mesh network. For example, beacons indicate the schedule of the aforementioned radio channels so that nodes in the network know which channel to use at what time, and beacons can indicate the current time for use by wireless devices. For example, a beacon may require 15 milliseconds to transmit and therefore require 15 milliseconds for the radio channel. Utility meters typically transmit an acknowledgment in response to receiving a data packet, and the acknowledgment confirms to the sender that the data packet was received. The acknowledgment may require 2 milliseconds to transmit and therefore utilizes 2 milliseconds. Both the beacons and acknowledgments, as well as other management packets, are counted as residence time.

[0005] In North America, the frequency band used by the energy meter may have 64 radio channels, and dwell time limitations apply to each radio channel separately. As a result, wireless devices must find a way to track the dwell time on each radio channel, and may use more channels than that. For example, a similar device in Hong Kong may use only 11 radio channels, whereas in India it may use 10. As the number of radio channels decreases, efficient use of dwell time becomes more important. Summary of the Invention

[0006] A non-limiting example of an implementation of the present invention is a method for gating a data transmission. The method includes identifying a packet for transmission and determining a wireless channel for transmission of the packet. The method further includes determining that the packet is in a restricted class and, in response to the packet being in the restricted class, determining a dynamic maximum available time on the wireless channel based on a reservation time and a residence time limit. The method further includes calculating a remaining residence time on the wireless channel based on a comparison of a spent residence time on the wireless channel to the dynamic maximum available time. Furthermore, the method includes determining a transmission duration for transmitting the packet on the wireless channel and, in response to the remaining residence time being less than the transmission duration, postponing the packet.

[0007] Another non-limiting example of an embodiment of the present invention is a node including a radio configured to transmit a plurality of packets over a plurality of available wireless channels, a processor configured to execute computer-readable instructions, and a memory configured to store the computer-readable instructions. When executed by the processor, the computer-readable instructions cause the processor to perform the following operations: identify a packet for transmission and determine a wireless channel for transmission of the packet from among the plurality of wireless channels; determine that the packet is in a restricted class and, in response to the packet being in the restricted class, determine a dynamic maximum available time on the wireless channel based on the reservation time and a dwell time limit; calculate a remaining dwell time on the wireless channel based on a comparison of the spent dwell time on the wireless channel to the dynamic maximum available time; and, in response to the remaining dwell time being less than the transmission duration, defer the packet.

[0008] Yet another non-limiting example of an embodiment of the present invention is a computer program product for gating wireless transmissions. The computer program product includes a computer readable storage medium having program instructions embodied thereon. The program instructions are executable by a processor to cause the processor to perform the following operations: the processor identifies a packet for transmission and determines a wireless channel for transmission of the packet; the processor determines that the packet is in a restricted class and, in response to the packet being in the restricted class, determines a dynamic maximum available time on the wireless channel based on a reservation time and a dwell time limit; the processor calculates a remaining dwell time on the wireless channel based on a comparison of the spent dwell time on the wireless channel to the dynamic maximum available time; and the processor determines a transmission duration for transmitting the packet on the wireless channel and, in response to the remaining dwell time being less than the transmission duration, defers the packet.

[0009] These exemplary aspects and features are mentioned not to limit or define the presently described subject matter, but to provide examples to aid in understanding the concepts described herein. Other aspects, advantages, and features of the presently described subject matter will become apparent after consideration of the entire application. [Brief description of the drawings]

[0010] These and other features, aspects, and advantages of the present disclosure will become better understood from the following detailed description when read in conjunction with the accompanying drawings.

[0011] [Figure 1] FIG. 1 is a conceptual diagram of a node having an integrated gating system in accordance with some embodiments of the present invention. [Diagram 2] FIG. 2 is an architectural diagram of a node having an integrated gating system according to some embodiments of the present invention. [Diagram 3]FIG. 3 is a block diagram of a utility meter with an integrated gating system according to some embodiments of the present invention. [Figure 4A] 4A-4B are conceptual diagrams of example counter subsets associated with wireless channels for use by a gating system according to some embodiments of the present invention. [Figure 4B] 4A-4B are conceptual diagrams of example counter subsets associated with wireless channels for use by a gating system according to some embodiments of the present invention. [Figure 5A] 5A-5B are conceptual diagrams of another exemplary subset of counters associated with wireless channels for use by a gating system according to some embodiments of the present invention. [Figure 5B] 5A-5B are conceptual diagrams of another exemplary subset of counters associated with wireless channels for use by a gating system according to some embodiments of the present invention. [Figure 6] FIG. 6 is a flow diagram of a method for gating restricted packets for wireless transmission according to some embodiments of the present invention. [Figure 7] FIG. 7 is a flow diagram of a method for gating packets allowed for wireless transmission according to some embodiments of the invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0012] Many existing radios inefficiently utilize the residence time on each channel, especially under high traffic conditions. To keep the network operational, it is important to send and receive management packets, such as beacons and acknowledgments, as expected. For example, when a node receives a data packet, it typically sends an acknowledgment on the same channel on which it received the data packet. However, if the node uses up all of its residence time (e.g., 400 ms) on the current channel within the current rolling time window (e.g., 20 seconds), the node is unable to send an acknowledgment. As a result, the data packet may be discarded, and the sender will retransmit the data packet upon failure to receive an acknowledgment. This leads to inefficient use of network bandwidth and unnecessary additional network traffic.

[0013] Some embodiments of the present invention address the above-mentioned shortcomings of existing methodologies by more effectively conserving residence time. More specifically, some implementations of the gating system reserve a portion of the residence time of each channel for packets of a particular class, referred to herein as permitted packets. In some implementations, the permitted packets are management packets, such as beacons and acknowledgments. When a device prepares to transmit a permitted packet on a wireless channel, the gating system of the device determines whether sufficient residence time remains for the transmission of the management packet. If there is not enough residence time remaining, the permitted packet is not immediately transmitted but is put on hold (e.g., postponed) or dropped. However, for data packets that are not permitted packets (e.g., non-management), the gating system determines whether there is sufficient residence time remaining when excluding the time reserved for permitted packets. In other words, in some implementations, the reserved time is permitted to be used only by packets of permitted classes. If there is not enough residence time remaining, the data packet is put on hold or postponed.

[0014] In some implementations, the decision of whether to transmit a data packet, also referred to herein as a packet, at the current time and on the current channel is based in part on the classification of the packet as an allowed packet, or lack thereof, and the reservation of residence time for allowed packets. As a result, the gating system can ensure that allowed packets can be transmitted as needed, thus reducing unnecessary network traffic due to dropped packets.

[0015] FIG. 1 is a conceptual diagram of a node 105 having an integrated gating system 100, in accordance with some embodiments of the present invention. The node 105 is a device that utilizes a radio 110 for communication in a network that includes one or more other nodes. For example, but not limited to, each node 105 in the network may be a utility meter, a router, a collector, a management node, or other type of node that participates in network communication. The gating system 100 may be in communication with the radio 110 with which the gating system 100 is integrated to initiate transmission of a data packet by instructing the radio 110 to transmit the data packet, as described herein. While the example of FIG. 1 shows the gating system 100 being integrated with the node 105, it will be understood that the gating system 100 may alternatively be separate from the node 105 but in communication with the node 105.

[0016] As shown in FIG. 1, the gating system 100 may include a scheduling engine 150 that determines when to transmit data packets by the radio 110. To this end, the scheduling engine 150 may track the dwell time spent on each radio channel 115. In some implementations, to this end, the gating system 100 includes a set of counters 120, together referred to herein as counter set 130, that keep track of the dwell time spent over a rolling time window. Through tracking of the dwell time spent, the scheduling engine 150 can both ensure compliance with an upper limit on the dwell time within the rolling time window and reserve time for management packets or other allowed packets. The scheduling engine 150 may be implemented as hardware, software, or a combination of both. For example, but not by way of limitation, the scheduling engine 150 may be a combination of one or more software functions or may be a dedicated hardware circuit.

[0017] In some implementations, the counter set 130 includes multiple subsets of the counters 120, each subset of the counters 120 referred to herein as a counter subset 140. Each counter subset 140 includes one or more counters 120. In some implementations, the counter set 130 is associated with the node 105 as a whole, and each counter subset 140 is assigned to, and thus associated with, a corresponding wireless channel 115 in order to track dwell times on that wireless channel 115. In some implementations, there is a one-to-one correspondence between the counter subsets 140 utilized by the node 105 and the wireless channels 115 (also referred to as channels 115). For example, if the node 105 utilizes 64 wireless channels 115, the node 105 may also utilize 64 counter subsets 140. However, it will be appreciated that the number of counter subsets 140 utilized may vary.

[0018] Each counter 120 may be implemented in hardware, software, or a combination of both. For example, but not by way of limitation, each counter 120 may be a special purpose register dedicated to counting spent dwell time, as described herein. As another example, each counter may be a software variable stored in memory. The variable may hold a numerical value, such as an integer representation of the spent dwell time. It will be appreciated that a variety of possible implementations exist, and one or more of such implementations may be used as described herein.

[0019] In some implementations, the radio 110 is a two-way radio configured to transmit data packets over a set of predefined radio channels 115. For example, without limitation, the radio 110 may transmit data packets across 64 established channels 115 in a band.

[0020] FIG. 2 is an architecture diagram of a node 105 having an integrated gating system 100 according to some embodiments of the present invention. As shown in FIG. 2, the node 105 may include a processing unit 230, a memory 240, a storage 250, and a radio 110, which may be in communication with each other by a bus 260. For example, but not limited to, the memory may be a random access memory (RAM) and the storage 250 may be a flash storage or a read-only memory (ROM). Although the processing unit 230, the memory 240, the storage 250, the radio 110, and the bus 260 are shown and described herein as being separate components, it will be understood that this distinction is for illustrative purposes only. For example, the processing unit 230, the memory 240, and the storage 250 may be integrated together in a single chip, such as a microcontroller unit.

[0021] As described in detail herein, in some implementations, the scheduling engine 150 performs various operations to prevent the node 105 from exceeding its residence time limit on the wireless channel 115. The operations of the scheduling engine 150 may be embodied as program instructions stored in a computer-readable medium, such as the storage 250 or the memory 240. In some implementations, the computer-readable medium is a non-transitory computer-readable medium. The counter set 130 described herein may be stored in the memory 240 and accessible to the processing unit 230. The processing unit 230 may execute the program instructions to implement the scheduling engine 150 with reference to the counter set 130 described herein.

[0022] FIG. 3 is a block diagram of a utility meter 300 having an integrated gating system 100 according to some embodiments of the present invention. The utility meter 300 is an example of a node 105 that may utilize implementations of the present invention described herein. As shown in FIG. 3, the utility meter 300 measures consumption of a resource 310 occurring on the premises 320. Although not shown, the utility meter 300 may include a metering module that detects one or more signals to measure the use of the resource 310 on the premises 320. As with other types of nodes 105, the utility meter 300 may further include a processing unit 230, a memory 240, a storage 250, and a radio 110, which may be in communication with each other via a bus 260. Additionally, as described above, the processing unit 230 may execute program instructions to perform the operations described herein.

[0023] It will be appreciated that the nodes 105 described herein are not limited to utility meters 300. Rather, the nodes 105 may be various types of computing devices configured to transmit communications via the radios 110. For example, the nodes 105 may be computing devices that comply with the IEEE 802.15.4 and 6LoWPAN technology standards for low-power, lossy wireless personal area networks.

[0024] Returning to FIG. 1, and more generally, a node 105 transmits data packets over its radio 110 in the course of legitimate operation of the node 105, and the node 105 may channel hop between wireless channels 115 according to a schedule. For example, but not by way of limitation, if the node 105 is a utility meter 300 or is connected to a utility meter 300, the node 105 may periodically transmit data packets including consumption data describing resource consumption measured or otherwise collected by the node 105. The node 105 may transmit such data packets to one or more other nodes in the mesh network such that the consumption data eventually arrives at a head-end unit for analysis or billing.

[0025] As mentioned above, for each radio channel 115, the dwell time of a single device can be capped at a dwell time limit (e.g., 400 milliseconds) per rolling window of time (e.g., 20 seconds). Traditionally, each data packet transmitted over the radio 110 receives the same treatment. Upon transmitting a data packet, it is determined whether the device exceeds 400 milliseconds within a rolling window of 20 seconds on a particular channel 115, and if so, the data packet is deferred or dropped. There is no existing mechanism for reserving a portion of the dwell time for a particular type of packet.

[0026] However, in an implementation of the present invention, a portion of the residence time is reserved for a first class of packets, also referred to herein as the allowed class. The result of this reservation is that a portion of the residence time limit is the reserved time available for transmission of the first class of packets. For example, and without limitation, the first class of packets are management packets, and a portion of the residence time limit is reserved for management packets. More specifically, for example, beacons and acknowledgements are packets that are considered to be management, and other types of data are considered to be non-management. However, it will be understood that this classification is exemplary and other classifications can be used.

[0027] In some implementations, the reserved time is not used for a second class of data packets, also referred to herein as the restricted class. The restricted class may be mutually exclusive with the permitted class. In other words, only packets of the permitted class are permitted to be transmitted during the reserved time, and all other packets are considered to be of the restricted class that are not transmitted during the reserved time in some implementations. Thus, in the above example where the beacons, acknowledgments, and other packets considered administrative are in the permitted class, all packets considered non-administrative are not permitted to be transmitted during the reserved time.

[0028] The reserved time may be a predetermined percentage of the dwell time limit or may be a fixed time. For example, without limitation, the reserved time may be 5 percent of the dwell time limit. Thus, if the dwell time limit is 400 milliseconds, then the reserved time is 5 percent of 400 milliseconds, which is 20 milliseconds. Generally, in some implementations, only data packets classified as being of an allowed class are transmitted during the reserved time.

[0029] In some implementations, if a data packet of the restricted class cannot be transmitted over the first wireless channel 115 while remaining within the dwell time limit less than the reserved time, the data packet is held (i.e., not yet transmitted). However, if a data packet of the restricted class can be transmitted over the first wireless channel 115 while remaining within the dwell time limit less than the reserved time, wireless transmission is initiated for the data packet, and the data packet is transmitted over the first wireless channel 115. In contrast, if a packet of the permitted class cannot be transmitted over the first wireless channel 115 while remaining within the dwell time limit, the data packet is put on hold. If a data packet of the permitted class can be transmitted over the first wireless channel 115 while remaining within the full dwell time limit, wireless transmission is initiated for the data packet, and the data packet is transmitted over the first wireless channel 115. In some implementations, the reserved time is not taken into account (i.e., is not subtracted from the dwell time limit) when determining whether to postpone a data packet of the permitted class.

[0030] In other words, when deciding whether to initiate wireless transmission for a packet or to hold a data packet, the maximum available time is considered, and the maximum available time is dynamic based on whether the data packet is of an allowed class. Specifically, when deciding whether to initiate wireless transmission for a packet or to hold a data packet, the scheduling engine 150 may compare the maximum available time to the amount of residence time spent plus the time to transmit the data packet. In some implementations, for an allowed packet, the maximum available time is the residence time limit, and for a restricted packet, the maximum available time is the residence time limit minus the reservation time. The maximum available time is applicable to each individual wireless channel 115, just as the residence time is limited individually for each wireless channel 115. In other words, for each wireless channel 115, the scheduling engine 150 tracks the residence time spent on that channel and determines whether the data packet can be transmitted without exceeding the maximum available residence time based on the residence time spent on that channel 115. However, in some implementations, the maximum available time is dynamic based on the classification of a given data packet, while the residence time limit is fixed.

[0031] In some implementations, once it is determined that the data packet should be transmitted over the wireless channel 115 (i.e., the data packet will not exceed the maximum available time on the wireless channel 115), wireless transmission of the data packet is initiated. More specifically, in some implementations, the data packet is transmitted on the wireless channel 115 immediately or as soon as possible, or before another data packet is transmitted on the current wireless channel 115, so that a re-determination of whether the data packet fits within the maximum available time (i.e., whether transmitting the data packet in addition to the spent residence time will not exceed the maximum available time) needs to occur.

[0032] As mentioned above, a data packet may be held because it does not fit within the maximum available time of the first wireless channel 115. More specifically, in some implementations, the node 105 holds such a data packet until the data packet can be transmitted within the maximum available time (i.e., without exceeding the residence time limit minus the reservation time, if applicable). In some implementations, the node 105 maintains a queue of data packets to be transmitted over the radio 110. The scheduling engine 150 may consider a first packet in the queue, which may be at the front or top of the queue, by determining whether the first packet can be transmitted within its respective maximum available time. If the first packet can be transmitted over the current wireless channel 115 within the maximum available time of the current wireless channel 115 that applies to the first packet, the node 105 transmits the first packet. However, if the first packet cannot be transmitted over the current wireless channel 115 within the maximum available time of the current wireless channel 115 that applies to the first packet, the scheduling engine 150 may postpone the first packet for a later transmission.

[0033] As described above, the node 105 may channel hop according to a schedule. After the first packet is held, when the node 105 hops to a different wireless channel 115 or when a predetermined period of time has passed, the scheduling engine 150 may reconsider transmitting the first packet along with other held data packets. Since each wireless channel 115 is associated with a respective amount of spent dwell time, it may be possible to transmit a data packet over a first wireless channel 115 without exceeding the maximum available time, but not possible to transmit the same data packet over a second wireless channel 115 without exceeding the maximum available time. Furthermore, the rolling time window, within which both the dwell time limit and the maximum available time apply, may shift over time, so that the node 105 may transmit the first packet at a later time.

[0034] The scheduling engine 150 may use the counter set 130 to track the spent dwell time (i.e., how much dwell time has been used) of each wireless channel 115, which is required in some implementations to determine whether the transmission of a particular data packet will cause the node 105 to exceed the maximum available time of the wireless channel 115. As mentioned above, each counter subset 140 may be assigned to, and thereby associated with, a respective wireless channel 115. Together, the counters 120 in the counter subset 140 for a wireless channel 115 may represent the spent dwell time in a rolling time window.

[0035] 4A-4B are conceptual diagrams of an exemplary counter subset 140 corresponding to a single wireless channel 115, according to some implementations. The counter subset 140 shown in the examples of FIGS. 4A and 4B includes a first counter 120a, a second counter 120b, and a third counter 120c, collectively referred to as counters 120. The node 105 may store and use such a counter subset 140 for each wireless channel 115 used by the node 105, and the scheduling engine 150 may use each counter subset 140 to track the residence time spent on the corresponding wireless channel 115. Specifically, FIG. 4A illustrates the counter subset 140 at time T1, and FIG. 4B illustrates the same counter subset 140 at time T2=T1+4, i.e., 4 seconds after time T1.

[0036] Counter subset 140 includes one or more counters 120. In some implementations, each counter 120 in counter subset 140 represents a fixed time window having a start time and an end time, also referred to herein as a fixed window. Thus, counter 120 may track dwell time spent during the corresponding fixed time window. More specifically, for example, each counter 120 may be a numeric value indicating how much dwell time was used in the corresponding fixed time window (i.e., in the span between the corresponding start time and end time). For example, each counter 120 may represent the number of milliseconds of dwell time used in the corresponding fixed time window. In some implementations, various counters 120 in counter subset 140 represent fixed time windows having a common width (i.e., the same length of time). Furthermore, the fixed time windows represented by counter subset 140 at a given time may be consecutive, and over time, counter 120 may be periodically reset and its fixed time window updated to a new start time at the end of consecutive fixed time windows represented by other counters 120 in counter subset 140. When counters 120 are so updated, the new fixed time window may have the same length as the previous fixed time window and the same lengths of the other fixed time windows represented by counter subset 140. Upon updating, counters 120 may begin tracking dwell time spent within the new fixed time window. In this manner, the fixed time window represented by counter subset 140 may dynamically change to keep up with the current time. As described in more detail below, the combination of successive fixed time windows of counters 120 in counter subset 140 can represent a rolling time window within which dwell time restrictions apply.

[0037] In some implementations, the sum of the lengths of time represented by the counters 120 in the counter subset 140 exceeds or at least meets the length of the rolling time window in which dwell times are tracked. More specifically, in some implementations, each counter 120 represents the same length of time L, and the number of counters 120 in the counter subset is of order 1+R / L, which can also be written as [R / L]+1, where R is the length of the rolling time window. Some implementations utilize values ​​of L such that both L and [R / L] are integers, although it will be appreciated that the use of integers for these values ​​is not required. In the example of FIGS. 4A-4B, each counter 120 represents a 10 second window within a 20 second rolling time window, and the total number of counters 120 in the counter subset 140 is three, since [20 / 10]+1=3.

[0038] At a given time, the counter subset 140 may include one active counter 120 that represents a fixed time window that includes the current time. As dwell time is spent, the dwell time spent may be recorded in the active counter 120, such as by incrementing (i.e., increasing) the active counter 120 by the amount of dwell time spent. In some implementations, each counter 120 measures the dwell time spent in milliseconds and is therefore incremented as needed by the amount of milliseconds that the counter 120 remains active and is used to transmit data packets. The remaining counters 120 may be considered inactive in that dwell time expenditure is not currently being counted in the inactive counters 120. Each inactive counter 120 may represent a fixed time window that has elapsed. In some implementations, the counters 120 in the counter subset 140 represent successive fixed time windows, with the active counters 120 being the present and the inactive counters representing the recent past. In Figures 4A and 4B, the respective active counters 120 in each figure appear with a white background and the inactive counters 120 appear with a grey background. In Figure 4A, the active counter 120 is counter 120c that includes time T1, and in Figure 4B, the active counter 120 is counter 120a that includes time T2=T1+4.

[0039] In some implementations, a counter subset 140 representing a currently used wireless channel 115 is active, and within that counter subset 140, a counter 120 representing a current fixed time window is active. Each time a data packet is transmitted over the wireless channel 115, the scheduling engine 150 may increment an active counter 120 in the active counter subset 140 with a value indicative of the time used to transmit the data packet. In other words, when a data packet is transmitted over a wireless channel 115, the active counter 120 in the counter subset 140 associated with that wireless channel 115 may be incremented by the time required to transmit the packet. In this way, the active counter 120 maintains a residence time spent in a fixed time window that includes the current time.

[0040] However, before transmitting each data packet on the wireless channel 115, the scheduling engine 150 may refer to the counter subset 140 associated with the wireless channel 115 to determine whether sufficient residence time remains in the rolling time window to complete the transmission of the data packet. More specifically, if the data packet is within the allowed class, the scheduling engine 150 may subtract the time recorded in the counter subset 140 from the residence time limit of the rolling time window. If the difference is not less than the estimated transmission time (i.e., duration) of the data packet, the scheduling engine 150 may transmit the data packet on the current wireless channel 115. If the difference is less than the estimated transmission time for the data packet, the scheduling engine 150 may retain the packet. On the other hand, if the data packet is of a restricted class, the scheduling engine 150 may subtract the time recorded in the counter subset 140 from the residence time limit minus the reserved time. If the difference is not less than the estimated transmission time of the data packet, the scheduling engine 150 may transmit the data packet on the wireless channel 115. If the difference is less than the estimated transmission time of the data packet, the scheduling engine 150 may retain the packet.

[0041] At some point, over time, the fixed time window represented by the active counter 120 ends. Specifically, this fixed time window ends when the current time meets the end time of the fixed time window. For illustrative purposes, counters 120a, 120b, and 120c shown in FIG. 4A and FIG. 4B are labeled as counter X, counter Y, and counter Z, respectively. In this example, FIG. 4A shows a moment T1 at which counter Z is the active counter 120. The 10 second time window represented by counter Z begins at time T1-8 and ends at time T1+2. At time T1+2, counter set 130 is updated to utilize a different active counter 120. For this purpose, counter Z is deactivated, thereby becoming inactive. In this example, since only three counters 120 are needed at a time and a counter 120 is needed to represent the current time window, counter X is reset (e.g., to a zero value) and used as the new active counter 120. More generally, in some implementations, when the current time progresses beyond a fixed time window represented by an active counter 120, the active counter 120 becomes inactive and the oldest counter 120 (i.e., the counter 120 that was most recently active) is reset to become the new active counter 120.

[0042] The resetting and reuse of the oldest counter 120 can be implemented in various ways. In this example, counter X in FIG. 4A is the same as counter X in FIG. 4B, counter Y in FIG. 4A is the same as counter Y in FIG. 4B, and counter Z in FIG. 4A is the same as counter Z in FIG. 4B. For example, if each counter 120 is represented by a particular variable or register, a common variable or register may be used between counter X in FIG. 4A and counter X in FIG. 4B. However, alternatively, the variable or register used to implement the oldest counter 120 may become unused (e.g., by being freed), and a new variable or register may be used for a new version of that counter 120. Thus, in some implementations, the quantity of counters 120 in the counter subset 140 remains constant. Those skilled in the art will appreciate that many implementations of these counters 120 are possible.

[0043] It will be appreciated that the use of counters 120 as described above tends to overestimate dwell time already used. For example, at time T1 shown in FIG. 4A, counter subset 140 indicates dwell time spent over the past 28 seconds, not just the last 20 seconds. At time T2=T1+4 shown in FIG. 4B, counter subset 140 indicates dwell time spent over the past 22 seconds leading up to time T2. In some implementations, this mechanism ensures that the dwell time spent is not underestimated, but it is possible for data packets to be retained based on dwell time spent over a period longer than the rolling time window.

[0044] To improve accuracy, more counters 120 may be used and the length of time each counter 120 represents may be reduced. For example, if five counters 120 are used, each representing a five second time window, then the maximum span of time for which dwell times spent in a counter subset 140 at a given time are stored is 25 seconds. As another example, if twenty-one counters 120 are used, each representing a one second time window, then the maximum span of time for which dwell times spent in a counter subset 140 at a given time are stored is 21 seconds.

[0045] 5A-5B are conceptual diagrams of a second exemplary counter subset 140 corresponding to a single wireless channel 115, according to some implementations. The counter subset 140 shown in the example of FIGS. 5A and 5B includes 21 counters 120d-120x, each of which corresponds to a fixed window of 1 second based on a rolling time window totaling 20 seconds. The exemplary node 105 can store and use such a counter subset 140 for each wireless channel 115 used by the node 105, and the scheduling engine 150 can use each counter subset 140 to track the dwell time spent on the corresponding wireless channel 115. Specifically, FIG. 5A illustrates the counter subset 140 at time T1, and FIG. 5B illustrates the same counter subset 140 at time T2=T1+0.4, i.e., 400 milliseconds after time T1.

[0046] At time T1, counter 120x is the active counter 120, and each time node 105 transmits a data packet while counter 120 is active, counter 120x is incremented by the time it takes to transmit the data packet. Over time, at some point, the fixed time window represented by counter 120x will end, specifically, when the current time coincides with the end time of the corresponding fixed time window. At time T2, 400 milliseconds after T1, the fixed time window corresponding to counter 120x has ended, and therefore counter 120d, the oldest counter 120, is reset and becomes the active counter 120. Thus, as shown in FIG. 5B, at time T2, counter 120d is the active counter, and counter 120x represents the elapsed fixed time window and is now inactive.

[0047] 5A-5B, assume that T1 occurs with 300 ms remaining in the fixed time window corresponding to counter 120x (i.e., T1 occurs 700 ms into the fixed time window) and T2 occurs 100 ms into a new fixed time window corresponding to counter 120d after its reset, such that T2 occurs 400 ms after T1. Then, at T1, counter subset 140 indicates dwell time spent over the past 20.7 seconds spanning 700 ms into the fixed time window of counter 120x, and at T2, counter subset 140 indicates dwell time spent over the past 20.1 seconds spanning 100 ms into the fixed time window of counter 120d, indicating that the rolling time window is now 20 seconds long. As discussed above, this mechanism of including one more counter 120 than required to equal the length of the rolling time window ensures that the dwell time spent is not underestimated. However, compared to the example of FIG. 1, this second embodiment is more accurate but requires more space to maintain the additional counter 120.

[0048] Increasing the number of counters 120 tends to increase the storage space used. For example, and not by way of limitation, assume that a respective counter subset 140 is used for each of 64 wireless channels 115, and further assume that each counter subset 140 includes 21 counters 120 to support tracking of 21 1-second fixed time windows representing a rolling time window of 20 seconds. In this example, each counter 120 is represented by a 16-bit integer representing the milliseconds of dwell time spent (i.e., used) during the corresponding 1-second fixed time window. Storage of these counters 120 would then require 21 16-bit integers for each of the 64 channels, or 2688 bytes (a byte is 8 bits). In contrast, if only three counters 120 per channel are used, this storage space would be reduced by a factor of 7 to only 384 bytes. If the node 105 is a utility meter 300 or other device with limited storage 250, giving up storage space for increased accuracy may be impractical.

[0049] 6 is a flow diagram of a method 600 for gating (i.e., determining whether to transmit) a restricted packet for wireless transmission in accordance with some embodiments of the present invention. In some implementations, the method 600 is performed in whole or in part by the scheduling engine 150 on the node 105. It will be appreciated that the method 600 is provided for illustrative purposes as one example of a method 600 for scheduling a restricted packet.

[0050] At block 605 of the method 600, the scheduling engine 150 identifies a packet to be transmitted over the radio 110. For example, the scheduling engine 150 may receive a reference to the packet. In some implementations, such as when the scheduling engine 150 is integrated into the utility meter 300, the utility meter 300 executes one or more processes for periodically transmitting a beacon, for transmitting consumption data describing the consumption of the resource 310, or for transmitting other types of packets. Other processes may be executed at the node 105 other than the utility meter 300. In either case, such processes may notify the scheduling engine 150 that a packet in the form of a beacon, consumption data, or other data is ready to be transmitted. Additionally or alternatively, the scheduling engine 150 may monitor communications between the process and the radio 110 to intercept a request to transmit a packet. It will be appreciated that there are many mechanisms by which the scheduling engine 150 recognizes and thus identifies a data packet to be transmitted.

[0051] In block 610, the scheduling engine 150 determines a wireless channel 115 over which the data packet may be transmitted. For example, in some implementations, the node 105 hops between wireless channels 115 according to a schedule, in which case the current wireless channel 115 is determined based on an established channel hopping sequence and a current time slot. The scheduling engine 150 may identify the current wireless channel 115 as the channel 115 over which the data packet may be transmitted because other devices sharing a network with the node 105 may expect to receive the data packet over the current channel 115.

[0052] In block 615, the scheduling engine 150 determines which class the packet belongs to, and more specifically, in this example, that the packet belongs to the restricted class. To this end, for example, the scheduling engine 150 may compare the size or duration of the packet to a threshold. For example, a packet of a size greater than the threshold may be classified as unmanaged, or a packet that takes at least the threshold duration to transmit may be classified as unmanaged. As another example, the scheduling engine 150 may analyze the contents of the packet to determine the classification of the packet. For example, the scheduling engine 150 may recognize the packet as consumable data and therefore classify the packet as unmanaged. If only management packets are included in the permitted class, the scheduling engine 150 therefore determines that the packet belongs to the restricted class. Additionally or alternatively, the scheduling engine 150 may determine the class of the packet in the same or similar manner that the packet itself is identified. For example, the process requesting transmission of the packet may inform the scheduling engine 150 of the class or may provide an indication identifying the class of the packet.

[0053] At block 620, the scheduling engine 150 determines the maximum available time applicable to the packet based on both the residence time limit and the reservation time. In some implementations, this determination entails subtracting the reserved time from the residence time limit. For example, if the residence time limit is 400 ms and the reservation time is 20 ms, then the maximum available time for this packet in the restricted class is 380 ms. However, in another example, the scheduling engine 150 may have access to a mapping from class to maximum available time. In that case, the scheduling engine 150 may look up the maximum available time of the packet in the restricted class, thereby determining that the maximum available time is 380 ms.

[0054] At block 625, the scheduling engine 150 calculates the remaining dwell time for the wireless channel 115. In some implementations, calculating the remaining dwell time includes subtracting the value of the counter subset 140 associated with the current wireless channel 115 from the maximum available time. The value of the counter subset 140 may be the sum of the various counters 120 in the counter subset 140. For example, in the example of FIG. 1, in 4A and 4B, if the counters 120 are implemented as numeric values, the value of the counter subset 140 may be the sum of counter X, counter Y, and counter Z, and this value may be subtracted from the maximum available time to determine the remaining dwell time. In this example, since the reservation time was considered in determining the maximum available time, the remaining dwell time does not count the reservation time, and therefore the reservation time may be left in the dwell time limit.

[0055] At block 630, the scheduling engine 150 determines a transmission time for the packet, where the transmission time may be an estimate of the time it will take to transmit the packet over the radio 110. In some implementations, the size of the packet may be determined based on, for example, inspection of the packet or metadata associated with the packet, and the transmission rate for over-the-air transmission is known. Thus, the scheduling engine 150 may determine the transmission time by multiplying the size by the transmission rate.

[0056] At decision block 635, the scheduling engine 150 determines whether the transmission time is greater than the remaining residence time of the wireless channel 115. In other words, the scheduling engine 150 determines whether the packet can be transmitted within the residence time limit excluding the time reserved for transmitting this packet. If the transmission time is not greater than the remaining residence time, the scheduling engine 150 may begin transmitting the packet at block 640. For example, the scheduling engine 150 may instruct the radio 110 to transmit the packet, and the radio 110 may do so. However, if the transmission time is greater than the remaining residence time, the packet is held (e.g., postponed) at block 645. For example, the scheduling engine 150 may requeue the packet for transmission after the node 105 switches to a different wireless channel 115. However, if at a future time it is determined that the packet can be transmitted within the residence time limit minus the reserved time, the scheduling engine 150 may begin transmitting the packet.

[0057] 7 is a flow diagram of a method 700 for scheduling granted packets for wireless transmission in accordance with some embodiments of the present invention. In some implementations, the method 700 is performed in whole or in part by a scheduling engine 150 on a node 105. It will be appreciated that the method 700 is provided for illustrative purposes as one example of a method 700 for scheduling granted packets.

[0058] At block 705 of the method 700, the scheduling engine 150 identifies a packet to be transmitted over the radio 110. For example, the scheduling engine 150 may receive a reference to the packet. In some implementations, such as when the scheduling engine 150 is integrated into the utility meter 300, the utility meter 300 executes one or more processes for periodically transmitting a beacon, for transmitting consumption data describing the consumption of the resource 310, or for transmitting other types of packets. Other processes may be executed at the node 105 other than the utility meter 300. In either case, such processes may notify the scheduling engine 150 that a packet in the form of a beacon, consumption data, or other data is ready to be transmitted. Additionally or alternatively, the scheduling engine 150 may monitor communications between the process and the radio 110 to intercept a request to transmit a packet. It will be appreciated that there are many mechanisms by which the scheduling engine 150 recognizes and thus identifies a data packet to be transmitted.

[0059] At block 710, the scheduling engine 150 determines a wireless channel 115 over which the data packet may be transmitted. For example, in some implementations, the node 105 hops between wireless channels 115 according to a schedule, in which case the current wireless channel 115 is determined based on an established channel hopping sequence and a current time slot. Since other devices sharing a network with the node 105 may expect to receive the data packet over the current channel 115, the scheduling engine 150 may identify this current wireless channel 115 as the channel 115 over which the data packet may be transmitted.

[0060] In block 715, the scheduling engine 150 determines which class the packet belongs to, more specifically, in this example, that the packet belongs to the allowed class. To this end, for example, the scheduling engine 150 may compare the size or duration of the packet to a threshold. For example, a packet of a size less than the threshold may be classified as managed, or a packet that requires less than the threshold duration to transmit may be classified as managed. As another example, the scheduling engine 150 may analyze the contents of the packet to determine the classification of the packet. For example, the scheduling engine 150 may recognize the packet as a beacon and therefore classify the packet as managed. If all managed packets are of the allowed class, the scheduling engine 150 therefore determines that the packet belongs to the allowed class. Additionally or alternatively, the scheduling engine 150 may determine the class of the packet in the same or similar manner that the packet itself is identified. For example, the process requesting transmission of the packet may inform the scheduling engine 150 of the class or may provide an indication identifying the class of the packet.

[0061] In block 720, the scheduling engine 150 sets the maximum available time to the residence time limit. For example, upon identifying that the packet belongs to an allowed class, the scheduling engine 150 may simply set the maximum available time equal to the residence time limit. However, in another example, the scheduling engine 150 may have access to a class-to-maximum available time mapping, where the allowed class is mapped to the residence time limit. In that case, the scheduling engine 150 may look up the maximum available time of the packet in the allowed class, thereby identifying the maximum available time as the residence time limit.

[0062] At block 725, the scheduling engine 150 calculates the remaining residence time for the wireless channel 115. In some implementations, calculating the remaining residence time includes subtracting the value of the counter subset 140 associated with the current wireless channel 115 from the maximum available time. The value of the counter subset 140 may be the sum of the various counters 120 in the counter subset 140. For example, in the example of FIG. 1, in 4A and 4B, if the counters 120 are implemented as numbers, the value of the counter subset 140 may be the sum of counter X, counter Y, and counter Z, and this value may be subtracted from the maximum available time to determine the remaining residence time. In this example, the reserved time is not considered or reserved. The remaining residence time includes the reserved time in some implementations, since the reserved time is specifically intended for granted packets. Thus, the granted packets are allowed to use the reserved time.

[0063] At block 730, the scheduling engine 150 determines a transmission time for the packet, where the transmission time may be an estimate of the time it will take to transmit the packet over the radio 110. In some implementations, the size of the packet may be determined based on, for example, inspection of the packet or metadata associated with the packet, and the transmission rate for over-the-air transmission is known. Thus, the scheduling engine 150 may determine the transmission time by multiplying the size by the transmission rate.

[0064] At decision block 735, the scheduling engine 150 determines whether the transmission time is greater than the remaining residence time of the wireless channel 115. In other words, the scheduling engine 150 determines whether the packet can be transmitted within the residence time limit. If the transmission time is not greater than the remaining residence time, the scheduling engine 150 may begin transmitting the packet at block 740. For example, the scheduling engine 150 may instruct the radio 110 to transmit the packet, and the radio 110 may do so. However, if the transmission time is greater than the remaining residence time, the packet is held (e.g., postponed) at block 745. For example, the scheduling engine 150 may requeue the packet for transmission after the node 105 switches to a different wireless channel 115. However, if at a future time it is determined that the packet can be transmitted within the residence time limit, the scheduling engine 150 may begin transmitting the packet.

[0065] Numerous specific details are described herein to provide a thorough understanding of the claimed subject matter. However, those skilled in the art will understand that the claimed subject matter may be practiced without these specific details. In other instances, methods, apparatus, or systems that would be known to those skilled in the art have not been described in detail so as not to obscure the claimed subject matter.

[0066] The features discussed herein are not limited to any particular hardware architecture or configuration. A computing device such as node 105 may include any suitable arrangement of components that provide results conditional on one or more inputs. Suitable computing devices include general-purpose microprocessor-based computer systems that access stored software (i.e., computer-readable instructions stored on the computer system's memory) that programs or configures the computing system from a general-purpose computing device to a specialized computing device that implements one or more aspects of the present subject matter. Any suitable programming, scripting, or other type of language or combination of languages ​​may be used to implement the teachings contained herein in the software used in programming or configuring the computing device.

[0067] Aspects of the methods disclosed herein may be performed in operation of such a computing device. The order of the blocks presented in the above examples may be changed. For example, the blocks may be reordered, combined, or divided into sub-blocks. Certain blocks or processes may be performed in parallel.

[0068] The use of "adapted to" or "configured to" herein is intended as open and inclusive language that does not preclude apparatus adapted or configured to perform additional tasks or steps. Additionally, the use of "based on" is intended to be open and inclusive in the sense that when a process, step, calculation, or other operation is "based on" one or more recited conditions or values, it may in fact be based on additional conditions or values ​​beyond those recited. The headings, lists, and numbering contained herein are for ease of description only and are not intended to be limiting.

[0069] While the present subject matter has been described in detail with respect to certain aspects thereof, it will be appreciated that those skilled in the art, upon gaining the foregoing understanding, may readily make modifications, variations, and equivalents to such aspects. It will therefore be understood that the present disclosure has been presented for purposes of illustration and not limitation, and is not intended to exclude the inclusion of modifications, variations, or additions to the present subject matter as would be readily apparent to those skilled in the art.

Claims

1. 1. A method for gating data transmission, comprising: identifying a first packet for transmission; determining a radio channel for transmission of the first packet; determining that the first packet is in a restricted class; responsive to the first packet being in the restricted class, determining a dynamic maximum available time on the wireless channel based on a reservation time and a residence time limit; calculating a first remaining dwell time on the wireless channel based on a comparison between a first spent dwell time on the wireless channel and the dynamic maximum available time; determining a first transmission duration for transmitting the first packet on the wireless channel; in response to the first remaining residence time being less than the first transmission duration, deferring the first packet; A method comprising:

2. The step of determining the dynamic maximum available time includes the step of subtracting the reservation time from the residence time limit in response to the first packet being of the restricted class. The method of claim 1.

3. Furthermore, determining that the second packet is in an allowed class; in response to the second packet being in the allowed class, setting the dynamic maximum available time on the wireless channel to the residence time limit; calculating a second remaining dwell time on the wireless channel based on a comparison between a second spent dwell time on the wireless channel and the dynamic maximum available time; determining a second transmission duration for transmitting the second packet on the wireless channel; in response to the second remaining residence time being less than the second transmission duration, deferring the second packet; The method of claim 1 , comprising:

4. the dynamic maximum available time for a packet is based on whether the packet is in the allowed class. The method according to claim 3.

5. Furthermore, Dividing a rolling time window into two or more fixed time windows; assigning a counter subset to the wireless channel, the counter subset consisting of two or more counters that together represent a residence time spent of the wireless channel in the rolling time window; assigning each counter of the counter subset to a respective one of the two or more fixed time windows; determining the first spent dwell time based on a sum of two or more counters in the counter subset; The method of claim 1 , comprising:

6. Furthermore, transmitting the first packet over the wireless channel; incrementing a first counter in said counter subset by said first transmission duration; Including, the first counter is assigned to a first fixed time window that includes a time when the first packet is to be transmitted; The method according to claim 5.

7. Furthermore, assigning a respective subset of counters to each wireless channel of a plurality of available wireless channels; Each subset of counters indicates a respective spent residence time of a respective wireless channel within said rolling time window. The method according to claim 5.

8. Determining a dynamic maximum available time includes subtracting the reservation time from the dwell time limit; The step of calculating the first remaining residence time comprises: Dividing a rolling time window into two or more fixed time windows; assigning each counter of a counter subset, the counter subset including two or more counters that together represent spent dwell time, to a respective fixed time window of the two or more fixed time windows; determining the first spent dwell time based on a sum of two or more counters in the counter subset; subtracting the first spent residence time from the dynamic maximum available time; Including, The method of claim 1.

9. Furthermore, Dividing the rolling time window into two or more fixed time windows; for each radio channel of a plurality of available radio channels, assigning each counter of a respective counter subset to a corresponding fixed time window of the two or more fixed time windows; Including, for each radio channel of the plurality of available radio channels, each counter of the counter subset represents a respective fractional spent residence time in the corresponding fixed time window. The method according to claim 8.

10. A node, a radio configured to transmit a plurality of packets over a plurality of available radio channels; A processor configured to execute computer readable instructions; a memory configured to store the computer-readable instructions, which when executed by the processor, cause the processor to perform operations; Including, The operation includes: identifying a first packet for transmission; determining a wireless channel from the plurality of available wireless channels for transmission of the first packet; determining that the first packet is of a restricted class; responsive to the first packet being in the restricted class, determining a dynamic maximum available time on the wireless channel based on a reservation time and a residence time limit; calculating a first remaining dwell time on the wireless channel based on a comparison between a first spent dwell time on the wireless channel and the dynamic maximum available time; determining a first transmission duration for transmitting the first packet on the wireless channel; in response to the first remaining residence time being less than the first transmission duration, deferring the first packet; Including, node.

11. the node is a utility meter; The node of claim 10.

12. The operation further comprises: determining that the second packet is of an allowed class; in response to the second packet being in the allowed class, setting the dynamic maximum available time on the wireless channel to the residence time limit; calculating a second remaining dwell time on the wireless channel based on a comparison between a second spent dwell time on the wireless channel and the dynamic maximum available time; determining a second transmission duration for transmitting the second packet on the wireless channel; in response to the second remaining residence time being less than the second transmission duration, deferring the second packet. The node of claim 10, comprising:

13. further comprising a counter set including a plurality of counter subsets; Each subset of counters is assigned to a respective wireless channel of a plurality of available wireless channels; The operation further comprises: transmitting, by the radio, the second packet over the radio channel; incrementing a first counter in a counter subset assigned to the wireless channel by the first transmission duration; Including, the first counter is assigned to a first fixed time window that includes a time when the first packet is to be transmitted; The node of claim 12.

14. the dynamic maximum available time for a packet is based on whether the packet is in the allowed class; The node of claim 12.

15. The operation further comprises: Dividing a rolling time window into two or more fixed time windows; assigning a counter subset to the wireless channel, the counter subset consisting of two or more counters that together represent a spent residence time of the wireless channel in the rolling time window; assigning a first counter of the counter subset to a first fixed time window of the two or more fixed time windows, the first counter indicating a fractional dwell time spent in the first fixed time window; transmitting, by the radio, the first packet over the radio channel; in response to the time that the first packet is transmitted falling within the first fixed time window, incrementing the first counter by the first transmission duration; Including, The node of claim 10.

16. The operation further comprises: assigning a respective subset of counters to each wireless channel of the plurality of available wireless channels; a respective subset of counters indicative of a respective spent residence time of said respective wireless channel within said rolling time window; The node of claim 15.

17. for each radio channel of the plurality of available radio channels, a respective counter in the respective counter subset of the radio channel represents a respective fractional spent dwell time within a corresponding fixed time window; The node of claim 16.

Citation Information

Patent Citations

  • ANCHOR CHANNEL DESIGN FOR UNLICENSED INTERNET OF THINGS (IoT)

    WO2018191538A1

  • Transmission with restrictions in unlicensed spectrum

    WO2018237226A1

  • Method, terminal device and network device for data transmission

    WO2019095332A1