中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

91 records (took 0.023 seconds)

    TRIGGER-BASED RANDOM ACCESS IN A MULTIPLE BSSID NETWORK
    22.
    发明专利
    TRIGGER-BASED RANDOM ACCESS IN A MULTIPLE BSSID NETWORK 未知

    公开(公告)号：SG11201908209XA

    公开(公告)日：2019-11-28

    申请号：SG11201908209X

    申请日：2018-04-11

    Applicant: QUALCOMM INC

    Inventor： PATIL ABHISHEK PRAMOD ,  ASTERJADHI ALFRED ,  CHERIAN GEORGE

    IPC: H04W4/70 ,  H04W68/00 ,  H04W76/11

    Abstract: INTERNATIONAL APPLICATION PUBLISHED UNDER THE PATENT COOPERATION TREATY (PCT) (19) World Intellectual Property Organization International Bureau (43) International Publication Date 25 October 2018 (25.10.2018) WIP0 I PCT ill mu °million °nolo VIII VIII oimIE (10) International Publication Number WO 2018/194891 Al (51) International Patent Classification: H04W 68/00 (2009.01) H04W 76/11 (2018.01) H04W 4/70 (2018.01) (21) International Application Number: PCT/US2018/027094 (22) International Filing Date: 11 April 2018 (11.04.2018) (25) Filing Language: English (26) Publication Language: English (30) Priority Data: 62/486,451 17 April 2017 (17.04.2017) US 15/949,190 10 April 2018 (10.04.2018) US (71) Applicant: QUALCOMM INCORPORATED [US/US]; ATTN: International IP Administration, 5775 Morehouse Drive, San Diego, California 92121-1714 (US). (72) Inventors: PATIL, Abhishek Pramod; QUALCOMM In- corporated, ATTN: International IP Administration, 5775 Morehouse Drive, San Diego, California 92121-1714 (US). ASTERJADHI, Alfred; QUALCOMM Incorporated, AT- TN: International IP Administration, 5775 Morehouse Dri- ve, San Diego, California 92121-1714 (US). CHERIAN, George; QUALCOMM Incorporated, ATTN: International IP Administration, 5775 Morehouse Drive, San Diego, Cal- ifornia 92121-1714 (US). (74) Agent: PARADICE, William L. III; Paradice and Li LLP, 1999 S. Bascom Ave., Suite 300, Campbell, California 95008 (US). (81) Designated States (unless otherwise indicated, for every kind of national protection available): AE, AG, AL, AM, AO, AT, AU, AZ, BA, BB, BG, BH, BN, BR, BW, BY, BZ, CA, CH, CL, CN, CO, CR, CU, CZ, DE, DJ, DK, DM, DO, DZ, EC, EE, EG, ES, FI, GB, GD, GE, GH, GM, GT, HN, HR, HU, ID, IL, IN, IR, IS, JO, JP, KE, KG, KH, KN, KP, KR, KW, KZ, LA, LC, LK, LR, LS, LU, LY, MA, MD, ME, MG, MK, MN, MW, MX, MY, MZ, NA, NG, NI, NO, NZ, OM, PA, PE, PG, PH, PL, PT, QA, RO, RS, RU, RW, SA, SC, SD, SE, SG, SK, SL, SM, ST, SV, SY, TH, TJ, TM, TN, TR, TT, TZ, UA, UG, US, UZ, VC, VN, ZA, ZM, ZW. (84) Designated States (unless otherwise indicated, for every kind of regional protection available): ARIPO (BW, GH, GM, KE, LR, LS, MW, MZ, NA, RW, SD, SL, ST, SZ, TZ, UG, ZM, ZW), Eurasian (AM, AZ, BY, KG, KZ, RU, TJ, TM), European (AL, AT, BE, BG, CH, CY, CZ, DE, DK, EE, ES, FI, FR, GB, GR, HR, HU, IE, IS, IT, LT, LU, LV, MC, MK, MT, NL, NO, PL, PT, RO, RS, SE, SI, SK, SM, — (54) Title: TRIGGER-BASED RANDOM ACCESS IN A MULTIPLE BSSID NETWORK W O 20 18/ 19 489 1 Al 00 Allocate random access resources for use by stations belonging to the multiple BSSID set using a number of association identifier (AID) values based on a group AID mapping contained in a partial virtual bitmap of a traffic indicatio map (TIM) element. M) T; nrsrnit a trigger frame containi g the number of AID values to the. stations belonging to the multiple BSSID set. (119;1) Lan...it aan: rent frame including the partial virtual bitmap containing the group AID mapping_ (Lid) Include d random access parameter (RAPS) element indicating orthogonal frequency-division mu tiple access (DPW /X)contentior window values for stations associated with the first AP. (1104) Include one or more other RAPS element; indicating OFDMA contention .• i • !ow values for stations associ a ed with one or more corresponchw . , other APs. (1105) Figure 11A (57) : This disclosure provides systems, methods, and apparatuses for allocating wireless resources to a multiple basic service set identifier (BSSID) set including a number of BSSIDs each associated with a corresponding one of a num- ber of access points (APs). An AP may allocate random access resources for use by stations belonging to the multiple BSSID set using a number of association identifier (AID) values based on a group AID mapping contained in a partial vir- tual bitmap of a traffic indication map (TIM) element. The AP may transmit a trigger frame containing the number of AID values to the stations belonging to the multiple BSSID set. [Continued on next page] WO 2018/194891 Al MIDEDIMOM0101011EMMEMOMOHMOHERIMEHIMOVOIMIE TR), OAPI (BF, BJ, CF, CG, CI, CM, GA, GN, GQ, GW, KM, ML, MR, NE, SN, TD, TG). Published: — with international search report (Art. 21(3))

    TRAFFIC ADVERTISEMENT IN NEIGHBOR AWARE NETWORK (NAN) DATA PATH
    23.
    发明专利
    TRAFFIC ADVERTISEMENT IN NEIGHBOR AWARE NETWORK (NAN) DATA PATH 未知

    公开(公告)号：ZA201703703B

    公开(公告)日：2019-11-27

    申请号：ZA201703703

    申请日：2017-05-30

    Applicant: QUALCOMM INC

    Inventor： PATIL ABHISHEK PRAMOD ,  ABRAHAM SANTOSH PAUL ,  RAISSINIA ALIREZA ,  CHERIAN GEORGE

    Abstract: A method of communication includes generating a control message at a particular device. The control message indicates availability of data to be sent by the particular device. The data includes first data corresponding to a first access category. The method also includes, subsequent to determining that transmission of the control message is to be delayed, determining a first delay based on the first access category. The method further includes sending the control message from the particular device upon expiration of a delay period. The delay period is based on the first delay.

    Detección de pares en redes de enlace de datos asistidas por interconexión por conocimiento de vecinas (NAN)
    25.
    发明专利
    Detección de pares en redes de enlace de datos asistidas por interconexión por conocimiento de vecinas (NAN) 未知

    公开(公告)号：ES2703228T3

    公开(公告)日：2019-03-07

    申请号：ES15721932

    申请日：2015-04-22

    Applicant: QUALCOMM INC

    Inventor： PATIL ABHISHEK PRAMOD ,  ABRAHAM SANTOSH PAUL ,  CHERIAN GEORGE

    IPC: H04W8/00 ,  H04W84/12 ,  H04W84/18

    Abstract: Un procedimiento de comunicación inalámbrica de una primera estación (110), que comprende: detectar (802) una segunda estación (112) capaz de proporcionar un servicio de interés para la primera estación (110), la segunda estación (112) que es una de una pluralidad de estaciones (604, 610) que participan en una red de enlace de datos (130, 140, 302, 304, 306) de interconexión por conocimiento de vecindario, NAN, que proporciona el servicio de interés y admite comunicación a través de un canal de enlace de datos NAN (402) sin balizamiento, en el que la detección se produce a través de la comunicación a través de un canal NAN admitido por una pluralidad de estaciones de vecindario que forman una red NAN que tiene una operación de balizamiento que proporciona sincronización, y en el que la sincronización proporcionada a través del canal NAN admite la repetición de ventanas de transmisión en el canal de enlace de datos NAN (402) durante el que se espera que la primera estación (110) esté activa durante al menos una parte de una ventana de transmisión; y comunicarse (804) con la segunda estación (112) a través del canal de enlace de datos NAN (402).

    Improving transmission opportunity truncation
    26.
    发明专利
    Improving transmission opportunity truncation 未知

    公开(公告)号：AU2017332582A1

    公开(公告)日：2019-02-28

    申请号：AU2017332582

    申请日：2017-08-24

    Applicant: QUALCOMM INC

    Inventor： TIAN QINGJIANG ,  BARRIAC GWENDOLYN DENISE ,  PATIL ABHISHEK PRAMOD ,  ZHOU YAN ,  CHERIAN GEORGE ,  ASTERJADHI ALFRED ,  MERLIN SIMONE

    IPC: H04W74/08

    Abstract: This disclosure provides systems, methods, and apparatus, including computer programs encoded on computer storage media, for improving transmission opportunity (TxOP) truncation in wireless communication. In some implementations, a transmit opportunity (TxOP) period truncation or whether to update a network allocation vector (NAV) timing based on a message that includes transmitter and receiver information (such as a transmitter address (TA) and a receiver address (RA)) may be determined. For example, a station may receive a contention-free end (CF-End) frame and determine a TxOP period truncation based on comparing a TA and an RA included in the CF-End frame with a TA and an RA included in an earlier received message (e.g., an RTS). Such information may be compared to other TAs or RAs associated with NAV timing values and the NAV timing may be set, reset, updated, or canceled based on the comparison.

    ASSOCIATION LIMIT IN RELAY NETWORK
    30.
    发明专利
    ASSOCIATION LIMIT IN RELAY NETWORK 未知

    公开(公告)号：CA2918128A1

    公开(公告)日：2015-02-26

    申请号：CA2918128

    申请日：2014-08-12

    Applicant: QUALCOMM INC

    Inventor： JAFARIAN AMIN ,  CHERIAN GEORGE ,  TIMARIU LUIZA ,  PATIL ABHISHEK PRAMOD ,  ABRAHAM SANTOSH PAUL

    IPC: H04B7/26 ,  H04B7/15 ,  H04W76/02

    Abstract: A method, an apparatus, and a computer program product for wireless communication are provided. In aspect, a first apparatus receives from a second apparatus information related to an ability of the second apparatus to associate with other apparatuses, and limits associations at the first apparatus based on the information. In another aspect, the first apparatus associates with a second apparatus, and transmits to the second apparatus information that indicates a number of desirable associations at the second apparatus.

Patent Agency Ranking