Blue-printing interference for LTE access in unlicensed spectrum

1. A system for blue-printing interference 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

construct and execute an intelligent measurement schedule of clients for uplink transmissions to obtain access measurements for the uplink transmissions, the intelligent measurement schedule being constructed for scalable access measurement overhead, the access measurements indicating interference dependencies between the clients;

estimate an interference topology and statistics of the interference topology, from the access measurements to form an interference blueprint;

adjust the intelligent measurement schedule to overschedule the clients for the uplink transmissions to reduce spectrum utilization loss while minimizing client transmission collisions, based on the interference blueprint; and

initiate the uplink transmissions for the clients in accordance with the adjusted intelligent measurement schedule.

2. The system of claim 1 , wherein the intelligent measurement schedule is constructed with a preference for obtaining the access information versus uplink performance.

3. The system of claim 1 , wherein the intelligent measurement schedule is constructed to minimize the access measurement overhead.

4. The system of claim 1 , wherein the processor constructs the intelligent measurement schedule to jointly schedule pairs of the clients and execute the intelligent measurement schedule to obtain the access measurements and from which to infer individual and pair-wise access probabilities of the clients.

5. The system of claim 1 , wherein the interference topology and the statistics of the inference topology are estimated using a graphical constraint satisfiability problem solvable by a transformation applied to access probabilities of individual ones and pairs of the clients.

6. The system of claim 5 , wherein a number of hidden interfering terminals, access probabilities of the hidden interfering terminals, and interference dependencies between the hidden interfering terminals are determined by solving the graphical constraint satisfiability problem.

7. The system of claim 5 , wherein the graphical constraint satisfiability problem involves a graph having (i) a first set of vertices representing the clients and having a value that is a function of the access probabilities of the individual ones of the clients, (ii) a second set of vertices representing a set of unknown number of hidden interfering terminals and respective unknown access probabilities for the set of unknown number of hidden interfering terminals, and (iii) a third set of vertices representing pairs of clients with a value that is a function of joint access probabilities for the pairs of the clients.

8. The system of claim 5 , wherein the graphical constraint satisfiability problem is solved by using an iterative process that comprises the processor (i) initializing a starting inference topology randomly from among a set of interfering topologies, (ii) at every iteration, adopting a gradient approach that picks a constraint, from a set of constraints, that yields a maximum violation, and selecting a topology adaptation that resolves the maximum violation while minimizing other respective violations caused by other ones of the constraints in the set, and (iii) select a respective one of the interfering topologies from the set having a violation below a threshold amount.

9. The system of claim 1 , wherein the intelligent measurement schedule is constructed by adding clients, one at a time, to the intelligent measurement schedule as transmission slots such that each of the added clients yields a maximum value for measurement statistics based on a current state of the intelligent measurement schedule.

10. The system of claim 1 , wherein the interference topology and the statistics of the interference topology relate to a set of hidden terminals.

11. A computer-implemented method for blue-printing interference for mobile access in an unlicensed spectrum of a synchronous scheduled cellular access system, the method comprising:

constructing and executing, by a processor of a cellular base station, an intelligent measurement schedule of clients for uplink transmissions to obtain access measurements for the uplink transmissions, the intelligent measurement schedule being constructed for scalable access measurement overhead, the access measurements indicating interference dependencies between the clients;

estimating, by the processor, an interference topology and statistics of the interference topology, from the access measurements to form an interference blueprint;

adjusting, by the processor, the intelligent measurement schedule to overschedule the clients for the uplink transmissions to reduce spectrum utilization loss while minimizing client transmission collisions, based on the interference blueprint; and

initiating, by the processor, the uplink transmissions for the clients in accordance with the adjusted intelligent measurement schedule.

12. The computer-implemented method of claim 11 , wherein the intelligent measurement schedule is constructed with a preference for obtaining the access information versus uplink performance.

13. The computer-implemented method of claim 11 , wherein the intelligent measurement schedule is constructed to minimize the access measurement overhead.

14. The computer-implemented method of claim 11 , wherein the processor constructs the intelligent measurement schedule to jointly schedule pairs of the clients and execute the intelligent measurement schedule to obtain the access measurements from which to infer individual and pair-wise access probabilities of the clients.

15. The computer-implemented method of claim 11 , wherein the interference topology and the statistics of the inference topology are estimated using a graphical constraint satisfiability problem solvable by a transformation applied to access probabilities of individual ones and pairs of the clients.

16. The computer-implemented method of claim 15 , wherein a number of hidden interfering terminals, access probabilities of the hidden interfering terminals, and interference dependencies between the hidden interfering terminals are determined by solving the graphical constraint satisfiability problem.

17. The computer-implemented method of claim 15 , wherein the graphical constraint satisfiability problem involves a graph having (i) a first set of vertices representing the clients and having a value that is a function of the access probabilities of the individual ones of the clients, (ii) a second set of vertices representing a set of unknown number of hidden interfering terminals and respective unknown access probabilities for the set of unknown number of hidden interfering terminals, and (iii) a third set of vertices representing pairs of clients with a value that is a function of joint access probabilities for the pairs of the clients.

18. The computer-implemented method of claim 15 , wherein the graphical constraint satisfiability problem is solved by using an iterative process that comprises the processor (i) initializing a starting inference topology randomly from among a set of interfering topologies, (ii) at every iteration, adopting a gradient approach that picks a constraint, from a set of constraints, that yields a maximum violation, and selecting a topology adaptation that resolves the maximum violation while minimizing other respective violations caused by other ones of the constraints in the set, and (iii) select a respective one of the interfering topologies from the set having a violation below a threshold amount.

19. The computer-implemented method of claim 11 , wherein the intelligent measurement schedule is constructed by adding clients, one at a time, to the intelligent m measurement schedule as transmission slots such that each of the added clients yields a maximum value for measurement statistics based on a current state of the intelligent measurement schedule.

20. A computer program product for blue-printing interference 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 of a cellular base station to cause the computer to perform a method comprising:

constructing and executing, by a processor of the computer, an intelligent measurement schedule of clients for uplink transmissions to obtain access measurements for the uplink transmissions, the intelligent measurement schedule being constructed for scalable access measurement overhead, the access measurements indicating interference dependencies between the clients;

estimating, by the processor, an interference topology and statistics of the interference topology, from the access measurements to form an interference blueprint;

adjusting, by the processor, the intelligent measurement schedule to overschedule the clients for the uplink transmissions to reduce spectrum utilization loss while minimizing client transmission collisions, based on the interference blueprint; and

initiating, by the processor, the uplink transmissions for the clients in accordance with the adjusted intelligent measurement schedule.