SPARSE GRAPH CODING SCHEDULING FOR DETERMINISTIC ETHERNET
    11.
    发明申请
    SPARSE GRAPH CODING SCHEDULING FOR DETERMINISTIC ETHERNET 有权
    用于确定以太网的稀疏图形编码调度

    公开(公告)号:US20160112308A1

    公开(公告)日:2016-04-21

    申请号:US14519714

    申请日:2014-10-21

    CPC classification number: H04L12/417 H04L47/56

    Abstract: Embodiments provide techniques for transmitting data packets across a deterministic Ethernet network. Embodiments receive, at a first device in the deterministic Ethernet network, a deterministic binary schedule specifying timing information for transmitting data fragments relating to a plurality of data flows. Data packets to transmit to a destination device within the deterministic Ethernet network are received at the first device. Embodiments include fragmenting each of the data packets into two or more fragments and encoding at least one of the two or more fragments for each of the data packets with a respective sparse graph code. The encoded fragments are transmitted to the destination device, across multiple paths through the deterministic Ethernet network, according to timing information specified in the deterministic binary schedule.

    Abstract translation: 实施例提供了用于在确定性以太网上传输数据分组的技术。 实施例在确定性以太网网络中的第一设备处接收确定性二进制计划,确定用于发送与多个数据流相关的数据片段的定时信息。 在第一设备处接收到用于传送到确定性以太网内的目的地设备的数据分组。 实施例包括将每个数据分组分段成两个或更多个片段,并用相应的稀疏图形码对每个数据分组的两个或更多个片段中的至少一个进行编码。 根据确定性二进制计划中指定的定时信息,经编码的片段通过确定性以太网网络跨多个路径传输到目标设备。

    OPPORTUNISTIC RELAY AMONG MOBILE COMMUNICATION DEVICES

    公开(公告)号:US20250097697A1

    公开(公告)日:2025-03-20

    申请号:US18368997

    申请日:2023-09-15

    Abstract: In one embodiment, a method is disclosed comprising monitoring dynamic locations of a plurality of mobile communication devices within a physical area covered by a wireless communication network, wherein keys are distributed to the mobile communication devices at association time; determining that a particular mobile communication device should have a relay for communication with the network based on a first location of the particular mobile communication device and inadequate wireless communication characteristics at the first location; selecting an opportunistic relay device from the mobile communication devices based on a second location of the opportunistic relay device and adequate wireless communication characteristics of the opportunistic relay device within the network and to the first location from the second location; and directing the opportunistic relay device to relay communications for the particular mobile communication device at the first location, wherein the communications are encrypted based on the keys.

    FULL MESH FINE TIME MEASUREMENT
    13.
    发明公开

    公开(公告)号:US20240219511A1

    公开(公告)日:2024-07-04

    申请号:US18149389

    申请日:2023-01-03

    CPC classification number: G01S5/0289

    Abstract: Techniques for wireless communication are disclosed. These techniques include defining a message schedule for fine time measurement (FTM) at a first wireless access point (AP). The techniques further include broadcasting the message schedule to a plurality of wireless stations (STAs) from the first AP. The techniques further include receiving, at the first AP, a plurality of FTM messages from the plurality of STAs, the messages transmitted by the plurality of STAs based on the message schedule. The techniques further include determining a distance between the first AP and each of the plurality of STAs based on the plurality of FTM messages.

    ADAPTIVE CODE ASSIGNMENT TO AMBIENT POWER STATIONS

    公开(公告)号:US20250168887A1

    公开(公告)日:2025-05-22

    申请号:US18511336

    申请日:2023-11-16

    Abstract: Embodiments herein describe using transmission codes for ambient power stations (AMP STAs) so multiple AMP STAs can transmit in parallel to a Wi-Fi access point (AP). In order for the AMP STAs to transmit in parallel, the STAs use different codes. In one embodiment, the AMP STAs can use random timers to determine when they transmit and select a code to use during transmission. Before the timer expires, the AMP STAs can listen to see whether other AMP STAs are using the same code (e.g., a collision), and if so, select a different code. However, some AMP STAs may not have the ability to detect a collision. In that case, the AP can determine collisions for the AMP STAs and instruct the AMP STAs to select different codes.

    MANAGING PREEMPTION IN MULTI-LINK OPERATIONS

    公开(公告)号:US20250016821A1

    公开(公告)日:2025-01-09

    申请号:US18477233

    申请日:2023-09-28

    Abstract: Techniques for coordinating traffic and performing preemption in multi-link operations are provided. At least a first portion of a first element of data is transmitted by the first network device via a first link. A second element of data is identified by the first network device. The transmission of the first element of data is interrupted by the first network device to transmit the second element of data via the first link. A remaining portion of the first element of data is transmitted by the first network device via a second link.

    ONBOARDING CLIENT DEVICE TO USER-DEFINED NETWORK USING FEDERATION-BASED NETWORK IDENTITY

    公开(公告)号:US20250016147A1

    公开(公告)日:2025-01-09

    申请号:US18803058

    申请日:2024-08-13

    Abstract: Aspects described herein include a method of automated grouping of client devices for a user-defined network (UDN). The method includes receiving, from a first client device, an authentication request to join an access provider network. The authentication request includes a unique identifier of the first client device. The method also includes transmitting the unique identifier to a UDN cloud and receiving a first list from the UDN cloud. The first list indicates that the UDN is associated with the unique identifier. The method further includes joining the first client device with a second client device present on the access provider network based on a second list from the UDN cloud. The second list indicates that the UDN is associated with the second device.

Patent Agency Ranking