Method and apparatus for acquiring resources

1. A method for acquiring a resource, comprising:

acquiring a resource request index and a contention opportunity set;

acquiring a number of maximum contention times; and

determining a contention opportunity that UE participates in contention according to the acquired resource request index, the contention opportunity set and the number of the maximum contention times, and acquiring a resource for sending data by using the contention opportunity;

wherein the step of acquiring a resource request index and a contention opportunity set comprises:

the UE receiving the contention opportunity set and the resource request index allocated by a network to the UE; and

wherein the resource request index corresponds to a resource for sending data in the UE; and

the step of acquiring a number of maximum contention times comprises: the UE sending resource request information to the network by using the resource request index; and the UE receiving the number of the preconfigured maximum contention times from the network.

2. The method for acquiring a resource according to claim 1 , wherein the method further comprises: the network sending a contention offset constant to the UE.

3. The method for acquiring a resource according to claim 2 , wherein totally there are V contention opportunities in the contention opportunity set, and indexes of the V contention opportunities are respectively 0, 1, 2. . . (V−1), ); the number of the maximum contention times is K and the resource request index is I; and

the step of determining a contention opportunity that the UE participates in contention comprises:

an index R k (k=0, 1. . . (K−1)) of a contention opportunity that the UE participates in contention at a kth time is: R k =(I+C) mod V; wherein C is the contention offset constant.

4. The method for acquiring a resource according to claim 2 , wherein the resource request index is I and I is an integer; totally there are V contention opportunities in the contention opportunity set, and indexes of the V contention opportunities are respectively 0, 1, 2. . . (V−1); the number of the maximum contention times is K and the contention offset constant is C; and

the step of determining a contention opportunity that the UE participates in contention comprises: the UE determining that an index R k of a contention opportunity at a kth (k=0, 1, 2. . . (K−1)) time is: R k =kM+X k mod M; or

R

k

=

kM

+

⌊

MX

k

D

⌋

;

wherein

M

=

⌊

V

K

⌋

;

X

-

1

=

I

;

and

⁢

⁢

X

k

=

(

AX

K

-

1

+

C

)

⁢

mod

⁢

⁢

D

;

 and

wherein D is a positive integer greater than V and satisfies D=2 L or D=2 L +1; L is a positive integer; and if a minimum bit number used by a network side for allocating the resource request index is B, L is a number not smaller than B; and A is a number which is coprime with D.

5. The method for acquiring a resource according to claim 1 , wherein:

totally there are V contention opportunities in the contention opportunity set, and indexes of the V contention opportunities are respectively 0, 1, 2. . . (V−1); the number of the maximum contention times is K and the resource request index is I; and

the step of determining a contention opportunity that the UE participates in contention comprises:

an index R k (k=0, 1. . . (K−1)) of a contention opportunity that the UE participates in contention at a kth time is: R k =I mod V; wherein mod is a modulo operation.

6. The method for acquiring a resource according to claim 1 , wherein the resource request index is I and I is an integer; totally there are V contention opportunities in the contention opportunity set, and indexes of the V contention opportunities are respectively 0, 1, 2. . . (V−1); the number of the maximum contention times is K; and

the step of determining a contention opportunity that the UE participates in contention comprises: the UE determining that an index R k of a contention opportunity at a kth (k=0, 1, 2. . . (K−1)) time is: R k =kM+X k mod M; or

R

k

=

kM

+

⌊

MX

k

D

⌋

;

wherein

M

=

⌊

V

K

⌋

;

X

-

1

=

I

;

and

⁢

⁢

X

k

=

AX

K

-

1

⁢

mod

⁢

⁢

D

;

 and

wherein D is a positive integer greater than V and satisfies D=2 L or D=2 L +1; L is a positive integer; and if a minimum bit number used by a network side for allocating the resource request index is B, L is a number not smaller than B; and A is a number which is coprime with D.

7. The method for acquiring a resource according to claim 6 , wherein the A is the number which is coprime with D and satisfies

0.6

≤

A

D

≤

0.7

.

8. The method for acquiring a resource according to claim 7 , wherein the A is the number which is coprime with D and is closest to a golden ratio, wherein the golden ratio is

-

1

+

5

2

.

9. The method for acquiring a resource according to claim 1 , wherein the resource request index is a scheduling request channel index, a random access preamble index, or a measurement pilot index.

10. A method for acquiring a resource, comprising:

acquiring a resource request index and a contention opportunity set;

acquiring a number of maximum contention times; and

determining a contention opportunity that UE participates in contention according to the acquired resource request index, the contention opportunity set and the number of the maximum contention times, and acquiring a resource for sending data by using the contention opportunity;

wherein the step of acquiring a resource request index and a contention opportunity set comprises:

the UE receiving the contention opportunity set and the resource request index allocated by a network to the UE; and

wherein the resource request index is a scheduling request channel index or a measurement pilot index; and

the step of acquiring a number of maximum contention times comprises: the UE acquiring the number of the maximum contention times according to a period of a scheduling request channel or a measurement pilot allocated by the network.

11. The method for acquiring a resource according to claim 10 , wherein:

the period of the scheduling request channel or the measurement pilot allocated by the network to the UE is T; and

the step of acquiring the number of the maximum contention times according to the a period of a scheduling request channel or a measurement pilot allocated by the network comprises: obtaining the number of the maximum contention times according to a formula T max /T, wherein T max is a time constant appointed by the network and the UE.

12. The method for acquiring a resource according to claim 11 , wherein the time constant T max is a maximum period of the scheduling request channel or the measurement pilot.

13. A non-transitory carrier for storing computer programs including program instructions, wherein when the program instructions are executed by a computer, the computer is configured to implement the following steps:

acquiring a resource request index, a contention opportunity set, and a number of maximum contention times; and

determining a contention opportunity that UE participates in contention according to the acquired resource request index, the contention opportunity set and the number of the maximum contention times, and acquiring a resource for sending data by using the contention opportunity;

wherein the computer is configured in the UE, and the computer is further configured to implement the following steps:

receiving the contention opportunity set and the resource request index allocated by a network to the UE; and under the condition that the resource request index corresponds to a resource for sending data in the UE, sending resource request information to the network by using the resource request index, and receiving the number of the preconfigured maximum contention times from the network; or under the condition that the resource request index is a scheduling request channel index or a measurement pilot index, acquiring the number of the maximum contention times according to a period of a scheduling request channel or a measurement pilot allocated by the network.