IP Library Granted Patent US 9,531,523
Granted Patent B2
US 9,531,523 · App. 14/021,373 · Granted Dec 27, 2016

Sectorization for grouping terminals

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,531,523
App. No.
14/021,373
Granted
Dec 27, 2016
Kind
B2
Abstract

A geographic region in which an access point AP lies is divided into sectors, each sector associated with a group; and a station is assigned to a group based on location information of the station relative to the sectors. The station can assign itself to a group autonomously, after determining the number of groups from signalling received from the AP. Or the AP can do the group assignments, such as by assessing distance between adjacent stations. The AP can utilize the station's location information to test whether a first link between the station and a first node of a first group is sufficient. If the test indicates that the first link is sufficient the AP can assign the station to the first group, else it will utilize the location information to test whether a second link between the station and a second node of a second group is sufficient.

Claims (40)

1. A method for operating a wireless communications device, comprising:

utilizing geographic location information of a station to determine a first node of a plurality of nodes belonging to a first group, the fist node being a furthest Euclidean distance from the station than other nodes in the plurality of nodes belonging to the first group;

determining whether the station and the first node can communicate based on communications between the station and the first node;

assigning the station to the first group if the first node and the station can communicate;

if the station and the first node cannot communicate, utilizing the geographic location information of the station to determine a second node of a plurality of nodes belonging to a second group, the second node being a furthest Euclidean distance from the station than other nodes in the plurality of nodes belonging to the second group;

determining whether the second node and the station can communicate based on communications between the station and the second node; and

assigning the station to the second group if the second node and the station can communicate, the station not being assigned to the second group if the second node and the station cannot communicate,

wherein determining whether the first node and the station can communicate is further based on at least two of:

transmission rate on respective first and second links between the first node and the station;

path loss on the respective first and second links; and

antenna gain at either or both of the station and the first node.

2. The method according to claim 1 , wherein determining whether the station and the first node can communicate includes a two way test comprising testing communication via a link from the first node to the station and testing communication via a link from the station to the first node.

3. An apparatus for communicating comprising:

at least one processor and at least one memory, the processor being configured to:

utilize geographic location information of a station to determine a first node of a plurality of nodes belonging to a first group, the first node being a furthest Euclidean distance from the station than other nodes in the plurality of nodes belonging to the first group;

determine whether the station and the first node can communicate based on communications between the station and the first node;

assign the station to the first group if the station and the first node can communicate; and

if the first node and the station cannot communicate, utilize the geographic location information of the station to determine a second node of a plurality of nodes that belong to a second group, the second node being a furthest Euclidean distance from the station than other nodes in the plurality of nodes that belong to the second group;

determine whether the second node and the station can communicate based on communications between the station and the second node; and

assign the station to the second group if the station and the second node can communicate, the station not being assigned to the second group if the second node and the station cannot communicate,

wherein determination of whether the first node and the station can communicate is further based on at least two of:

transmission rate on respective first and second links between the first node and the station;

path loss on the respective first and second links; and

antenna gain at either or both of the station and the first node.

4. The apparatus according to claim 3 , wherein the processor determines whether the first node and the station can communicate using a two way test comprising a test of communication via a link from the first node to the station and a test of communication via a link from the station to the first node.

5. The apparatus according to claim 3 , wherein in which whether the first node and the station can communicate is determined based on transmit power of the first node and the station.

6. The apparatus according to claim 3 , wherein in which the apparatus comprises an access point and the processor further determines whether the station is able to communicate with each of the plurality of nodes in the first group, and assigns the station to the first group only if the station is able to communicate with each of the plurality of nodes in the first group.

7. The apparatus according to claim 6 , wherein the processor is further configured to cause the apparatus to send, to the station, contention factors which are specific for the first group when the station is assigned to the first group.

8. A non-transitory computer-readable medium encoded with computer-readable instructions thereon that, when executed by a processor, cause the processor to perform a method comprising:

utilizing geographic location information of a station to determine a first node of a plurality of nodes belonging to a first group, the first node being a furthest Euclidean distance from the station than other nodes of the plurality of nodes belonging to the first group;

determining whether the station and the first node can communicate based on communications between the station and the first node;

assigning the station to the first group if the station and the first node can communicate;

if the station and the first node cannot communicate, utilizing the geographic location information of the station to determine a second node of a plurality of nodes belonging to a second group, the second node being a furthest Euclidean distance from the station than other nodes in the plurality of nodes belonging to the second group;

determining whether the station and the second node can communicate based on communications between the station and the second node; and

assigning the station to the second group if the station and the second node can communicate, the station not being assigned to the second group if the second node and the station cannot communicate,

wherein determining whether the first node and the station can communicate is further based on at least two of:

transmission rate on respective first and second links between the first node and the station;

path loss on the respective first and second links; and

antenna gain at either or both of the station and the first node.

9. The non-transitory computer-readable medium according to claim 8 , wherein determining whether the station and the first node can communicate includes a two way test of testing communication via a link from the first node to the station and testing communication via a link from the station to the first node.

Assignments (9)
CORRECTIVE ASSIGNMENT TO CORRECT THE EXECUTION DATE PREVIOUSLY RECORDED AT REEL: 047422 FRAME: 0464. ASSIGNOR(S) HEREBY CONFIRMS THE MERGER. Recorded Mar 6, 2019
From: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
To: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED
Reel/Frame 048883/0702 →
MERGER Recorded Oct 5, 2018
From: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
To: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED
Reel/Frame 047422/0464 →
CORRECTIVE ASSIGNMENT TO CORRECT THE CONVEYING PARTY PREVIOUSLY RECORDED ON REEL 032086 FRAME 0389. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT FROM ONE OR BOTH ASSIGNORS ACCORDING TO PRIOR AGREEMENT.. Recorded Dec 18, 2017
From: RENESAS MOBILE CORPORATION
To: BROADCOM INTERNATIONAL LIMITED
Reel/Frame 046266/0231 →
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS Recorded Feb 3, 2017
From: BANK OF AMERICA, N.A., AS COLLATERAL AGENT
To: BROADCOM CORPORATION
Reel/Frame 041712/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 1, 2017
From: BROADCOM CORPORATION
To: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
Reel/Frame 041706/0001 →
PATENT SECURITY AGREEMENT Recorded Feb 11, 2016
From: BROADCOM CORPORATION
To: BANK OF AMERICA, N.A., AS COLLATERAL AGENT
Reel/Frame 037806/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 20, 2014
From: BROADCOM INTERNATIONAL LIMITED
To: BROADCOM CORPORATION
Reel/Frame 032088/0794 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 17, 2014
From: RENESAS ELECTRONICS CORPORATION; RENESAS MOBILE CORPORATION
To: BROADCOM INTERNATIONAL LIMITED
Reel/Frame 032086/0389 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 9, 2013
From: PANTELIDOU, ANNA; WESTMAN, JARI TAPANI
To: RENESAS MOBILE CORPORATION
Reel/Frame 031165/0992 →