IP Library › Granted Patent US 10,582,529
Granted Patent B2
US 10,582,529 · App. 15/915,491 · Granted Mar 3, 2020

Speculative scheduling in mobile networks

Inventors: Karthikeyan Sundaresan (Manalapan, NJ); Eugene Chai (Monmouth junstion, NJ); Mohammad Khojastepour (Lawrenceville, NJ); Sampath Rangarajan (Bridgewater, NJ)
Assignee: NEC Corporation
H04W72/1268H04W48/16H04W56/001H04W72/1226H04W72/1257H04W84/042H04W88/08
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 10,582,529
App. No.
15/915,491
Granted
Mar 3, 2020
Kind
B2
Abstract

A system is provided for speculative scheduling that includes a base station having a processor. The processor computes an overall schedule for a set of clients. The overall schedule is formed from a set of speculative schedules, is configured to maximize unlicensed spectrum usage, and is computed by (a) determining a speculative schedule for each resource block from a set of resource blocks in a given sub-frame based on statistics determined for the clients individually and jointly, and (b) selecting, for formation into the overall schedule, (i) a particular resource block and (ii) the speculative schedule for the particular resource block, that yield the maximum incremental utility relative to already determined speculative schedules for other resource blocks in the set, based on criteria including uplink access statistics. The processor executes the overall schedule responsive to a completion of the speculative schedule determination for each resource block in the given sub-frame.

Claims (27)

1. A system for speculative scheduling for mobile access in an unlicensed spectrum of a synchronous scheduled cellular access system, the system comprising:

a cellular base station having a processor, configured to compute an overall intelligent uplink schedule for a set of clients, the overall intelligent schedule being formed from a set of speculative schedules, being configured to maximize unlicensed spectrum usage, and being computed by

determining, by the processor, a speculative schedule for each resource block from among a set of resource blocks in a given sub-frame based on uplink access statistics determined for the clients individually and jointly; and

selecting, by the processor for formation into the overall intelligent schedule, (i) a particular resource block from the set and (ii) the speculative schedule for the particular resource block, that yield the maximum incremental utility relative to already determined speculative schedules for other ones of the resource blocks in the set, based on criteria that includes the uplink access statistics, and

wherein the processor executes the overall intelligent schedule responsive to a completion of the speculative schedule determination for each of the resource blocks in the given sub-frame;

wherein the processor determines the speculative schedule, for a remaining un-scheduled one of the resource blocks in the set, which yields the maximum incremental utility relative to the already determined speculative schedules;

wherein the processor determines the speculative schedule for the remaining un-scheduled one of the resource blocks in the set by adding one of the clients at a time such that the one of the clients yields the maximum incremental utility relative to the already determined speculative schedules for the other ones of the resource blocks in the set; and

where the maximum incremental utility provided by a group of the clients associated with the remaining un-scheduled one of the resource blocks in the set is weighted by a joint access probability of the clients in the group.

2. The system of claim 1 , wherein the joint access probability of the clients in the group constrains a total number of active ones of the clients in the group to be less than or equal to a total number of antennas at the cellular base station.

3. A computer-implemented method for speculative scheduling for mobile access in an unlicensed spectrum of a synchronous scheduled cellular access system, comprising:

computing, by a cellular base station having a processor, an overall intelligent uplink schedule for a set of clients, the overall intelligent schedule being formed from a set of speculative schedules, being configured to maximize unlicensed spectrum usage, and being computed by

determining, by the processor, a speculative schedule for each resource block from among a set of resource blocks in a given sub-frame based on uplink access statistics determined for the clients individually and jointly; and

selecting, by the processor for formation into the overall intelligent schedule, (i) a particular resource block from the set and (ii) the speculative schedule for the particular resource block, that yield the maximum incremental utility to already determined speculative schedules for other ones of the resource blocks in the set, based on criteria that includes the uplink access statistics,

executing, by the processor, the overall intelligent schedule responsive to a completion of each of the resource blocks in the sub-frame being scheduled; and

determining the speculative schedule, for a remaining un-scheduled one of the resource blocks in the set, which yields the maximum incremental utility relative to the already determined speculative schedules;

wherein the speculative schedule for the remaining un-scheduled one of the resource blocks in the set is determined by adding one of the clients at a time such that the one of the clients yields the maximum incremental utility relative to the already determined speculative schedules for the other ones of the resource blocks in the set;

where the maximum incremental utility provided by a group of the clients associated with the remaining un-scheduled one of the resource blocks in the set is weighted by a joint access probability of the clients in the group.

4. The computer-implemented method of claim 3 , wherein the joint access probability of the clients in the group constrains a total number of active ones of the clients in the group to be less than or equal to a total number of antennas at the cellular base station.

5. A computer program product for speculative scheduling for mobile access in an unlicensed spectrum of a synchronous scheduled cellular access system, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer for controlling a cellular base station to cause the computer to perform a method comprising:

computing, by a cellular base station having a processor, an overall intelligent uplink schedule for a set of clients, the overall intelligent schedule being formed from a set of speculative schedules, being configured to maximize unlicensed spectrum usage, and being computed by

determining, by the processor, a speculative schedule for each resource block from among a set of resource blocks in a given sub-frame based on uplink access statistics determined for the clients individually and jointly; and

selecting, by the processor for formation into the overall intelligent schedule, (i) a particular resource block from the set and (ii) the speculative schedule for the particular resource block, that yield the maximum incremental utility to already determined speculative schedules for other ones of the resource blocks in the set, based on criteria that includes the uplink access statistics,

executing, by the processor, the overall intelligent schedule responsive to a completion of each of the resource blocks in the sub-frame being scheduled; and

determining the speculative schedule, for a remaining un-scheduled one of the resource blocks in the set, which yields the maximum incremental utility relative to the already determined speculative schedules;

wherein the speculative schedule for the remaining un-scheduled one of the resource blocks in the set is determined by adding one of the clients at a time such that the one of the clients yields the maximum incremental utility relative to the already determined speculative schedules for the other ones of the resource blocks in the set;

where the maximum incremental utility provided by a group of the clients associated with the remaining un-scheduled one of the resource blocks in the set is weighted by a joint access probability of the clients in the group.

6. The computer program product of claim 5 , wherein the joint access probability of the clients in the group constrains a total number of active ones of the clients in the group to be less than or equal to a total number of antennas at the cellular base station.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 10, 2019
From: NEC LABORATORIES AMERICA, INC.
To: NEC CORPORATION
Reel/Frame 051238/0538 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 8, 2018
From: SUNDARESAN, KARTHIKEYAN; CHAI, EUGENE; KHOJASTEPOUR, MOHAMMAD; RANGARAJAN, SAMPATH
To: NEC LABORATORIES AMERICA, INC.
Reel/Frame 045144/0948 →
Continuity (3)
Provisional Application 62615478 · Jan 10, 2018
Provisional Application 62471549 · Mar 15, 2017
Related Publication 20180270849A1 · Sep 20, 2018