LOW-POWER WAKE-UP RECEIVER NEGOTIATION PROCEDURE

    公开(公告)号:US20180041961A1

    公开(公告)日:2018-02-08

    申请号:US15376360

    申请日:2016-12-12

    CPC classification number: H04W52/0229 H04W52/0216 H04W84/12 Y02D70/00

    Abstract: Embodiments of a LP-WUR (low-power wake-up radio) negotiation procedure are generally described herein. A first wireless device encodes a request frame for transmission to a second wireless device, requesting to enable a LP-WUR mode and negotiate parameters for LP-WUR transmission between the first wireless device and the second wireless device. The first wireless device decodes a response action frame responsive to the request frame, indicating acceptance or rejection of the request. If the response action frame indicates acceptance of the request, the first wireless device: encodes an acknowledgement frame for transmission to the second wireless device, the acknowledgement frame to configure the second wireless device to enable the LP-WUR mode.

    Methods and arrangements for frame transmissions

    公开(公告)号:US09749974B2

    公开(公告)日:2017-08-29

    申请号:US13931921

    申请日:2013-06-29

    CPC classification number: H04W56/0015 H04L7/04 H04W56/00 H04W74/08

    Abstract: Logic to “loosely” manage synch frame transmissions in a synch network via the devices synced to the network that implement the logic. Logic may distributedly adjust the frequency of attempting synch frame transmissions without estimating the size of the neighborhood. Logic in devices of a synch network to let each device maintain a Transmission Window (TW). Logic to determine the frequency of attempting synch frame transmissions based upon the TW. Logic to increase TW if the device detects a synch frame transmission. Logic to decrease TW if the device successfully transmits a synch frame. Logic to balance power consumption and discovery timing by adjusting the decrease in TW responsive to a synch transmission in relation to the increase in TW responsive to detection of a synch transmitted by another device.

    Apparatus, system and method of communicating in a data link group

    公开(公告)号:US09572008B2

    公开(公告)日:2017-02-14

    申请号:US14670621

    申请日:2015-03-27

    Abstract: Some demonstrative embodiments include apparatuses, systems and/or methods of communicating traffic to a plurality of wireless devices. For example, an apparatus may include logic and circuitry configured to cause a Neighbor Awareness Networking (NAN) device to communicate one or more discovery messages during at least one Discovery Window (DW) of a NAN cluster including the NAN device; and communicate data within a data link group after the DW, the data link group including the NAN device and one or more NAN devices of the NAN cluster.

    Methods and arrangements to compress identification
    16.
    发明授权
    Methods and arrangements to compress identification 有权
    压缩识别的方法和安排

    公开(公告)号:US09258767B2

    公开(公告)日:2016-02-09

    申请号:US13931916

    申请日:2013-06-29

    Inventor: Minyoung Park

    CPC classification number: H04W48/16 H04W48/12

    Abstract: Logic to reduce the probability of hashing collisions via a single hash function. Logic may hash the service set identification (SSID) to generate a compressed SSID and determine multiple compressed SSID segments based upon the compressed SSID. Logic may generate multiple SSID segments by hashing modified versions of the SSID or modifying hashed versions of the SSID. And logic may identify the compressed SSID segment with an index number. Logic may receive one or more compressed SSID segments, determine an index number associated with the segment(s) and compare the received SSID segment against a compressed SSID segment of an SSID that is sought. Logic may generate the multiple compressed SSID segments, store the segments in memory, and compare the compressed SSID segment received in a beacon with a corresponding compressed SSID segment in the memory.

    Abstract translation: 通过单个散列函数降低散列碰撞概率的逻辑。 逻辑可以使服务集标识(SSID)散列以产生压缩的SSID,并且基于压缩的SSID来确定多个压缩的SSID段。 逻辑可以通过对SSID的修改版本进行散列或修改散列版本的SSID来生成多个SSID段。 并且逻辑可以用索引号识别压缩的SSID段。 逻辑可以接收一个或多个压缩的SSID段,确定与段相关联的索引号,并将接收的SSID段与所寻求的SSID的压缩SSID段进行比较。 逻辑可以产生多个压缩的SSID段,将段存储在存储器中,并将在信标中接收的压缩SSID段与存储器中的对应的压缩SSID段进行比较。

    METHODS AND ARRANGEMENTS FOR FRAME TRANSMISSIONS

    公开(公告)号:US20180263006A9

    公开(公告)日:2018-09-13

    申请号:US15194567

    申请日:2016-06-28

    CPC classification number: H04W56/0015 H04L7/04 H04W56/00 H04W74/08

    Abstract: Logic to “loosely” manage synch frame transmissions in a synch network via the devices synched to the network that implement the logic. Logic may distributedly adjust the frequency of attempting synch frame transmissions without estimating the size of the neighborhood. Logic in devices of a synch network to let each device maintain a Transmission Window (TW). Logic to determine the frequency of attempting synch frame transmissions based upon the TW. Logic to increase TW if the device detects a synch frame transmission. Logic to decrease TW if the device successfully transmits a synch frame. Logic to balance power consumption and discovery timing by adjusting the decrease in TW responsive to a synch transmission in relation to the increase in TW responsive to detection of a synch transmitted by another device.

    Resource Pre-Allocation and Opportunistic Full-Duplex Downlink Transmission for Wireless Communication

    公开(公告)号:US20180097605A1

    公开(公告)日:2018-04-05

    申请号:US15282392

    申请日:2016-09-30

    CPC classification number: H04L5/14 H04L5/0007 H04W72/121 H04W74/04

    Abstract: This disclosure describes methods, apparatus, and systems related to resource pre-allocation and opportunistic full-duplex downlink transmissions for wireless communication. A device may determine a wireless communication sub-channel for uplink transmissions. The device may cause to send a full-duplex trigger frame including resource pre-allocation instructions for the sub-channel. The device may receive an uplink frame on the sub-channel. The device may receive first downlink data. The device may determine if an estimated downlink transmission time is less than an estimated residual uplink transmission time. The device may cause to send the first downlink data upon determining that the estimated downlink transmission time is not less than the estimated residual uplink transmission time. The device may cause to send the first downlink data and second downlink data upon determining that the estimated downlink transmission time is less than the estimated residual uplink transmission time.

Patent Agency Ranking