中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

641 records (took 0.029 seconds)

    Adaptive transmission management based on link latency
    25.
    发明授权
    Adaptive transmission management based on link latency 有权

    公开(公告)号：US11825518B2

    公开(公告)日：2023-11-21

    申请号：US17527020

    申请日：2021-11-15

    Applicant: ITRON, INC.

    Inventor： Jerome Bartier ,  Fabrice Monier ,  Yacine Khaled

    IPC: H04W74/08 ,  H04L43/0852 ,  H04L1/08 ,  H04W84/18

    CPC classification number: H04W74/0825 ,  H04L1/08 ,  H04L43/0852 ,  H04W84/18

    Abstract: Various embodiments disclose a method comprising receiving, at a first node, a listening schedule associated with a second node; determining, by the first node, a link latency associated with the second node based on the listening schedule; in response to the first node detecting a frame transmission failure for a frame being transmitted by the first node to the second node, determining, by the first node based on the link latency, a backoff time; and in response to the first node determining that the backoff time has elapsed, the first node retransmitting the frame from the first node to the second node. In some embodiments, the method also includes determining a frame lifetime value associated with the second node based on the link latency; and in response to determining that a time period corresponding to the frame lifetime value has elapsed, dropping the frame.

    Techniques for release assistance indication assertion
    26.
    发明授权
    Techniques for release assistance indication assertion 有权

    公开(公告)号：US11818658B2

    公开(公告)日：2023-11-14

    申请号：US17348622

    申请日：2021-06-15

    Applicant: ITRON, INC.

    Inventor： Richard Donald Maes, II ,  Robert Vernon Dusenberry ,  Eric S. Benson

    IPC: H04W52/02 ,  H04W76/30

    CPC classification number: H04W52/0235 ,  H04W76/30

    Abstract: Techniques for transmitting data include receiving a message, storing the message in a buffer, and in response to a data session window being open: extracting the message from the buffer; transmitting at least data included in the message to a transceiver via a transmitter; determining that a header of the message includes a last message indicator and determining that the transmitter has transmitted the data to the transceiver; and in response, instructing the transceiver to end the data session window early and transition to a lower power state.

    Data Compression Techniques for Efficient Network Management
    28.
    发明公开
    Data Compression Techniques for Efficient Network Management 审中-公开

    公开(公告)号：US20230319167A1

    公开(公告)日：2023-10-05

    申请号：US17709329

    申请日：2022-03-30

    Applicant: Itron, Inc.

    Inventor： Sunilkumar jagdishbhai Prajapati

    IPC: H04L69/04 ,  H04L69/324 ,  H03M7/30

    CPC classification number: H04L69/04 ,  H03M7/60 ,  H04L69/324

    Abstract: Techniques for data compression for efficient network management are described herein. In one example, group(s) of bytes are formed from among input bytes to be compressed. The groups are formed by including bytes having at least a certain number (e.g., three) zero-valued most significant bits (MSBs). A byte of input data having several zero-valued MSBs may be in several groups. A group having the largest product (number of bytes in the group times number of zero-valued MSBs in all bytes in the group) may be selected. A compressed-bytes array may be formed with data of the selected group of bytes, wherein the number of zero-valued MSBs originally present in all of the bytes of the group of bytes has been removed (to compress the array). An uncompressed-bytes array may be formed with bytes of the input bytes of data not in the selected group of bytes. An address-bit array may be formed to indicate the array in which data associated with each of the input bytes of data is stored.

    Data Compression Techniques for Efficient Network Management
    29.
    发明公开
    Data Compression Techniques for Efficient Network Management 审中-公开

    公开(公告)号：US20230319166A1

    公开(公告)日：2023-10-05

    申请号：US17709316

    申请日：2022-03-30

    Applicant: Itron, Inc.

    Inventor： Sunilkumar jagdishbhai Prajapati

    IPC: H04L69/04

    CPC classification number: H04L69/04

    Abstract: Techniques for data compression for efficient network management are described herein. In one example, for each byte of input data, either: (1) a value of that byte is added to a first-instance array if the value of that byte has not yet been seen in the input data; or (2) an index value is added to an index array, wherein the index value points to the appropriate location in the first-instance array. An “address-bit array” is created with one bit for each byte of the input data. Each bit in the address-bit array indicates whether information of a corresponding byte of the input data was put into the first-instance array or the index array. When the input data file is smaller, the index values in the index array tend to be mostly small valued bytes. Accordingly, the number of zero-valued most significant bits (MSBs) present in all bytes may be stripped from the index array, thereby compressing the input data. The number of zero-valued MSBs stripped from all bytes in the index array may be indicated in a packet header.

    Time synchronization of mesh network nodes
    30.
    发明授权
    Time synchronization of mesh network nodes 有权

    公开(公告)号：US11764891B2

    公开(公告)日：2023-09-19

    申请号：US17325892

    申请日：2021-05-20

    Applicant: ITRON, INC.

    Inventor： Thomas F. Uhling ,  Keith Wayne Barnes ,  Howard Neal Brace ,  Imad Jamil

    IPC: H04J3/06 ,  H04L12/26 ,  H04L43/087 ,  H04L43/106

    CPC classification number: H04J3/0667 ,  H04J3/0602 ,  H04J3/0626 ,  H04L43/087 ,  H04L43/106

    Abstract: One embodiment of the present invention sets forth a technique for performing time synchronization within a network. The technique includes receiving, from a first node in the network and at a first receive time, a first periodic beacon that includes a first network time associated with the first node. The technique also includes determining a second receive time at which a second periodic beacon from the first node is to be received based on the first network time and the first receive time. The technique further includes calculating a first listening window for the second periodic beacon based on the second receive time, a first jitter uncertainty, and a first drift uncertainty, and listening for the second periodic beacon during the first listening window.

Patent Agency Ranking