WO2018006759A1 - Channel access method, apparatus and system, and storage medium - Google Patents

Channel access method, apparatus and system, and storage medium Download PDF

Info

Publication number
WO2018006759A1
WO2018006759A1 PCT/CN2017/091227 CN2017091227W WO2018006759A1 WO 2018006759 A1 WO2018006759 A1 WO 2018006759A1 CN 2017091227 W CN2017091227 W CN 2017091227W WO 2018006759 A1 WO2018006759 A1 WO 2018006759A1
Authority
WO
WIPO (PCT)
Prior art keywords
terminal
transmission request
random
transmission
pseudo
Prior art date
Application number
PCT/CN2017/091227
Other languages
French (fr)
Chinese (zh)
Inventor
许文俊
赵捷
付卓然
张玉佩
苟伟
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2018006759A1 publication Critical patent/WO2018006759A1/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor

Definitions

  • the present invention relates to the field of communications, and in particular to a channel access method, apparatus and system, and storage medium.
  • D2D device-to-device
  • channel access technology mainly focuses on a wireless local area network.
  • distributed media access technology for wireless local area networks semi-random backoff method for realizing resource reservation in wireless local area networks, and the like.
  • the probability of collision increases greatly, resulting in serious waste of resources.
  • the embodiments of the present invention provide a channel access method, device, system, and storage medium, to at least solve the problem of low resource utilization during channel access in the related art.
  • a channel access method including: receiving a transmission request sent by a device to a device D2D terminal, wherein the transmission request is used to request allocation of a transmission resource; The D2D terminal and the transmission peer of the D2D terminal allocate the same random seed resource; wherein the random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and use the pseudo random sequence for channel access.
  • the transmission request sent by the receiving device to the device D2D terminal includes: receiving D2D
  • the terminal uses the physical uplink control channel PUCCH to request an uplink resource transmitted by the SR through an uplink scheduling; and receives the transmission request on the uplink resource.
  • the method further includes: summarizing one or A transmission request sent by a plurality of D2D terminals, and parsing the data amount and/or service type of the transmission service requested by each transmission request.
  • allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request includes: according to the data volume and/or the service type, to the D2D terminal and the The transmission peer of the D2D terminal allocates the same random seed resource.
  • allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request includes: transmitting, to the D2D terminal and the D2D terminal, a transmission peer according to the transmission request Allocating the same dedicated time slot; and/or pre-assigning the same spare time slot to the D2D terminal and the transmission peer of the D2D terminal according to the transmission request.
  • allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request includes one of: following the transmission request to the D2D terminal and the D2D terminal Allocating one or more identical random seed resources to the transmitting peer; allocating the same random seed resource, offset, and random seed resource to the D2D terminal and the transmitting peer of the D2D terminal according to the transmission request The number of resource block units MRB corresponding to the time slots included.
  • another channel access method including: transmitting a transmission request to a base station, and receiving a random seed resource allocated by the base station according to the transmission request; and pre-predetermining based on the random seed resource
  • the algorithm is configured to generate a corresponding pseudo-random sequence; channel access is performed according to the pseudo-random sequence.
  • performing channel access according to the pseudo random sequence includes: obtaining a resource block number of a corresponding resource block unit MRB according to the pseudo random sequence; accessing a channel to which the MRB corresponding to the resource block number belongs.
  • the random seed resource comprises a dedicated time slot and/or a spare time slot.
  • the preset algorithm includes one of the following: a Kent mapping, a linear congruence method.
  • generating a pseudo-random sequence of a preset length according to the Kent mapping according to the random seed resource includes:
  • the pseudo-random sequence x n+1 is calculated according to the following formula:
  • x n is a pseudo-random sequence with slot number n
  • n is the slot number
  • a is a constant, a ⁇ (0, 1).
  • the length of the pseudo random sequence is the same as the number of the time slots.
  • the a 0.7.
  • generating a corresponding pseudo random sequence according to the preset algorithm based on the random seed resource comprises: calculating the pseudo random sequence x n+1 x n according to the following formula: +1 :
  • n is an integer greater than A
  • A is the number of MRBs of a single time slot included in the random seed
  • a and c are preset values associated with the A
  • x n is a slot number n A pseudo-random sequence, where n is the slot number.
  • a channel access apparatus comprising: a receiving module, configured to receive a transmission request sent by a device to a device D2D terminal, wherein the transmission request is used to request allocation of a transmission resource; a module, configured to allocate the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request; The random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and utilize the pseudo random sequence for channel access.
  • another channel access apparatus comprising: a requesting module, configured to send a transmission request to a base station, and receive a random seed resource allocated by the base station according to the transmission request; a calculation module And setting, according to the random seed resource, a corresponding pseudo random sequence according to a preset algorithm; and the access module is configured to perform channel access according to the pseudo random sequence.
  • a channel access system including: a transmitting end of D2D communication, a receiving end of D2D communication, and a base station, the base station further comprising: a first receiving module, configured to receive the a transmission request sent by the sending end, where the transmission request is used to request to allocate a transmission resource; and an allocation module is configured to allocate the same random seed resource to the sending end and the receiving end according to the transmission request;
  • the sending end includes: a requesting module, configured to send the transmission request to a base station, and receive a random seed resource that is allocated by the base station according to the transmission request; and the first calculating module is configured to preset according to the random seed resource Setting an algorithm to generate a corresponding pseudo-random sequence; the first access module is configured to perform channel access according to the pseudo-random sequence;
  • the receiving end includes: a second receiving module, configured to receive a random seed resource allocated by the base station according to the transmission request; and a second calculating module, configured to generate a corresponding pseudo random according to the preset algorithm according to the preset algorithm a sequence; a second access module configured to perform channel access according to the pseudo-random sequence.
  • a storage medium is also provided.
  • the storage medium is arranged to store program code for performing the following steps:
  • the random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence. And using the pseudo random sequence for channel access.
  • a transmission request sent by a device to a device D2D terminal is used, wherein the transmission request is used to request allocation of a transmission resource, and then, according to the transmission request, to a transmission end of the D2D terminal and the D2D terminal.
  • the randomness is better, so the probability of accessing the same resource in the same time slot is reduced, the resource collision occurring during the contention access can be reduced, and the resource access between the D2D terminals can be quickly realized without being controlled by the base station.
  • the problem of low resource utilization in channel access in the related art can be solved.
  • FIG. 1 is a network architecture diagram in accordance with an embodiment of the present invention.
  • FIG. 2 is a flowchart of a channel access method according to an embodiment of the present invention.
  • FIG. 3 is a flowchart of another channel access method according to an embodiment of the present invention.
  • FIG. 4 is a structural block diagram of a channel access apparatus according to an embodiment of the present invention.
  • FIG. 5 is a structural block diagram of another channel access apparatus according to an embodiment of the present invention.
  • FIG. 6 is a structural block diagram of a channel access system according to an embodiment of the present invention.
  • FIG. 7 is a schematic diagram of an application scenario according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of a base station assigning a random seed according to an embodiment of the present invention.
  • FIG. 9 is an optional flowchart 1 for generating a pseudo-random sequence according to an embodiment of the present invention.
  • FIG. 10 is a schematic diagram of channel access based on a chaotic sequence according to an embodiment of the present invention.
  • 11 is an optional flowchart 2 for generating a pseudo-random sequence according to an embodiment of the present invention.
  • Figure 12 is a flow diagram of a transmission in accordance with an embodiment of the present invention.
  • FIG. 1 is a network architecture diagram according to an embodiment of the present invention.
  • the network architecture includes: a base station, multiple terminals, and two A D2D link (D2D communication link) is formed between the terminals, and the base station is connected to the terminal.
  • D2D link D2D communication link
  • FIG. 2 is a flowchart of a channel access method according to an embodiment of the present invention. As shown in FIG. 2, the process includes the following steps. :
  • Step S202 receiving a transmission request sent by the device to the device D2D terminal, where the transmission request is used to request to allocate a transmission resource;
  • Step S204 Allocating the same random seed resource to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request; optionally, the transmission peers of the D2D terminal and the D2D terminal are respectively a transmitting end and a receiving end;
  • the random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and uses a pseudo random sequence for channel access.
  • a transmission request sent by the device to the device D2D terminal wherein the transmission request is used to request allocation of a transmission resource, and then allocating the same to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request Random seed resource, wherein The random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and utilize the pseudo random sequence for channel access. Since the same random seed resource is allocated to the transmitting end and the receiving end of the D2D communication, a consistent pseudo-random sequence can be generated at both ends of the transmitting and receiving, which can improve the utilization of the radio resource due to the pseudo-random sequence generated between different pairs of D2D terminals.
  • the randomness is better, so the probability of accessing the same resource in the same time slot is reduced, the resource collision occurring during the contention access can be reduced, and the resource access between the D2D terminals can be quickly realized without being controlled by the base station.
  • the problem of low resource utilization in channel access in the related art can be solved.
  • the execution body of the foregoing step may be a network side device, such as a base station, etc., but is not limited thereto.
  • the transmission request sent by the receiving device to the device D2D terminal includes: receiving, by the D2D terminal, an uplink resource that is sent by the uplink scheduling request SR by using a Physical Uplink Control Channel (PUCCH), where the uplink resource is sent.
  • PUCCH Physical Uplink Control Channel
  • the method before allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request, further includes: summarizing the transmission request sent by the one or more D2D terminals separately in a preset time window And parsing the amount of data and/or service type of the transport service requested by each transport request. Further, allocating the same random seed resource to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request includes: allocating the same random seed resource to the transmission peers of the D2D terminal and the D2D terminal according to the data volume and/or the service type.
  • allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request includes the following two types:
  • the same spare time slot is pre-allocated to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request.
  • allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request includes one of the following methods:
  • the number of resource blocks (Mini Resource Blocks, abbreviated as MRBs) corresponding to the time slots included in the random seed resources is allocated to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request.
  • FIG. 3 is a flowchart of another channel access method according to an embodiment of the present invention. The process includes the following steps:
  • Step S302 Send a transmission request to the base station, and receive a random seed resource allocated by the base station according to the transmission request.
  • Step S304 generating a corresponding pseudo random sequence according to a preset algorithm based on the random seed resource
  • Step S306 performing channel access according to a pseudo random sequence.
  • the execution body of the foregoing steps may be a D2D terminal or the like, but is not limited thereto.
  • the D2D terminal is the receiving end of the D2D communication
  • the transmitting of the transmission request to the base station is not included, including receiving the random seed resource allocated by the base station according to the transmission request.
  • performing channel access according to the pseudo random sequence specifically includes:
  • the random seed resource includes a dedicated time slot and/or a spare time slot.
  • the preset algorithm includes multiple types, and only Kent mapping and linear congruence methods are used here for illustration:
  • generating a pseudo-random sequence of a preset length according to the Kent mapping based on the random seed resource includes:
  • x n is a pseudo-random sequence with slot number n
  • the length of the pseudo-random sequence is the same as the number of slots
  • n is the slot number
  • a is a constant
  • the pseudo random sequence has the same length as the number of slots.
  • generating a corresponding pseudo-random sequence according to a preset algorithm based on the random seed resource includes:
  • n is an integer greater than A
  • A is the number of MRBs of a single time slot included in the random seed
  • a and c are preset values associated with the A
  • x n is a slot number n A pseudo-random sequence, where n is the slot number.
  • the m i m i is the pseudo-random sequence distribution in the range [0,1] is a random value
  • A is the random number seed corresponding to MRB frequency domain within a single slot included
  • [] Indicates rounding down
  • i is the slot number.
  • the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is A better implementation.
  • the technical solution of the present invention which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk,
  • the optical disc includes a number of instructions for causing a terminal device (which may be a cell phone, a computer, a server, or a network device, etc.) to perform the methods of various embodiments of the present invention.
  • a channel access device and a system are also provided in this embodiment.
  • the device and the system are used to implement the foregoing embodiments and preferred embodiments, and are not described again.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 4 is a structural block diagram of a channel access apparatus according to an embodiment of the present invention. As shown in FIG. 4, the apparatus includes:
  • the receiving module 40 is configured to receive a transmission request sent by the device to the device D2D terminal, where the transmission request is used to request to allocate a transmission resource;
  • the allocating module 42 is configured to allocate the same random seed resource to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request;
  • the random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and uses a pseudo random sequence for channel access.
  • FIG. 5 is a structural block diagram of another channel access apparatus according to an embodiment of the present invention. As shown in FIG. 5, the apparatus includes:
  • the requesting module 50 is configured to send a transmission request to the base station, and receive a random seed resource allocated by the base station according to the transmission request;
  • the calculating module 52 is configured to generate a corresponding pseudo random sequence according to a preset algorithm based on the random seed resource;
  • the access module 54 is configured to perform channel access according to a pseudo random sequence.
  • FIG. 6 is a structural block diagram of a channel access system according to an embodiment of the present invention. As shown in FIG. 6, the system includes: a transmitting end 60 of D2D communication, a receiving end 62 of D2D communication, and a base station 64.
  • Base station 64 also includes:
  • the first receiving module 640 is configured to receive a transmission request sent by the sending end, where the transmission request is used to request to allocate a transmission resource;
  • the allocating module 642 is configured to allocate the same random seed resource to the sending end and the receiving end according to the transmission request;
  • the sending end 60 includes:
  • the requesting module 600 is configured to send a transmission request to the base station, and receive a random seed resource allocated by the base station according to the transmission request;
  • the first calculating module 602 is configured to generate a corresponding pseudo random sequence according to a preset algorithm based on the random seed resource;
  • the first access module 604 is configured to perform channel access according to a pseudo random sequence
  • the receiving end 62 includes:
  • the second receiving module 620 is configured to receive a random seed resource allocated by the base station according to the transmission request.
  • the second calculating module 622 is configured to generate a corresponding pseudo random sequence according to a preset algorithm based on the random seed resource;
  • the second access module 624 is configured to perform channel access according to a pseudo random sequence.
  • each of the above modules may be implemented by software or hardware.
  • the foregoing may be implemented by, but not limited to, the foregoing modules are all located in the same processor; or, the above modules are in any combination.
  • the forms are located in different processors.
  • This embodiment is an optional embodiment according to the present invention, which is used to describe the present application in detail in conjunction with specific scenarios and examples:
  • a semi-random channel access method based on a pseudo-random sequence is proposed, which can reduce the collision probability caused by random backoff, and can solve how to quickly connect the receiving end and the transmitting end without being controlled by the base station. problem.
  • the present invention takes the channel access of D2D communication in an unlicensed frequency band as an example to improve the deficiencies of the existing solutions, further reduce the delay of data transmission, improve resource utilization, and improve user experience. Therefore, the present invention focuses on channel access technology of D2D communication in an unlicensed frequency band, and considers how to reduce collision problems between different D2D UEs, and Solve the following technical problems in the related art:
  • the base station When the D2D UE has a transmission requirement and reports to the base station, the base station performs complete resource allocation on the dedicated time slot according to the reporting result, performs resource pre-allocation on the spare time slot, and assigns different D2D pairs to different D2D pairs. Random seed.
  • Different D2D UEs use the unlicensed frequency band for related transmission according to the arbitration result of the base station.
  • the D2D UE In the shared time slot, the D2D UE generates a semi-random channel access according to different random sequences of the same length according to the random seed, thereby reducing the possibility of collision between different D2D UEs.
  • the minimum unit of the communication length of the D2D communication frame is the MRB (Mini Resource Block), and the base station performs scheduling of the communication resources in units of MRB according to the service and data amount reported by the D2D user.
  • MRB Minimum Resource Block
  • the present invention proposes a semi-random channel access method based on a pseudo-random sequence.
  • the method of assigning a random seed by the base station is used to control the D2D UE to generate a corresponding pseudo random sequence, and the pseudo random sequence is used for channel access.
  • the invention can ensure the resource access of the D2D UE can be quickly realized without being controlled by the base station while improving the resource utilization rate and reducing the collision probability.
  • the embodiment is divided into two parts: a base station allocation random seed embodiment and a pseudo random sequence based channel access transmission embodiment.
  • FIG. 7 is a schematic diagram of an application scenario according to an embodiment of the present invention. As shown,
  • This scenario is mainly for D2D access problems in unlicensed bands.
  • the base station is still required to perform scheduling control to deliver random seeds for different D2D pairs.
  • FIG. 8 is a schematic diagram of a base station assigning a random seed according to an embodiment of the present invention, and the specific process is as follows:
  • Step 1 The D2D UE reports a data transmission request: the UE that needs to perform the D2D communication in the unlicensed frequency band reports the transmission request to the base station, and uses the PUCCH to request the base station to allocate the corresponding resource by using the scheduling request (Scheduling Request, SR for short). ;
  • Step 2 The base station aggregates and allocates random seeds: within a certain time window, the base station aggregates transmission requests of different D2D UEs, and performs resource allocation according to the type of service and the amount of data.
  • the dedicated time slot is completely allocated by the base station, and the base station allocates the same random seed for the D2D pair (the transmitting end and the receiving end of the D2D communication), and the random seeds of the different D2D pairs are different.
  • the invention aims to design a suitable channel access mode, improve resource utilization, and realize fast resource access between D2D pairs without being controlled by the base station.
  • This embodiment adopts two methods for generating a pseudo-random sequence, and uses the generated pseudo-random sequence to perform semi-random channel access.
  • FIG. 9 is an optional flowchart 1 for generating a pseudo-random sequence according to an embodiment of the present invention. As shown in FIG. 9, the method 1 includes the following:
  • Step 1 Assume that there are two pairs of D2D pairs denoted as D2D UE1 (transmitting end) and D2D UE2 (receiving end), D2D UE3 (transmitting end) and D2D UE4 (receiving end), respectively.
  • D2D UE1 and D2D UE2 have the same random seed S 1
  • D2D UE 3 and D2D UE4 have the same random seed S 2 .
  • Using different random seeds S 1 and S 2 are mapped according to Kent generating pseudo random sequence length L 1 and l are L 2.
  • the random seed is allocated by the base station and has a value range of (0, 1).
  • the Kent map is a chaotic map with piecewise linearity.
  • the dynamic equation is:
  • the random seed S 1 corresponds to the initial value of the above dynamic equation, with which the pseudo-random sequence L 1 of length l is generated.
  • the D2D UE3 and the D2D UE4 use the random seed S 2 to generate a random sequence L 2 of the same length l.
  • the sequence length is equal to the number of slots in the shared slot. If the duration of the shared time slot is 4 ms, the random sequence length l is 4.
  • the length of the generated random sequence should be 4, and the chaotic sequence generated by Kent mapping is 0.7143, 0.9524, 0.1587, 0.2268.
  • This example corresponds to the case where the D2D UE allocates only one MRB in one time slot.
  • the calculation method corresponds to the following:
  • the service that the D2D UE needs to transmit may require multiple MRBs to complete.
  • This embodiment provides the following methods for allocating multiple MRBs for one D2D UE corresponding to one time slot. It is assumed that four time slots are required, and each time slot needs to allocate three MRBs for one D2D UE, where
  • the base station directly delivers three random seeds, and three random sequences can be generated corresponding to different random seeds. For example, the base station assigns random seeds 0.4, 0.5, and 0.6 to D2D UE1.
  • the length of the shared time slot is 4 ms, and the sequence length generated by the random seed is 4.
  • the sequence generated by the random seed 0.4 by Kent mapping is 0.5714, 0.8163, 0.6122, 0.8746, and the corresponding MRB numbers are 28, 40, 30, 43; the sequence generated by the random seed 0.5 by Kent mapping is 0.7143, 0.9524, 0.1587, 0.2268, The MRB numbers corresponding to the mapping are 35, 47, 7, and 11; the sequences generated by the random seed 0.6 through the Kent mapping are 0.8571, 0.4762, 0.6803, and 0.9712, and the corresponding MRB numbers are 42, 23, 34, and 48. Therefore, the resource blocks numbered 28, 35, and 42 may be occupied in the first shared time slot, and the resource blocks numbered 40, 23, and 47 may be occupied on the second shared time slot, and so on. If the base station allocates more than three random seeds, the method is the same on;
  • the base station allocates a random seed, an offset to the D2D UE (which can be agreed to be sent by signaling once agreed) and a value of 3. Using this offset, the values of the other 2 random seeds can be calculated. For example, if the number of random seeds allocated by the base station is 0.5 and the offset is 0.02, if three MRBs are occupied in one time slot, the random seeds actually generated are 0.5, 0.52, and 0.54, and then the random seed is used to generate a random sequence. Map.
  • resource blocks required for each time slot it may be selected according to a certain rule order, for example, resource blocks with MRB numbers 35, 47, and 7 are allocated to the first time slot, and resource blocks are allocated for 11, 16, and 23. To the second time slot, and so on; it is also possible to arbitrarily select three MRBs to be allocated to the first time slot, and the second time slot to allocate three more MRBs from the remaining nine MRBs to the second time slot. ,So on and so forth.
  • there are different resource blocks required in each time slot For example, if two, 3, 3, and 4 resource blocks are needed on four time slots, the selection of resource blocks on each time slot may be adopted.
  • the sequential selection method is to allocate the resource blocks of numbers 35 and 47 to the first time slot, the resource blocks numbered 7, 11, and 16 to the second time slot, and so on; In the block mode, two resource blocks are selected for the first time slot, the second time slot selects three MRBs from the remaining 10 resource blocks, and so on.
  • the base station allocates the same random seed to the transmitting end and the receiving end, the state of the chaotic time sequence generated by the corresponding transmitting end and the receiving end is the same, and the same MRB resource block can be accessed at the same time for data transmission.
  • Step3 In each time slot, different D2D UEs use different random seeds to generate no The same pseudo-random sequence, and access to the corresponding resource block according to the mapping result of step 2. Since the distribution function of the Kent mapping is relatively uniform, the probability of collision of different D2D UEs can be greatly reduced, and the algorithm complexity is low, the operation is simple, and the development is easy.
  • FIG. 10 is a schematic diagram of channel access based on chaotic sequences according to an embodiment of the present invention.
  • FIG. 11 is an optional flowchart 2 for generating a pseudo-random sequence according to an embodiment of the present invention.
  • the following is included:
  • Step 1 The method of generating a pseudo-random sequence using the linear congruence method is as follows:
  • x 0 represents a random seed (initial value)
  • a random seed of the i-th D2D pair is represented by x 0i .
  • D2D UE1 transmitting end
  • D2D UE2 receiveiving end
  • D2D UE3 transmitmitting end
  • D2D UE4 receiveiving end
  • D2D UE1 and D2D UE2 have the same random seed x 01
  • D2D UE 3 and D2D UE4 have the same random seed x 02 .
  • the random sequences X 1 and X 2 of the same length are generated using a linear congruence method using different random seeds x 01 and x 02 .
  • the length of the random sequence is determined by the number of time slots of the shared time slot.
  • a, c and m are integers, and the randomness of the sequence is derived from the modulo operation.
  • the choice of the modulus m should be as large as possible because the period of the sequence cannot be greater than m. In the present invention it is assumed that there are 50 MRBs per time slot, so the value of m should be at least 50. M. Greenberger proves that the condition of generating a pseudo-random number sequence with a period m using the linear multiplication congruence method is as follows:
  • A-1 is a multiple of prime number p, where p is the common divisor of a-1 and m;
  • n is a multiple of 4
  • a-1 is also a multiple of 4.
  • the length of the generated random sequence should be 4, and the sequence generated by the linear congruence method is 52, 19, 14, 37.
  • This example corresponds to the case where the D2D UE allocates only one MRB in one time slot.
  • Step 2 Convert the random sequence obtained in step 1 into a random sequence in the range [0, 1], and the conversion formula is as follows:
  • Step 3 Map the random value y n obtained in step 2 to the frequency band corresponding to each MRB. If there are 50 MRBs in the corresponding frequency domain in one time slot, multiply y n distributed in the range of [0, 1] by 50 and then round up to obtain the corresponding MRB number.
  • the calculation method is as follows:
  • the base station directly delivers three random seeds, and three random sequences can be generated corresponding to different random seeds. For example, the base station assigns random seeds 1, 2, and 3 to D2D UE1.
  • the length of the shared time slot is 4 ms, and the sequence length generated by the random seed is 4.
  • the sequence generated by the linear congruence method using random seed 1 is 52, 19, 14, 37, and the corresponding MRB numbers are 46, 16, 12, 33;
  • the sequence generated by the random seed 2 by the linear congruence method is 25, 20 43,43, 38, the corresponding MRB numbers are 22, 17, 38, 33;
  • the sequence generated by the random seed 3 by the linear congruence method is 54, 21, 16, 39, and the corresponding MRB numbers are 48, 18, and 14 34.
  • the resource blocks numbered 46, 22, and 48 may be occupied in the first shared time slot, and the resource blocks numbered 16, 17, and 18 may be occupied on the second shared time slot, and so on. If the base station allocates more than three random seeds, the method is the same as above;
  • the base station allocates a random seed and an offset to the D2D UE (it may be agreed that it is not sent by signaling once agreed). Using this offset, the values of the other 2 random seeds can be calculated. For example, the number of random seeds allocated by the base station is 1, and the offset is 1, if at this time, 3 slots are occupied. MRB, the randomly generated random seeds are 1, 2, and 3, and then use the random seed to generate a random sequence for mapping.
  • resource blocks required for each time slot it may be selected according to a certain rule order, for example, resource blocks with MRB numbers 46, 16, and 12 are allocated to the first time slot, and resource blocks are allocated for 33, 28, and 49.
  • resource blocks are allocated for 33, 28, and 49.
  • there are different resource blocks required in each time slot For example, if two, 3, 3, and 4 resource blocks are needed on four time slots, the selection of resource blocks on each time slot may be adopted.
  • the sequential selection method is to allocate the resource blocks of numbers 46 and 16 to the first time slot, the resource blocks numbered 12, 33, and 28 to the second time slot, and so on; In the block mode, two resource blocks are selected for the first time slot, the second time slot selects three MRBs from the remaining 10 resource blocks, and so on.
  • the base station Since the base station allocates the same random seed to the transmitting end and the receiving end, the corresponding transmitting end and the receiving end generate the same state of the linear congruence sequence, and can access the same MRB resource block at the same time for data transmission.
  • Step 4 In each time slot, different D2D UEs generate different pseudo-random sequences by using different random seeds, and access to the corresponding resource blocks according to the mapping result of step 3.
  • the method is simple to implement, the algorithm complexity is low, and the development is easy.
  • FIG. 12 is a transmission flow chart according to an embodiment of the present invention, as shown in FIG. The overall transmission flow chart of the example.
  • the base station in this embodiment allocates a random seed to the D2D pair.
  • the base station aggregates transmission requests of different D2D UEs, and allocates resources and random seeds according to the type of service and the amount of data.
  • the principle of allocation of random seeds is: the base station allocates the same random seed to the D2D pair (the transmitting end and the receiving end of the D2D communication), so that the transmitting end and the receiving end can quickly and synchronously access the same when the shared time slot is used for contention access.
  • MRB different D2D pairs are assigned different random seeds, thereby reducing resource collisions during competing access.
  • the channel access is performed based on the pseudo-random sequence.
  • the transmitting end and the receiving end of the D2D communication pair generate a pseudo-random sequence with the same state according to a certain generation algorithm according to the same random seed allocated by the base station, and then the pseudo-random sequence is obtained.
  • a certain operation is performed to obtain the corresponding MRB resource block number.
  • the transmitting end and the receiving end can quickly access the unified MRB resource block to complete the data transmission.
  • Different D2D pairs may generate different MRB numbers due to different random seeds to access other channels to avoid collision.
  • the base station may allocate the same random seed to the same D2D pair to generate a random sequence with the same state.
  • the transmitting end and the receiving end may quickly synchronize the access.
  • the data transmission is completed to the same MRB resource block, and the access time is shortened. Since the chaotic sequence itself has good statistical characteristics, the random sequences generated by different D2D UEs are different from each other, which can reduce resource collisions during competition access and improve resources. Utilization rate.
  • Embodiments of the present invention also provide a storage medium.
  • the foregoing storage medium may be configured to store program code for performing the following steps:
  • the foregoing storage medium may include, but not limited to, a USB flash drive, a Read-Only Memory (ROM), a Random Access Memory (RAM), a mobile hard disk, and a magnetic memory.
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • a mobile hard disk e.g., a hard disk
  • magnetic memory e.g., a hard disk
  • the processor performs a transmission request sent by the receiving device to the device D2D terminal according to the stored program code in the storage medium, where the transmission request is used to request to allocate the transmission resource;
  • the processor performs, according to the stored program code stored in the storage medium, allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request; wherein the random seed resource is used for D2D
  • the terminal generates a corresponding pseudo-random sequence and uses a pseudo-random sequence for channel access.
  • modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • the transmission request sent by the receiving device to the device D2D terminal is The transmission request is used to request to allocate a transmission resource, and then allocate the same random seed resource to the D2D terminal and the transmission peer of the D2D terminal according to the transmission request, where the random seed resource is used for the
  • the D2D terminal generates a corresponding pseudo-random sequence and uses the pseudo-random sequence for channel access. Since the same random seed resource is allocated to the transmitting end and the receiving end of the D2D communication, a consistent pseudo-random sequence can be generated at both ends of the transmitting and receiving, which can improve the utilization of the radio resource due to the pseudo-random sequence generated between different pairs of D2D terminals.
  • the randomness is better, so the probability of accessing the same resource in the same time slot is reduced, the resource collision occurring during the contention access can be reduced, and the resource access between the D2D terminals can be quickly realized without being controlled by the base station.
  • the problem of low resource utilization in channel access in the related art can be solved.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Provided are a channel access method, apparatus and system, and a storage medium. The method comprises: receiving a transmission request sent by a device-to-device (D2D) terminal, wherein the transmission request is used for requesting the allocation of a transmission resource; and according to the transmission request, allocating the same random seed resource to the D2D terminal and a transmission peer of the D2D terminal, wherein the random seed resource is used for the D2D terminal to generate a corresponding pseudo-random sequence and to use the pseudo-random sequence to perform channel access. By means of the present invention, the problem of a low resource utilization rate during channel access in the related art is solved.

Description

信道接入方法、装置及***、存储介质Channel access method, device and system, and storage medium 技术领域Technical field
本发明涉及通信领域,具体而言,涉及一种信道接入方法、装置及***、存储介质。The present invention relates to the field of communications, and in particular to a channel access method, apparatus and system, and storage medium.
背景技术Background technique
由于多媒体业务需求的急剧增长,频谱资源短缺成为移动通信面临的挑战。在传统的蜂窝网络中,不允许用户之间直接通信,这种集中式工作方式虽然便于对资源和干扰的管理和控制,但资源利用率低。为了提高频谱利用效率,提出了允许终端用户能够直接通信的设备到设备(Device-to-device,简称为D2D)通信技术。与蜂窝通信相比,D2D通信可以减少传输功率,节约能耗,因此有望成为未来移动通信的关键技术。Due to the rapid growth in demand for multimedia services, the shortage of spectrum resources has become a challenge for mobile communications. In the traditional cellular network, direct communication between users is not allowed. This centralized working mode facilitates the management and control of resources and interference, but the resource utilization is low. In order to improve the efficiency of spectrum utilization, a device-to-device (D2D) communication technology that allows end users to communicate directly is proposed. Compared with cellular communication, D2D communication can reduce transmission power and save energy, so it is expected to become a key technology for future mobile communication.
相关技术中,关于信道接入技术的研究,主要集中在无线局域网上。例如:用于无线局域网的分布式媒体接入技术、在无线局域网中实现资源预留的半随机退避方法等。但是当传输的用户数目增多时,冲突概率会大大增大,造成严重的资源浪费。In the related art, research on channel access technology mainly focuses on a wireless local area network. For example: distributed media access technology for wireless local area networks, semi-random backoff method for realizing resource reservation in wireless local area networks, and the like. However, when the number of users transmitted increases, the probability of collision increases greatly, resulting in serious waste of resources.
针对相关技术中存在的上述问题,目前尚未发现有效的解决方案。In view of the above problems in the related art, no effective solution has been found yet.
发明内容Summary of the invention
本发明实施例提供了一种信道接入方法、装置及***、存储介质,以至少解决相关技术中在信道接入时资源利用率低的问题。The embodiments of the present invention provide a channel access method, device, system, and storage medium, to at least solve the problem of low resource utilization during channel access in the related art.
根据本发明的一个实施例,提供了一种信道接入方法,包括:接收设备到设备D2D终端发送的传输请求,其中,所述传输请求用于请求分配传输资源;根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源;其中,所述随机种子资源用于所述D2D终端产生相应的伪随机序列并利用所述伪随机序列进行信道接入。According to an embodiment of the present invention, a channel access method is provided, including: receiving a transmission request sent by a device to a device D2D terminal, wherein the transmission request is used to request allocation of a transmission resource; The D2D terminal and the transmission peer of the D2D terminal allocate the same random seed resource; wherein the random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and use the pseudo random sequence for channel access.
可选地,接收设备到设备D2D终端发送的传输请求包括:接收D2D 终端利用物理上行链路控制信道PUCCH通过上行调度请求SR发送的上行链路资源;在所述上行链路资源上接收所述传输请求。Optionally, the transmission request sent by the receiving device to the device D2D terminal includes: receiving D2D The terminal uses the physical uplink control channel PUCCH to request an uplink resource transmitted by the SR through an uplink scheduling; and receives the transmission request on the uplink resource.
可选地,在根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源之前,所述方法还包括:在预设长度的时间窗口内,汇总一个或多个D2D终端分别发送的传输请求,并解析各个传输请求所请求传输业务的数据量和/或业务类型。Optionally, before the same random seed resource is allocated to the D2D terminal and the transmission peer of the D2D terminal according to the transmission request, the method further includes: summarizing one or A transmission request sent by a plurality of D2D terminals, and parsing the data amount and/or service type of the transmission service requested by each transmission request.
可选地,根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源包括:根据所述数据量和/或所述业务类型向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源。Optionally, allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request includes: according to the data volume and/or the service type, to the D2D terminal and the The transmission peer of the D2D terminal allocates the same random seed resource.
可选地,根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源包括:根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的专用时隙;和/或,根据所述传输请求向所述D2D终端和所述D2D终端的传输对端预分配相同的备用时隙。Optionally, allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request includes: transmitting, to the D2D terminal and the D2D terminal, a transmission peer according to the transmission request Allocating the same dedicated time slot; and/or pre-assigning the same spare time slot to the D2D terminal and the transmission peer of the D2D terminal according to the transmission request.
可选地,根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源包括以下之一:根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配一个或多个相同的随机种子资源;根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源、偏移量、所述随机种子资源所包括的时隙对应的资源块单位MRB的个数。Optionally, allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request includes one of: following the transmission request to the D2D terminal and the D2D terminal Allocating one or more identical random seed resources to the transmitting peer; allocating the same random seed resource, offset, and random seed resource to the D2D terminal and the transmitting peer of the D2D terminal according to the transmission request The number of resource block units MRB corresponding to the time slots included.
根据本发明的一个实施例,提供了另一种信道接入方法,包括:向基站发送传输请求,以及接收所述基站根据所述传输请求分配的随机种子资源;基于所述随机种子资源按照预设算法产生相应的伪随机序列;根据所述伪随机序列进行信道接入。According to an embodiment of the present invention, another channel access method is provided, including: transmitting a transmission request to a base station, and receiving a random seed resource allocated by the base station according to the transmission request; and pre-predetermining based on the random seed resource The algorithm is configured to generate a corresponding pseudo-random sequence; channel access is performed according to the pseudo-random sequence.
可选地,根据所述伪随机序列进行信道接入包括:根据所述伪随机序列得到相应的资源块单位MRB的资源块编号;接入到所述资源块编号对应的MRB所属的信道。Optionally, performing channel access according to the pseudo random sequence includes: obtaining a resource block number of a corresponding resource block unit MRB according to the pseudo random sequence; accessing a channel to which the MRB corresponding to the resource block number belongs.
可选地,所述随机种子资源包括专用时隙和/或备用时隙。 Optionally, the random seed resource comprises a dedicated time slot and/or a spare time slot.
可选地,所述预设算法包括以下之一:Kent映射、线性同余法。Optionally, the preset algorithm includes one of the following: a Kent mapping, a linear congruence method.
可选地,在所述预设算法为Kent映射时,基于所述随机种子资源按照Kent映射产生预设长度的伪随机序列包括:Optionally, when the preset algorithm is Kent mapping, generating a pseudo-random sequence of a preset length according to the Kent mapping according to the random seed resource includes:
按照以下公式计算所述伪随机序列xn+1The pseudo-random sequence x n+1 is calculated according to the following formula:
Figure PCTCN2017091227-appb-000001
Figure PCTCN2017091227-appb-000001
其中,xn为时隙编号为n的伪随机序列,n为时隙编号,a为常量,a∈(0,1)。Where x n is a pseudo-random sequence with slot number n, n is the slot number, and a is a constant, a ∈ (0, 1).
可选地,所述伪随机序列的长度和所述时隙个数相同。Optionally, the length of the pseudo random sequence is the same as the number of the time slots.
可选地,所述a=0.7。Optionally, the a = 0.7.
可选地,在所述预设算法为线性同余法时,基于所述随机种子资源按照预设算法产生相应的伪随机序列包括:按照以下公式计算所述伪随机序列xn+1xn+1Optionally, when the preset algorithm is a linear congruence method, generating a corresponding pseudo random sequence according to the preset algorithm based on the random seed resource comprises: calculating the pseudo random sequence x n+1 x n according to the following formula: +1 :
xn+1=(axn+c)mod m;x n+1 =(ax n +c)mod m;
其中,所述m为大于A的整数,A为所述随机种子包括的单个时隙的MRB个数,a、c分别为与所述A相关的预设值,xn为时隙编号为n的伪随机序列,n为时隙编号。Wherein m is an integer greater than A, A is the number of MRBs of a single time slot included in the random seed, a and c are preset values associated with the A, and x n is a slot number n A pseudo-random sequence, where n is the slot number.
可选地,根据所述伪随机序列得到相应的资源块单位MRB的资源块编号包括:N=[mi*A];其中,所述mi为所述伪随机序列分布在[0,1]范围内的随机数值,A为所述随机种子包括的单个时隙内对应频域上的MRB个数,[]表示向下取整,i为时隙编号。Optionally, obtaining the resource block number of the corresponding resource block unit MRB according to the pseudo random sequence includes: N=[m i *A]; wherein the mi is the pseudo random sequence distributed in [0, 1 A random number in the range, A is the number of MRBs in the corresponding frequency domain in a single time slot included in the random seed, [] represents rounding down, and i is a slot number.
根据本发明的另一个实施例,提供了一种信道接入装置,包括:接收模块,设置为接收设备到设备D2D终端发送的传输请求,其中,所述传输请求用于请求分配传输资源;分配模块,设置为根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源;其中, 所述随机种子资源用于所述D2D终端产生相应的伪随机序列并利用所述伪随机序列进行信道接入。According to another embodiment of the present invention, there is provided a channel access apparatus, comprising: a receiving module, configured to receive a transmission request sent by a device to a device D2D terminal, wherein the transmission request is used to request allocation of a transmission resource; a module, configured to allocate the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request; The random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and utilize the pseudo random sequence for channel access.
根据本发明的另一个实施例,提供了另一种信道接入装置,包括:请求模块,设置为向基站发送传输请求,以及接收所述基站根据所述传输请求分配的随机种子资源;计算模块,设置为基于所述随机种子资源按照预设算法产生相应的伪随机序列;接入模块,设置为根据所述伪随机序列进行信道接入。According to another embodiment of the present invention, there is provided another channel access apparatus, comprising: a requesting module, configured to send a transmission request to a base station, and receive a random seed resource allocated by the base station according to the transmission request; a calculation module And setting, according to the random seed resource, a corresponding pseudo random sequence according to a preset algorithm; and the access module is configured to perform channel access according to the pseudo random sequence.
根据本发明的又一个实施例,提供了一种信道接入***,包括:D2D通信的发送端、D2D通信的接收端,基站,所述基站还包括:第一接收模块,设置为接收所述发送端发送的传输请求,其中,所述传输请求用于请求分配传输资源;分配模块,设置为根据所述传输请求向所述发送端和所述接收端分配相同的随机种子资源;According to still another embodiment of the present invention, a channel access system is provided, including: a transmitting end of D2D communication, a receiving end of D2D communication, and a base station, the base station further comprising: a first receiving module, configured to receive the a transmission request sent by the sending end, where the transmission request is used to request to allocate a transmission resource; and an allocation module is configured to allocate the same random seed resource to the sending end and the receiving end according to the transmission request;
所述发送端包括:请求模块,设置为向基站发送所述传输请求,以及接收所述基站根据所述传输请求分配的随机种子资源;第一计算模块,设置为基于所述随机种子资源按照预设算法产生相应的伪随机序列;第一接入模块,设置为根据所述伪随机序列进行信道接入;The sending end includes: a requesting module, configured to send the transmission request to a base station, and receive a random seed resource that is allocated by the base station according to the transmission request; and the first calculating module is configured to preset according to the random seed resource Setting an algorithm to generate a corresponding pseudo-random sequence; the first access module is configured to perform channel access according to the pseudo-random sequence;
所述接收端包括:第二接收模块,设置为接收所述基站根据所述传输请求分配的随机种子资源;第二计算模块,设置为基于所述随机种子资源按照预设算法产生相应的伪随机序列;第二接入模块,设置为根据所述伪随机序列进行信道接入。The receiving end includes: a second receiving module, configured to receive a random seed resource allocated by the base station according to the transmission request; and a second calculating module, configured to generate a corresponding pseudo random according to the preset algorithm according to the preset algorithm a sequence; a second access module configured to perform channel access according to the pseudo-random sequence.
根据本发明的又一个实施例,还提供了一种存储介质。该存储介质设置为存储用于执行以下步骤的程序代码:According to still another embodiment of the present invention, a storage medium is also provided. The storage medium is arranged to store program code for performing the following steps:
接收设备到设备D2D终端发送的传输请求,其中,所述传输请求用于请求分配传输资源;Receiving a transmission request sent by the device to the device D2D terminal, where the transmission request is used to request to allocate a transmission resource;
根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源;And allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request;
其中,所述随机种子资源用于所述D2D终端产生相应的伪随机序列 并利用所述伪随机序列进行信道接入。The random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence. And using the pseudo random sequence for channel access.
通过本发明实施例,接收设备到设备D2D终端发送的传输请求,其中,所述传输请求用于请求分配传输资源,然后根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源,其中,所述随机种子资源用于所述D2D终端产生相应的伪随机序列并利用所述伪随机序列进行信道接入。由于对D2D通信的发送端和接收端分配相同的随机种子资源,因此可以在收发两端产生一致的伪随机序列,可以提高无线资源的利用率,由于不同D2D终端对之间产生的伪随机序列的随机性比较好,所以在同一时隙接入相同资源的概率减少,可以减少在竞争接入时发生的资源碰撞,同时实现在不受基站控制的情况下快速实现D2D终端间的资源接入,可以解决相关技术中在信道接入时资源利用率低的问题。According to an embodiment of the present invention, a transmission request sent by a device to a device D2D terminal is used, wherein the transmission request is used to request allocation of a transmission resource, and then, according to the transmission request, to a transmission end of the D2D terminal and the D2D terminal. Allocating the same random seed resource, wherein the random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and utilize the pseudo random sequence for channel access. Since the same random seed resource is allocated to the transmitting end and the receiving end of the D2D communication, a consistent pseudo-random sequence can be generated at both ends of the transmitting and receiving, which can improve the utilization of the radio resource due to the pseudo-random sequence generated between different pairs of D2D terminals. The randomness is better, so the probability of accessing the same resource in the same time slot is reduced, the resource collision occurring during the contention access can be reduced, and the resource access between the D2D terminals can be quickly realized without being controlled by the base station. The problem of low resource utilization in channel access in the related art can be solved.
附图说明DRAWINGS
此处所说明的附图用来提供对本发明的进一步理解,构成本申请的一部分,本发明的示意性实施例及其说明用于解释本发明,并不构成对本发明的不当限定。在附图中:The drawings described herein are intended to provide a further understanding of the invention, and are intended to be a part of the invention. In the drawing:
图1是根据本发明实施例的网络构架图;1 is a network architecture diagram in accordance with an embodiment of the present invention;
图2是根据本发明实施例的一种信道接入方法的流程图;2 is a flowchart of a channel access method according to an embodiment of the present invention;
图3是根据本发明实施例的另一种信道接入方法的流程图;FIG. 3 is a flowchart of another channel access method according to an embodiment of the present invention; FIG.
图4是根据本发明实施例的一种信道接入装置的结构框图;FIG. 4 is a structural block diagram of a channel access apparatus according to an embodiment of the present invention; FIG.
图5是根据本发明实施例的另一种信道接入装置的结构框图;FIG. 5 is a structural block diagram of another channel access apparatus according to an embodiment of the present invention; FIG.
图6是根据本发明实施例的信道接入***的结构框图;6 is a structural block diagram of a channel access system according to an embodiment of the present invention;
图7是根据本发明实施例的应用场景示意图;FIG. 7 is a schematic diagram of an application scenario according to an embodiment of the present invention; FIG.
图8是根据本发明实施例的基站分配随机种子示意图;FIG. 8 is a schematic diagram of a base station assigning a random seed according to an embodiment of the present invention; FIG.
图9是根据本发明实施例的产生伪随机序列的可选流程图一; 9 is an optional flowchart 1 for generating a pseudo-random sequence according to an embodiment of the present invention;
图10是根据本发明实施例的基于混沌序列的信道接入示意图;FIG. 10 is a schematic diagram of channel access based on a chaotic sequence according to an embodiment of the present invention; FIG.
图11是根据本发明实施例的产生伪随机序列的可选流程图二;11 is an optional flowchart 2 for generating a pseudo-random sequence according to an embodiment of the present invention;
图12是根据本发明实施例的传输流程图。Figure 12 is a flow diagram of a transmission in accordance with an embodiment of the present invention.
具体实施方式detailed description
下文中将参考附图并结合实施例来详细说明本发明。需要说明的是,在不冲突的情况下,本申请中的实施例及实施例中的特征可以相互组合。The invention will be described in detail below with reference to the drawings in conjunction with the embodiments. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict.
需要说明的是,本发明的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象,而不必用于描述特定的顺序或先后次序。It is to be understood that the terms "first", "second" and the like in the specification and claims of the present invention are used to distinguish similar objects, and are not necessarily used to describe a particular order or order.
实施例1Example 1
本申请实施例可以运行于图1所示的网络架构上,图1是根据本发明实施例的网络构架图,如图1所示,该网络架构包括:基站、多个终端,其中,两个终端之间形成D2D link(D2D通信链路)、基站与终端连接。The embodiment of the present application can be run on the network architecture shown in FIG. 1. FIG. 1 is a network architecture diagram according to an embodiment of the present invention. As shown in FIG. 1, the network architecture includes: a base station, multiple terminals, and two A D2D link (D2D communication link) is formed between the terminals, and the base station is connected to the terminal.
在本实施例中提供了一种运行于上述网络架构的信道接入方法,图2是根据本发明实施例的一种信道接入方法的流程图,如图2所示,该流程包括如下步骤:In this embodiment, a channel access method running on the network architecture is provided. FIG. 2 is a flowchart of a channel access method according to an embodiment of the present invention. As shown in FIG. 2, the process includes the following steps. :
步骤S202,接收设备到设备D2D终端发送的传输请求,其中,传输请求用于请求分配传输资源;Step S202, receiving a transmission request sent by the device to the device D2D terminal, where the transmission request is used to request to allocate a transmission resource;
步骤S204,根据传输请求向D2D终端和D2D终端的传输对端分配相同的随机种子资源;可选的,D2D终端和D2D终端的传输对端分别为发送端和接收端;Step S204: Allocating the same random seed resource to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request; optionally, the transmission peers of the D2D terminal and the D2D terminal are respectively a transmitting end and a receiving end;
其中,随机种子资源用于D2D终端产生相应的伪随机序列并利用伪随机序列进行信道接入。The random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and uses a pseudo random sequence for channel access.
通过上述步骤,接收设备到设备D2D终端发送的传输请求,其中,所述传输请求用于请求分配传输资源,然后根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源,其中,所述 随机种子资源用于所述D2D终端产生相应的伪随机序列并利用所述伪随机序列进行信道接入。由于对D2D通信的发送端和接收端分配相同的随机种子资源,因此可以在收发两端产生一致的伪随机序列,可以提高无线资源的利用率,由于不同D2D终端对之间产生的伪随机序列的随机性比较好,所以在同一时隙接入相同资源的概率减少,可以减少在竞争接入时发生的资源碰撞,同时实现在不受基站控制的情况下快速实现D2D终端间的资源接入,可以解决相关技术中在信道接入时资源利用率低的问题。Receiving, by the foregoing steps, a transmission request sent by the device to the device D2D terminal, wherein the transmission request is used to request allocation of a transmission resource, and then allocating the same to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request Random seed resource, wherein The random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and utilize the pseudo random sequence for channel access. Since the same random seed resource is allocated to the transmitting end and the receiving end of the D2D communication, a consistent pseudo-random sequence can be generated at both ends of the transmitting and receiving, which can improve the utilization of the radio resource due to the pseudo-random sequence generated between different pairs of D2D terminals. The randomness is better, so the probability of accessing the same resource in the same time slot is reduced, the resource collision occurring during the contention access can be reduced, and the resource access between the D2D terminals can be quickly realized without being controlled by the base station. The problem of low resource utilization in channel access in the related art can be solved.
可选地,上述步骤的执行主体可以为网络侧设备,如基站等,但不限于此。Optionally, the execution body of the foregoing step may be a network side device, such as a base station, etc., but is not limited thereto.
可选的,接收设备到设备D2D终端发送的传输请求包括:接收D2D终端利用物理上行控制信道(Physical Uplink Control Channel,简称为PUCCH)通过上行调度请求SR发送的上行链路资源,在所述上行链路资源上接收所述传输请求,由于SR只有一个比特,所以实际过程:先通过SR请求用于发送数据传输请求的上行链路资源;然后在得到的上行链路资源发送具体的数据传输请求。Optionally, the transmission request sent by the receiving device to the device D2D terminal includes: receiving, by the D2D terminal, an uplink resource that is sent by the uplink scheduling request SR by using a Physical Uplink Control Channel (PUCCH), where the uplink resource is sent. Receiving the transmission request on the link resource, since the SR has only one bit, the actual process is: first, requesting, by the SR, an uplink resource for sending a data transmission request; and then transmitting a specific data transmission request in the obtained uplink resource. .
可选的,在根据传输请求向D2D终端和D2D终端的传输对端分配相同的随机种子资源之前,还包括:在预设长度的时间窗口内,汇总一个或多个D2D终端分别发送的传输请求,并解析各个传输请求所请求传输业务的数据量和/或业务类型。进一步的,根据传输请求向D2D终端和D2D终端的传输对端分配相同的随机种子资源包括:根据数据量和/或业务类型向D2D终端和D2D终端的传输对端分配相同的随机种子资源。Optionally, before allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request, the method further includes: summarizing the transmission request sent by the one or more D2D terminals separately in a preset time window And parsing the amount of data and/or service type of the transport service requested by each transport request. Further, allocating the same random seed resource to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request includes: allocating the same random seed resource to the transmission peers of the D2D terminal and the D2D terminal according to the data volume and/or the service type.
可选的,根据传输请求向D2D终端和D2D终端的传输对端分配相同的随机种子资源包括以下两种:Optionally, allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request includes the following two types:
根据传输请求向D2D终端和D2D终端的传输对端分配相同的专用时隙;Allocating the same dedicated time slot to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request;
根据传输请求向D2D终端和D2D终端的传输对端预分配相同的备用时隙。 The same spare time slot is pre-allocated to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request.
可选的,根据传输请求向D2D终端和D2D终端的传输对端分配相同的随机种子资源包括以下方式之一:Optionally, allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request includes one of the following methods:
根据传输请求向D2D终端和D2D终端的传输对端分配一个或多个相同的随机种子资源;Allocating one or more identical random seed resources to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request;
根据传输请求向D2D终端和D2D终端的传输对端分配相同的随机种子资源、偏移量、随机种子资源所包括的时隙对应的资源块单位(Mini Resource Block,简称为MRB)的个数。The number of resource blocks (Mini Resource Blocks, abbreviated as MRBs) corresponding to the time slots included in the random seed resources is allocated to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request.
在本实施例中,还提供了另一种运行于上述网络架构的信道接入方法,图3是根据本发明实施例的另一种信道接入方法的流程图,如图3所示,该流程包括如下步骤:In this embodiment, another channel access method running on the network architecture is provided. FIG. 3 is a flowchart of another channel access method according to an embodiment of the present invention. The process includes the following steps:
步骤S302,向基站发送传输请求,以及接收基站根据传输请求分配的随机种子资源;Step S302: Send a transmission request to the base station, and receive a random seed resource allocated by the base station according to the transmission request.
步骤S304,基于随机种子资源按照预设算法产生相应的伪随机序列;Step S304, generating a corresponding pseudo random sequence according to a preset algorithm based on the random seed resource;
步骤S306,根据伪随机序列进行信道接入。Step S306, performing channel access according to a pseudo random sequence.
可选地,上述步骤的执行主体可以为D2D终端等,但不限于此。当该D2D终端为D2D通信的接收端时,在步骤S302中,不包括向基站发送传输请求,包括接收基站根据传输请求分配的随机种子资源。Optionally, the execution body of the foregoing steps may be a D2D terminal or the like, but is not limited thereto. When the D2D terminal is the receiving end of the D2D communication, in step S302, the transmitting of the transmission request to the base station is not included, including receiving the random seed resource allocated by the base station according to the transmission request.
可选的,根据伪随机序列进行信道接入具体包括:Optionally, performing channel access according to the pseudo random sequence specifically includes:
S11,根据伪随机序列得到相应的资源块单位MRB的资源块编号;S11. Obtain a resource block number of the corresponding resource block unit MRB according to the pseudo random sequence.
S12,接入到资源块编号对应的MRB所属的信道。S12. Access the channel to which the MRB corresponding to the resource block number belongs.
可选的,随机种子资源包括专用时隙和/或备用时隙。Optionally, the random seed resource includes a dedicated time slot and/or a spare time slot.
在本实施例中,预设算法包括可以多种,在此仅以Kent映射和线性同余法进行举例说明:In this embodiment, the preset algorithm includes multiple types, and only Kent mapping and linear congruence methods are used here for illustration:
在预设算法为Kent映射时,基于随机种子资源按照Kent映射产生预设长度的伪随机序列包括:When the preset algorithm is Kent mapping, generating a pseudo-random sequence of a preset length according to the Kent mapping based on the random seed resource includes:
按照以下公式计算伪随机序列xn+1Calculate the pseudo-random sequence x n+1 according to the following formula:
Figure PCTCN2017091227-appb-000002
Figure PCTCN2017091227-appb-000002
其中,xn为时隙编号为n的伪随机序列,伪随机序列的长度与时隙的个数相同,n为时隙编号,a为常量,a∈(0,1),优选的,a=0.7。Where x n is a pseudo-random sequence with slot number n, the length of the pseudo-random sequence is the same as the number of slots, n is the slot number, a is a constant, a ∈ (0, 1), preferably, a =0.7.
其中,伪随机序列的长度和时隙个数相同。The pseudo random sequence has the same length as the number of slots.
在预设算法为线性同余法时,基于随机种子资源按照预设算法产生相应的伪随机序列包括:When the preset algorithm is a linear congruence method, generating a corresponding pseudo-random sequence according to a preset algorithm based on the random seed resource includes:
按照以下公式计算伪随机序列xn+1xn+1Calculate the pseudo-random sequence x n+1 x n+1 according to the following formula:
xn+1=(axn+c)mod m;x n+1 =(ax n +c)mod m;
其中,所述m为大于A的整数,A为所述随机种子包括的单个时隙的MRB个数,a、c分别为与所述A相关的预设值,xn为时隙编号为n的伪随机序列,n为时隙编号。Wherein m is an integer greater than A, A is the number of MRBs of a single time slot included in the random seed, a and c are preset values associated with the A, and x n is a slot number n A pseudo-random sequence, where n is the slot number.
根据上述两种算法,根据伪随机序列得到相应的资源块单位MRB的资源块编号包括:N=[mi*A];According to the foregoing two algorithms, the resource block number of the corresponding resource block unit MRB obtained according to the pseudo random sequence includes: N=[m i *A];
其中,mi所述mi为所述伪随机序列分布在[0,1]范围内的随机数值,A为所述随机种子包括的单个时隙内对应频域上的MRB个数,[]表示向下取整,i为时隙编号。Wherein, the m i m i is the pseudo-random sequence distribution in the range [0,1] is a random value, A is the random number seed corresponding to MRB frequency domain within a single slot included, [] Indicates rounding down, i is the slot number.
通过以上的实施方式的描述,本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现,当然也可以通过硬件,但很多情况下前者是更佳的实施方式。基于这样的理解,本发明的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来,该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中,包括若干指令用以使得一台终端设备(可以是手机,计算机,服务器,或者网络设备等)执行本发明各个实施例的方法。 Through the description of the above embodiments, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is A better implementation. Based on such understanding, the technical solution of the present invention, which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk, The optical disc includes a number of instructions for causing a terminal device (which may be a cell phone, a computer, a server, or a network device, etc.) to perform the methods of various embodiments of the present invention.
实施例2Example 2
在本实施例中还提供了一种信道接入装置、***,该装置和***用于实现上述实施例及优选实施方式,已经进行过说明的不再赘述。如以下所使用的,术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现,但是硬件,或者软件和硬件的组合的实现也是可能并被构想的。A channel access device and a system are also provided in this embodiment. The device and the system are used to implement the foregoing embodiments and preferred embodiments, and are not described again. As used below, the term "module" may implement a combination of software and/or hardware of a predetermined function. Although the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
图4是根据本发明实施例的一种信道接入装置的结构框图,如图4所示,该装置包括:FIG. 4 is a structural block diagram of a channel access apparatus according to an embodiment of the present invention. As shown in FIG. 4, the apparatus includes:
接收模块40,设置为接收设备到设备D2D终端发送的传输请求,其中,传输请求用于请求分配传输资源;The receiving module 40 is configured to receive a transmission request sent by the device to the device D2D terminal, where the transmission request is used to request to allocate a transmission resource;
分配模块42,设置为根据传输请求向D2D终端和D2D终端的传输对端分配相同的随机种子资源;The allocating module 42 is configured to allocate the same random seed resource to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request;
其中,随机种子资源用于D2D终端产生相应的伪随机序列并利用伪随机序列进行信道接入。The random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and uses a pseudo random sequence for channel access.
图5是根据本发明实施例的另一种信道接入装置的结构框图,如图5所示,该装置包括:FIG. 5 is a structural block diagram of another channel access apparatus according to an embodiment of the present invention. As shown in FIG. 5, the apparatus includes:
请求模块50,设置为向基站发送传输请求,以及接收基站根据传输请求分配的随机种子资源;The requesting module 50 is configured to send a transmission request to the base station, and receive a random seed resource allocated by the base station according to the transmission request;
计算模块52,设置为基于随机种子资源按照预设算法产生相应的伪随机序列;The calculating module 52 is configured to generate a corresponding pseudo random sequence according to a preset algorithm based on the random seed resource;
接入模块54,设置为根据伪随机序列进行信道接入。The access module 54 is configured to perform channel access according to a pseudo random sequence.
图6是根据本发明实施例的信道接入***的结构框图,如图6所示,该***包括:D2D通信的发送端60、D2D通信的接收端62,基站64,6 is a structural block diagram of a channel access system according to an embodiment of the present invention. As shown in FIG. 6, the system includes: a transmitting end 60 of D2D communication, a receiving end 62 of D2D communication, and a base station 64.
基站64还包括:Base station 64 also includes:
第一接收模块640,设置为接收发送端发送的传输请求,其中,传输请求用于请求分配传输资源; The first receiving module 640 is configured to receive a transmission request sent by the sending end, where the transmission request is used to request to allocate a transmission resource;
分配模块642,设置为根据传输请求向发送端和接收端分配相同的随机种子资源;The allocating module 642 is configured to allocate the same random seed resource to the sending end and the receiving end according to the transmission request;
发送端60包括:The sending end 60 includes:
请求模块600,设置为向基站发送传输请求,以及接收基站根据传输请求分配的随机种子资源;The requesting module 600 is configured to send a transmission request to the base station, and receive a random seed resource allocated by the base station according to the transmission request;
第一计算模块602,设置为基于随机种子资源按照预设算法产生相应的伪随机序列;The first calculating module 602 is configured to generate a corresponding pseudo random sequence according to a preset algorithm based on the random seed resource;
第一接入模块604,设置为根据伪随机序列进行信道接入;The first access module 604 is configured to perform channel access according to a pseudo random sequence;
接收端62包括:The receiving end 62 includes:
第二接收模块620,设置为接收基站根据传输请求分配的随机种子资源;The second receiving module 620 is configured to receive a random seed resource allocated by the base station according to the transmission request.
第二计算模块622,设置为基于随机种子资源按照预设算法产生相应的伪随机序列;The second calculating module 622 is configured to generate a corresponding pseudo random sequence according to a preset algorithm based on the random seed resource;
第二接入模块624,设置为根据伪随机序列进行信道接入。The second access module 624 is configured to perform channel access according to a pseudo random sequence.
需要说明的是,上述各个模块是可以通过软件或硬件来实现的,对于后者,可以通过以下方式实现,但不限于此:上述模块均位于同一处理器中;或者,上述各个模块以任意组合的形式分别位于不同的处理器中。It should be noted that each of the above modules may be implemented by software or hardware. For the latter, the foregoing may be implemented by, but not limited to, the foregoing modules are all located in the same processor; or, the above modules are in any combination. The forms are located in different processors.
实施例3Example 3
本实施例是根据本发明的可选实施例,用于结合具体的场景和实例对本申请进行详细说明:This embodiment is an optional embodiment according to the present invention, which is used to describe the present application in detail in conjunction with specific scenarios and examples:
而本实施例提出了一种基于伪随机序列的半随机的信道接入方法,可以降低随机退避带来的冲突概率,并且可以解决在不受基站控制的情况下收端和发端如何快速连接的问题。本发明以非授权频段下D2D通信如何进行信道接入为例,以改进现有方案的不足,进一步降低数据传输的时延,提高资源利用率,提升用户体验。因此,本发明着眼于D2D通信在非授权频段的信道接入技术,考虑如何减少不同D2D UE之间的碰撞问题,并 解决相关技术中的如下技术问题:In this embodiment, a semi-random channel access method based on a pseudo-random sequence is proposed, which can reduce the collision probability caused by random backoff, and can solve how to quickly connect the receiving end and the transmitting end without being controlled by the base station. problem. The present invention takes the channel access of D2D communication in an unlicensed frequency band as an example to improve the deficiencies of the existing solutions, further reduce the delay of data transmission, improve resource utilization, and improve user experience. Therefore, the present invention focuses on channel access technology of D2D communication in an unlicensed frequency band, and considers how to reduce collision problems between different D2D UEs, and Solve the following technical problems in the related art:
1)当D2D UE有传输需求并向基站上报时,基站根据上报结果对专用时隙进行完全的资源分配,对备用时隙进行资源预分配,并给不同的D2D对(D2D pair)分配不同的随机种子。1) When the D2D UE has a transmission requirement and reports to the base station, the base station performs complete resource allocation on the dedicated time slot according to the reporting result, performs resource pre-allocation on the spare time slot, and assigns different D2D pairs to different D2D pairs. Random seed.
2)不同的D2D UE根据基站的仲裁结果利用非授权频段进行相关传输。在共享时隙,D2D UE根据随机种子产生相同长度的不同随机序列进行半随机信道接入,减少不同D2D UE之间发生冲突的可能。D2D通信帧的通信长度的最小单位是MRB(Mini Resource Block),基站按照D2D用户上报的业务和数据量进行以MRB为单位对通信资源进行调度。2) Different D2D UEs use the unlicensed frequency band for related transmission according to the arbitration result of the base station. In the shared time slot, the D2D UE generates a semi-random channel access according to different random sequences of the same length according to the random seed, thereby reducing the possibility of collision between different D2D UEs. The minimum unit of the communication length of the D2D communication frame is the MRB (Mini Resource Block), and the base station performs scheduling of the communication resources in units of MRB according to the service and data amount reported by the D2D user.
针对需要对时频二维资源进行调度的情况,本发明提出一种基于伪随机序列的半随机的信道接入方法。并以非授权频段上的D2D通信为例,采用基站分配随机种子的方法控制D2D UE产生相应的伪随机序列,利用上述伪随机序列进行信道接入。本发明在提高资源利用率,减少碰撞概率的同时,可以保证在不受基站控制的情况下快速实现D2D UE的资源接入。In the case of scheduling time-frequency two-dimensional resources, the present invention proposes a semi-random channel access method based on a pseudo-random sequence. Taking the D2D communication on the unlicensed frequency band as an example, the method of assigning a random seed by the base station is used to control the D2D UE to generate a corresponding pseudo random sequence, and the pseudo random sequence is used for channel access. The invention can ensure the resource access of the D2D UE can be quickly realized without being controlled by the base station while improving the resource utilization rate and reducing the collision probability.
本实施例分为两部分:基站分配随机种子实施例和基于伪随机序列的信道接入的传输实施例。The embodiment is divided into two parts: a base station allocation random seed embodiment and a pseudo random sequence based channel access transmission embodiment.
在基站分配随机种子实施例中:In the embodiment of assigning random seeds to the base station:
本实施例用于所有基于时频二维划分思想的资源分配情况。仅以授权辅助接入(Licensed Assisted Access,简称为LAA)场景下,D2D UE之间在非授权频段上的通信为例进行说明,图7是根据本发明实施例的应用场景示意图,如图7所示,This embodiment is used for all resource allocation situations based on the time-frequency two-dimensional partitioning idea. The communication between the D2D UEs on the unlicensed frequency band is taken as an example in the case of the Licenced Assisted Access (LAA) scenario. FIG. 7 is a schematic diagram of an application scenario according to an embodiment of the present invention. As shown,
本场景主要面向非授权频段的D2D接入问题,但是仍然需要基站进行调度控制,为不同的D2D对下发随机种子。This scenario is mainly for D2D access problems in unlicensed bands. However, the base station is still required to perform scheduling control to deliver random seeds for different D2D pairs.
图8是根据本发明实施例的基站分配随机种子示意图,具体过程如下:FIG. 8 is a schematic diagram of a base station assigning a random seed according to an embodiment of the present invention, and the specific process is as follows:
步骤Step 1,D2D UE上报数据传输请求:需要在非授权频段进行D2D通信的UE将传输请求上报给基站,利用PUCCH通过上行调度请求(Scheduling Request,简称为SR)请求基站为其分配相应的资源; Step 1: The D2D UE reports a data transmission request: the UE that needs to perform the D2D communication in the unlicensed frequency band reports the transmission request to the base station, and uses the PUCCH to request the base station to allocate the corresponding resource by using the scheduling request (Scheduling Request, SR for short). ;
步骤Step 2,基站汇总并分配随机种子:在一定长度的时间窗口内,基站汇总不同D2D UE的传输请求,并且根据业务的类型和数据量进行资源分配。其中,专用时隙完全由基站进行资源分配,同时基站为D2D对(D2D通信的发送端和接收端)分配相同的随机种子,不同D2D对的随机种子不同。Step 2: The base station aggregates and allocates random seeds: within a certain time window, the base station aggregates transmission requests of different D2D UEs, and performs resource allocation according to the type of service and the amount of data. The dedicated time slot is completely allocated by the base station, and the base station allocates the same random seed for the D2D pair (the transmitting end and the receiving end of the D2D communication), and the random seeds of the different D2D pairs are different.
本发明旨在设计合适的信道接入方式,提高资源利用率,同时在不受基站控制的情况下能够实现D2D对之间的快速资源接入。本实施例采用了两种生成伪随机序列的方法,并利用产生的伪随机序列进行半随机的信道接入。The invention aims to design a suitable channel access mode, improve resource utilization, and realize fast resource access between D2D pairs without being controlled by the base station. This embodiment adopts two methods for generating a pseudo-random sequence, and uses the generated pseudo-random sequence to perform semi-random channel access.
图9是根据本发明实施例的产生伪随机序列的可选流程图一,如图9所示,方法一包括如下:FIG. 9 is an optional flowchart 1 for generating a pseudo-random sequence according to an embodiment of the present invention. As shown in FIG. 9, the method 1 includes the following:
Step 1:假设存在两对D2D pair分别表示为D2D UE1(发送端)和D2D UE2(接收端),D2D UE3(发送端)和D2D UE4(接收端)。其中D2D UE1和D2D UE2拥有相同的随机种子S1,D2D UE 3和D2D UE4拥有相同的随机种子S2。利用不同的随机种子S1和S2根据Kent映射产生长度均为l的伪随机序列L1和L2。随机种子由基站进行分配,取值范围为(0,1)。其中Kent映射是一种具有逐段线性的混沌映射,其动力学方程为:Step 1: Assume that there are two pairs of D2D pairs denoted as D2D UE1 (transmitting end) and D2D UE2 (receiving end), D2D UE3 (transmitting end) and D2D UE4 (receiving end), respectively. Where D2D UE1 and D2D UE2 have the same random seed S 1 , D2D UE 3 and D2D UE4 have the same random seed S 2 . Using different random seeds S 1 and S 2 are mapped according to Kent generating pseudo random sequence length L 1 and l are L 2. The random seed is allocated by the base station and has a value range of (0, 1). The Kent map is a chaotic map with piecewise linearity. The dynamic equation is:
Figure PCTCN2017091227-appb-000003
Figure PCTCN2017091227-appb-000003
其中,a∈(0,1)。Among them, a∈(0,1).
对于D2D UE1和D2D UE2来说,随机种子S1相当于上述动力学方程的初始值,利用该初始值产生长度为l的伪随机序列L1。而D2D UE3和D2D UE4则利用随机种子S2产生长度同为l的随机序列L2。序列长度与共享时隙的时隙个数相等。若共享时隙的时长为4ms,则随机序列长度l为4。For D2D UE1 and D2D UE2, the random seed S 1 corresponds to the initial value of the above dynamic equation, with which the pseudo-random sequence L 1 of length l is generated. The D2D UE3 and the D2D UE4 use the random seed S 2 to generate a random sequence L 2 of the same length l. The sequence length is equal to the number of slots in the shared slot. If the duration of the shared time slot is 4 ms, the random sequence length l is 4.
选择Kent映射的原因是因为其分布函数比较均匀,可以比较好的映射到相应的资源块MRB上,并且还具有优秀的统计特性。通常采用的Kent 映射取参数a=0.5,但是由于处理器精度的缺失,该序列会迅速归零,所以在本发明中产生混沌序列时取参数a=0.7。The reason for choosing Kent mapping is that its distribution function is relatively uniform, it can be mapped to the corresponding resource block MRB relatively well, and it also has excellent statistical characteristics. Commonly used Kent The mapping takes the parameter a=0.5, but the sequence will quickly return to zero due to the lack of processor precision, so the parameter a=0.7 is taken when generating the chaotic sequence in the present invention.
假设基站分配的随机种子的值为0.5,共享时隙的长度为4ms,则可得产生的随机序列的长度应为4,通过Kent映射产生的混沌序列为0.7143、0.9524、0.1587、0.2268。该例对应的是D2D UE在一个时隙上只分配一个MRB的情况。Assuming that the value of the random seed allocated by the base station is 0.5 and the length of the shared time slot is 4 ms, the length of the generated random sequence should be 4, and the chaotic sequence generated by Kent mapping is 0.7143, 0.9524, 0.1587, 0.2268. This example corresponds to the case where the D2D UE allocates only one MRB in one time slot.
Step 2:将步骤1得到的随机数值记为mi(i=1,2,...,l)映射至各个MRB对应的频段。在本发明中,假设一个时隙内在对应频域上有50个MRB,则将分布在[0,1]范围内的mi乘以50之后再取整可得其对应的MRB编号,其计算方法如下:Step 2: Record the random value obtained in step 1 as m i (i=1, 2, . . . , l) to the frequency band corresponding to each MRB. In the present invention, assuming that there are 50 MRBs in the corresponding frequency domain in one time slot, multiplying m i distributed in the range of [0, 1] by 50 and then rounding up to obtain the corresponding MRB number, the calculation is performed. Methods as below:
Figure PCTCN2017091227-appb-000004
Figure PCTCN2017091227-appb-000004
假设一个时隙在对应的频域上有100个MRB,则计算方法对应如下:Assuming that a time slot has 100 MRBs in the corresponding frequency domain, the calculation method corresponds to the following:
Figure PCTCN2017091227-appb-000005
Figure PCTCN2017091227-appb-000005
考虑到实际传输的过程中,D2D UE需要传输的业务可能需要多个MRB才能够完成。本实施例提出了如下几种D2D UE对应一个时隙分配多个MRB的方法,假设工4个时隙,每个时隙需要为一个D2DUE分配3个MRB,其中,Considering the actual transmission process, the service that the D2D UE needs to transmit may require multiple MRBs to complete. This embodiment provides the following methods for allocating multiple MRBs for one D2D UE corresponding to one time slot. It is assumed that four time slots are required, and each time slot needs to allocate three MRBs for one D2D UE, where
1.基站直接下发3个随机种子,对应不同的随机种子可以产生3个随机序列。例如基站给D2D UE1分配随机种子0.4、0.5和0.6。共享时隙的长度为4ms,则随机种子产生的序列长度均为4。随机种子0.4通过Kent映射产生的序列为0.5714、0.8163、0.6122、0.8746,映射对应的MRB编号为28、40、30、43;随机种子0.5通过Kent映射产生的序列为0.7143、0.9524、0.1587、0.2268,映射对应的MRB编号为35、47、7、11;随机种子0.6通过Kent映射产生的序列为0.8571、0.4762、0.6803、0.9712,映射对应的MRB编号为42、23、34、48。所以对应在第一个共享时隙可以占用编号为28、35和42资源块,第二个共享时隙上可以占用编号为40、23和47的资源块,依次类推。若基站分配三个以上的随机种子,方法同 上;1. The base station directly delivers three random seeds, and three random sequences can be generated corresponding to different random seeds. For example, the base station assigns random seeds 0.4, 0.5, and 0.6 to D2D UE1. The length of the shared time slot is 4 ms, and the sequence length generated by the random seed is 4. The sequence generated by the random seed 0.4 by Kent mapping is 0.5714, 0.8163, 0.6122, 0.8746, and the corresponding MRB numbers are 28, 40, 30, 43; the sequence generated by the random seed 0.5 by Kent mapping is 0.7143, 0.9524, 0.1587, 0.2268, The MRB numbers corresponding to the mapping are 35, 47, 7, and 11; the sequences generated by the random seed 0.6 through the Kent mapping are 0.8571, 0.4762, 0.6803, and 0.9712, and the corresponding MRB numbers are 42, 23, 34, and 48. Therefore, the resource blocks numbered 28, 35, and 42 may be occupied in the first shared time slot, and the resource blocks numbered 40, 23, and 47 may be occupied on the second shared time slot, and so on. If the base station allocates more than three random seeds, the method is the same on;
2.基站向D2D UE分配随机种子、偏移量(可以约定,一旦约定后不再通过信令发送)和数量值3。利用该偏移量可以计算出其他2个随机种子的值。比如说基站分配随机种子数为0.5,偏移量为0.02,若此时一个时隙上占用3个MRB,则实际上产生的随机种子为0.5、0.52和0.54,然后利用上述随机种子产生随机序列进行映射。2. The base station allocates a random seed, an offset to the D2D UE (which can be agreed to be sent by signaling once agreed) and a value of 3. Using this offset, the values of the other 2 random seeds can be calculated. For example, if the number of random seeds allocated by the base station is 0.5 and the offset is 0.02, if three MRBs are occupied in one time slot, the random seeds actually generated are 0.5, 0.52, and 0.54, and then the random seed is used to generate a random sequence. Map.
3.不管D2D UE需要占用多少个MRB,基站都向D2D UE分配一个随机种子,不同D2D对的随机种子不同。假设存在D2D UE1,其对应共享时隙的时长为4ms,若此时在一个时隙上占用3个MRB,则实际生成的序列长度为4×3=12。假设基站分配的随机种子为0.5,则通过Kent映射产生的序列为0.7143、0.9524、0.1587、0.2268、0.3239、0.4628、0.6611、0.9444、0.1852、0.2646、0.3780、0.5400,映射后对应的MRB编号为35、47、7、11、16、23、33、47、9、13、18、27。在选取每个时隙所需的资源块时,可以按照一定的规则顺序选择,例如将MRB编号为35、47和7的资源块分配到第一个时隙,11、16和23资源块分配到第二个时隙,依次类推;也可以任意选择3个MRB分配到第一个时隙,第二个时隙从剩余的9个MRB中再任选3个MRB分配到第二个时隙,依此类推。同时,还存在每个时隙上需要的资源块不同情况,例如四个时隙上分别需要2、3、3、4个资源块,则对每个时隙上资源块的选择,既可以采用顺序选择的方式,即把编号35、47的资源块分配给第一个时隙,编号为7、11、16的资源块分配给第二个时隙,依此类推;也可以采取任意选择资源块的方式,对于第一个时隙任选2个资源块,第二个时隙从剩余10个资源块中选择3个MRB,依此类推。3. Regardless of how many MRBs the D2D UE needs to occupy, the base station allocates a random seed to the D2D UE, and the random seeds of different D2D pairs are different. It is assumed that D2D UE1 exists, and the duration of the corresponding shared time slot is 4 ms. If three MRBs are occupied in one time slot at this time, the actually generated sequence length is 4×3=12. Assuming that the random seed allocated by the base station is 0.5, the sequence generated by the Kent mapping is 0.7143, 0.9524, 0.1587, 0.2268, 0.3239, 0.4628, 0.6611, 0.9444, 0.1852, 0.2646, 0.3780, 0.5400, and the corresponding MRB number is 35 after mapping. 47, 7, 11, 16, 23, 33, 47, 9, 13, 18, 27. When selecting the resource blocks required for each time slot, it may be selected according to a certain rule order, for example, resource blocks with MRB numbers 35, 47, and 7 are allocated to the first time slot, and resource blocks are allocated for 11, 16, and 23. To the second time slot, and so on; it is also possible to arbitrarily select three MRBs to be allocated to the first time slot, and the second time slot to allocate three more MRBs from the remaining nine MRBs to the second time slot. ,So on and so forth. At the same time, there are different resource blocks required in each time slot. For example, if two, 3, 3, and 4 resource blocks are needed on four time slots, the selection of resource blocks on each time slot may be adopted. The sequential selection method is to allocate the resource blocks of numbers 35 and 47 to the first time slot, the resource blocks numbered 7, 11, and 16 to the second time slot, and so on; In the block mode, two resource blocks are selected for the first time slot, the second time slot selects three MRBs from the remaining 10 resource blocks, and so on.
由于基站给发送端和接收端分配相同的随机种子,故相应的发送端和接收端产生混沌时间序列的状态是一致的,在同一时刻可以接入到相同的MRB资源块,进行数据传输。Since the base station allocates the same random seed to the transmitting end and the receiving end, the state of the chaotic time sequence generated by the corresponding transmitting end and the receiving end is the same, and the same MRB resource block can be accessed at the same time for data transmission.
Step3:在每一个时隙,不同的D2D UE利用不同的随机种子产生不 同的伪随机序列,并且根据步骤二的映射结果接入到相应的资源块。由于Kent映射的分布函数比较均匀,可以大大减少不同D2D UE发生碰撞的概率,并且算法复杂度比较低,操作简单,开发容易。Step3: In each time slot, different D2D UEs use different random seeds to generate no The same pseudo-random sequence, and access to the corresponding resource block according to the mapping result of step 2. Since the distribution function of the Kent mapping is relatively uniform, the probability of collision of different D2D UEs can be greatly reduced, and the algorithm complexity is low, the operation is simple, and the development is easy.
如果在某一时隙的某一频段上,不同D2D UE映射的资源块结果相同,则发生碰撞,则等待下一时隙再尝试接入。而Kent映射具有良好的统计特性,所以发生上述情况的概率较小。图10是根据本发明实施例的基于混沌序列的信道接入示意图。If the resource blocks mapped by different D2D UEs have the same result in a certain frequency band of a certain time slot, a collision occurs, and then wait for the next time slot to try to access again. The Kent map has good statistical properties, so the probability of this happening is small. FIG. 10 is a schematic diagram of channel access based on chaotic sequences according to an embodiment of the present invention.
图11是根据本发明实施例的产生伪随机序列的可选流程图二,在方案二中,包括如下:11 is an optional flowchart 2 for generating a pseudo-random sequence according to an embodiment of the present invention. In the second scheme, the following is included:
Step 1:利用线性同余法产生伪随机序列的方法如下:Step 1: The method of generating a pseudo-random sequence using the linear congruence method is as follows:
xn+1=(axn+c)mod mx n+1 =(ax n +c)mod m
其中,x0表示随机种子(初始值),第i个D2D pair的随机种子用x0i表示。假设存在两对D2D pair分别表示为D2D UE1(发送端)和D2D UE2(接收端),D2D UE3(发送端)和D2D UE4(接收端)。其中D2D UE1和D2D UE2拥有相同的随机种子x01,D2D UE 3和D2D UE4拥有相同的随机种子x02。利用不同的随机种子x01和x02采用线性同余的方法产生相同长度的随机序列X1和X2。其中随机序列的长度由共享时隙的时隙个数决定。Where x 0 represents a random seed (initial value), and a random seed of the i-th D2D pair is represented by x 0i . It is assumed that there are two pairs of D2D pairs denoted as D2D UE1 (transmitting end) and D2D UE2 (receiving end), D2D UE3 (transmitting end) and D2D UE4 (receiving end), respectively. Where D2D UE1 and D2D UE2 have the same random seed x 01 , D2D UE 3 and D2D UE4 have the same random seed x 02 . The random sequences X 1 and X 2 of the same length are generated using a linear congruence method using different random seeds x 01 and x 02 . The length of the random sequence is determined by the number of time slots of the shared time slot.
上式中,a,c和m皆为整数,其序列的随机性来源于取模运算。对于模数m的选择,应该尽可能的大,因为序列的周期不可能大于m。在本发明中假设每个时隙上有50个MRB,所以m的数值至少应该大于50。M.Greenberger证明:用线性乘同余方法产生伪随机数序列具有周期m的条件如下:In the above formula, a, c and m are integers, and the randomness of the sequence is derived from the modulo operation. The choice of the modulus m should be as large as possible because the period of the sequence cannot be greater than m. In the present invention it is assumed that there are 50 MRBs per time slot, so the value of m should be at least 50. M. Greenberger proves that the condition of generating a pseudo-random number sequence with a period m using the linear multiplication congruence method is as follows:
c和m为互质数;c and m are mutually prime numbers;
a-1是质数p的倍数,其中p是a-1和m的公约数;A-1 is a multiple of prime number p, where p is the common divisor of a-1 and m;
如果m是4的倍数,a-1也是4的倍数。If m is a multiple of 4, a-1 is also a multiple of 4.
具体a,c和m的取值可以根据实际应用情况确定。若每个时隙上有 50个MRB,一种可能的情况为a=29,c=23,m=56。若每个时隙对应的频域上有100个MRB,一种可能的取值情况为a=53,c=37,m=104。The values of specific a, c and m can be determined according to the actual application. If there is on every time slot 50 MRB, one possible case is a = 29, c = 23, m = 56. If there are 100 MRBs in the frequency domain corresponding to each time slot, one possible value is a=53, c=37, and m=104.
假设基站分配的随机种子的值为1,共享时隙的长度为4ms,则可得产生的随机序列的长度应为4,通过线性同余法产生的序列为52、19、14、37。该例对应的是D2D UE在一个时隙上只分配一个MRB的情况。Assuming that the value of the random seed allocated by the base station is 1, and the length of the shared time slot is 4 ms, the length of the generated random sequence should be 4, and the sequence generated by the linear congruence method is 52, 19, 14, 37. This example corresponds to the case where the D2D UE allocates only one MRB in one time slot.
Step 2:将步骤1得到的随机序列转换为[0,1]范围内的随机序列,转换公式如下:Step 2: Convert the random sequence obtained in step 1 into a random sequence in the range [0, 1], and the conversion formula is as follows:
Figure PCTCN2017091227-appb-000006
Figure PCTCN2017091227-appb-000006
Step 3:将步骤2中得到的随机数值yn映射至各个MRB对应的频段。若一个时隙内在对应频域上有50个MRB,则将分布在[0,1]范围内的yn乘以50之后再取整可得其对应的MRB编号,其计算方法如下:Step 3: Map the random value y n obtained in step 2 to the frequency band corresponding to each MRB. If there are 50 MRBs in the corresponding frequency domain in one time slot, multiply y n distributed in the range of [0, 1] by 50 and then round up to obtain the corresponding MRB number. The calculation method is as follows:
Figure PCTCN2017091227-appb-000007
Figure PCTCN2017091227-appb-000007
若一个时隙在对应频域上有100个MRB,则对应的计算方法如下:If a time slot has 100 MRBs in the corresponding frequency domain, the corresponding calculation method is as follows:
Figure PCTCN2017091227-appb-000008
Figure PCTCN2017091227-appb-000008
1.基站直接下发3个随机种子,对应不同的随机种子可以产生3个随机序列。例如基站给D2D UE1分配随机种子1、2和3。共享时隙的长度为4ms,则随机种子产生的序列长度均为4。利用随机种子1通过线性同余法产生的序列为52、19、14、37,映射对应的MRB编号为46、16、12、33;随机种子2通过线性同余法产生的序列为25、20、43、38,映射对应的MRB编号为22、17、38、33;随机种子3通过线性同余法产生的序列为54、21、16、39,映射对应的MRB编号为48、18、14、34。所以对应在第一个共享时隙可以占用编号为46、22和48资源块,第二个共享时隙上可以占用编号为16、17和18的资源块,依次类推。若基站分配三个以上的随机种子,方法同上;1. The base station directly delivers three random seeds, and three random sequences can be generated corresponding to different random seeds. For example, the base station assigns random seeds 1, 2, and 3 to D2D UE1. The length of the shared time slot is 4 ms, and the sequence length generated by the random seed is 4. The sequence generated by the linear congruence method using random seed 1 is 52, 19, 14, 37, and the corresponding MRB numbers are 46, 16, 12, 33; the sequence generated by the random seed 2 by the linear congruence method is 25, 20 43,43, 38, the corresponding MRB numbers are 22, 17, 38, 33; the sequence generated by the random seed 3 by the linear congruence method is 54, 21, 16, 39, and the corresponding MRB numbers are 48, 18, and 14 34. Therefore, the resource blocks numbered 46, 22, and 48 may be occupied in the first shared time slot, and the resource blocks numbered 16, 17, and 18 may be occupied on the second shared time slot, and so on. If the base station allocates more than three random seeds, the method is the same as above;
2.基站向D2D UE分配随机种子、偏移量(可以约定,一旦约定后不再通过信令发送)。利用该偏移量可以计算出其他2个随机种子的值。比如说基站分配随机种子数为1,偏移量为1,若此时一个时隙上占用3个 MRB,则实际上产生的随机种子为1、2和3,然后利用上述随机种子产生随机序列进行映射。2. The base station allocates a random seed and an offset to the D2D UE (it may be agreed that it is not sent by signaling once agreed). Using this offset, the values of the other 2 random seeds can be calculated. For example, the number of random seeds allocated by the base station is 1, and the offset is 1, if at this time, 3 slots are occupied. MRB, the randomly generated random seeds are 1, 2, and 3, and then use the random seed to generate a random sequence for mapping.
3.不管D2D UE需要占用多少个MRB,基站都向D2D UE分配一个随机种子,不同D2D对的随机种子不同。假设存在D2D UE1,其对应共享时隙的时长为4ms,若此时在一个时隙上占用3个MRB,则实际生成的序列长度为4×3=12。假设基站分配的随机种子为1,则通过线性同余法产生的序列为52、19、14、37、32、55、50、17、12、35、30、53,映射后对应的MRB编号为46、16、12、33、28、49、44、15、10、31、26、47。在选取每个时隙所需的资源块时,可以按照一定的规则顺序选择,例如将MRB编号为46、16和12的资源块分配到第一个时隙,33、28和49资源块分配到第二个时隙,依次类推;也可以任意选择3个MRB分配到第一个时隙,第二个时隙从剩余的9个MRB中再任选3个MRB分配到第二个时隙,依此类推。同时,还存在每个时隙上需要的资源块不同情况,例如四个时隙上分别需要2、3、3、4个资源块,则对每个时隙上资源块的选择,既可以采用顺序选择的方式,即把编号46、16的资源块分配给第一个时隙,编号为12、33、28的资源块分配给第二个时隙,依此类推;也可以采取任意选择资源块的方式,对于第一个时隙任选2个资源块,第二个时隙从剩余10个资源块中选择3个MRB,依此类推。3. Regardless of how many MRBs the D2D UE needs to occupy, the base station allocates a random seed to the D2D UE, and the random seeds of different D2D pairs are different. It is assumed that D2D UE1 exists, and the duration of the corresponding shared time slot is 4 ms. If three MRBs are occupied in one time slot at this time, the actually generated sequence length is 4×3=12. Assuming that the random seed assigned by the base station is 1, the sequence generated by the linear congruence method is 52, 19, 14, 37, 32, 55, 50, 17, 12, 35, 30, 53, and the corresponding MRB number after mapping is 46, 16, 12, 33, 28, 49, 44, 15, 10, 31, 26, 47. When selecting the resource blocks required for each time slot, it may be selected according to a certain rule order, for example, resource blocks with MRB numbers 46, 16, and 12 are allocated to the first time slot, and resource blocks are allocated for 33, 28, and 49. To the second time slot, and so on; it is also possible to arbitrarily select three MRBs to be allocated to the first time slot, and the second time slot to allocate three more MRBs from the remaining nine MRBs to the second time slot. ,So on and so forth. At the same time, there are different resource blocks required in each time slot. For example, if two, 3, 3, and 4 resource blocks are needed on four time slots, the selection of resource blocks on each time slot may be adopted. The sequential selection method is to allocate the resource blocks of numbers 46 and 16 to the first time slot, the resource blocks numbered 12, 33, and 28 to the second time slot, and so on; In the block mode, two resource blocks are selected for the first time slot, the second time slot selects three MRBs from the remaining 10 resource blocks, and so on.
由于基站给发送端和接收端分配相同的随机种子,故相应的发送端和接收端产生线性同余序列的状态是一致的,在同一时刻可以接入到相同的MRB资源块,进行数据传输。Since the base station allocates the same random seed to the transmitting end and the receiving end, the corresponding transmitting end and the receiving end generate the same state of the linear congruence sequence, and can access the same MRB resource block at the same time for data transmission.
Step4:在每一个时隙,不同的D2D UE利用不同的随机种子产生不同的伪随机序列,并且根据步骤三的映射结果接入到相应的资源块。该方法实现简单,算法复杂度较低,开发容易。Step 4: In each time slot, different D2D UEs generate different pseudo-random sequences by using different random seeds, and access to the corresponding resource blocks according to the mapping result of step 3. The method is simple to implement, the algorithm complexity is low, and the development is easy.
如果在某一时隙的某一频段上,不同D2D UE映射的资源块结果相同,则发生碰撞,则等待下一时隙再尝试接入。If the resource blocks mapped by different D2D UEs have the same result in a certain frequency band of a certain time slot, a collision occurs, and then wait for the next time slot to try to access again.
图12是根据本发明实施例的传输流程图,如图12所示,是根据本实 施例的总的传输流程图。FIG. 12 is a transmission flow chart according to an embodiment of the present invention, as shown in FIG. The overall transmission flow chart of the example.
本实施例中的基站为D2D对分配随机种子,在一定长度的时间窗口内,基站汇总不同D2D UE的传输请求,并且根据业务的类型和数据量进行资源和随机种子的分配。随机种子的分配原则为:基站为D2D对(D2D通信的发送端和接收端)分配相同的随机种子,从而在共享时隙进行竞争接入时发送端和接收端可以快速同步地接入到相同MRB;不同的D2D对间分配的随机种子不同,从而减少在竞争接入时的资源碰撞。The base station in this embodiment allocates a random seed to the D2D pair. In a certain time window, the base station aggregates transmission requests of different D2D UEs, and allocates resources and random seeds according to the type of service and the amount of data. The principle of allocation of random seeds is: the base station allocates the same random seed to the D2D pair (the transmitting end and the receiving end of the D2D communication), so that the transmitting end and the receiving end can quickly and synchronously access the same when the shared time slot is used for contention access. MRB; different D2D pairs are assigned different random seeds, thereby reducing resource collisions during competing access.
本实施例的基于伪随机序列进行信道接入,首先D2D通信对的发送端和接收端根据基站为自己分配的相同随机种子按照一定生成算法产生状态一致的伪随机序列,然后对该伪随机序列进行一定的运算得到其对应的MRB资源块编号,此时发送端和接收端即可快速同步地接入到统一MRB资源块完成数据传输。而不同D2D对之间由于随机种子的不同会产生不同的MRB编号从而接入其他信道避免碰撞。In this embodiment, the channel access is performed based on the pseudo-random sequence. First, the transmitting end and the receiving end of the D2D communication pair generate a pseudo-random sequence with the same state according to a certain generation algorithm according to the same random seed allocated by the base station, and then the pseudo-random sequence is obtained. A certain operation is performed to obtain the corresponding MRB resource block number. At this time, the transmitting end and the receiving end can quickly access the unified MRB resource block to complete the data transmission. Different D2D pairs may generate different MRB numbers due to different random seeds to access other channels to avoid collision.
通过本实施例,根据UE上报的传输请求,基站可以给同一D2D对分配相同的随机种子从而产生状态一致的随机序列,在共享时隙进行随机接入时发送端和接收端可以快速同步接入到相同MRB资源块完成数据传输,缩短接入时间,由于混沌序列本身具有较好的统计特性,因此不同D2D UE产生随机序列互不相同,可以减少在竞争接入时发生的资源碰撞,提高资源利用率。In this embodiment, according to the transmission request reported by the UE, the base station may allocate the same random seed to the same D2D pair to generate a random sequence with the same state. When the shared time slot performs random access, the transmitting end and the receiving end may quickly synchronize the access. The data transmission is completed to the same MRB resource block, and the access time is shortened. Since the chaotic sequence itself has good statistical characteristics, the random sequences generated by different D2D UEs are different from each other, which can reduce resource collisions during competition access and improve resources. Utilization rate.
实施例4Example 4
本发明的实施例还提供了一种存储介质。可选地,在本实施例中,上述存储介质可以被设置为存储用于执行以下步骤的程序代码:Embodiments of the present invention also provide a storage medium. Optionally, in the embodiment, the foregoing storage medium may be configured to store program code for performing the following steps:
S1,接收设备到设备D2D终端发送的传输请求,其中,传输请求用于请求分配传输资源;S1. The transmission request sent by the device to the device D2D terminal, where the transmission request is used to request to allocate a transmission resource;
S2,根据传输请求向D2D终端和D2D终端的传输对端分配相同的随机种子资源;其中,随机种子资源用于D2D终端产生相应的伪随机序列并利用伪随机序列进行信道接入。 S2. Allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request; wherein the random seed resource is used by the D2D terminal to generate a corresponding pseudo random sequence and use a pseudo random sequence for channel access.
可选地,在本实施例中,上述存储介质可以包括但不限于:U盘、只读存储器(ROM,Read-Only Memory)、随机存取存储器(RAM,Random Access Memory)、移动硬盘、磁碟或者光盘等各种可以存储程序代码的介质。Optionally, in this embodiment, the foregoing storage medium may include, but not limited to, a USB flash drive, a Read-Only Memory (ROM), a Random Access Memory (RAM), a mobile hard disk, and a magnetic memory. A variety of media that can store program code, such as a disc or a disc.
可选地,在本实施例中,处理器根据存储介质中已存储的程序代码执行接收设备到设备D2D终端发送的传输请求,其中,传输请求用于请求分配传输资源;Optionally, in this embodiment, the processor performs a transmission request sent by the receiving device to the device D2D terminal according to the stored program code in the storage medium, where the transmission request is used to request to allocate the transmission resource;
可选地,在本实施例中,处理器根据存储介质中已存储的程序代码执行根据传输请求向D2D终端和D2D终端的传输对端分配相同的随机种子资源;其中,随机种子资源用于D2D终端产生相应的伪随机序列并利用伪随机序列进行信道接入。Optionally, in this embodiment, the processor performs, according to the stored program code stored in the storage medium, allocating the same random seed resource to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request; wherein the random seed resource is used for D2D The terminal generates a corresponding pseudo-random sequence and uses a pseudo-random sequence for channel access.
可选地,本实施例中的具体示例可以参考上述实施例及可选实施方式中所描述的示例,本实施例在此不再赘述。For example, the specific examples in this embodiment may refer to the examples described in the foregoing embodiments and the optional embodiments, and details are not described herein again.
显然,本领域的技术人员应该明白,上述的本发明的各模块或各步骤可以用通用的计算装置来实现,它们可以集中在单个的计算装置上,或者分布在多个计算装置所组成的网络上,可选地,它们可以用计算装置可执行的程序代码来实现,从而,可以将它们存储在存储装置中由计算装置来执行,并且在某些情况下,可以以不同于此处的顺序执行所示出或描述的步骤,或者将它们分别制作成各个集成电路模块,或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样,本发明不限制于任何特定的硬件和软件结合。It will be apparent to those skilled in the art that the various modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein. The steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software.
以上所述仅为本发明的优选实施例而已,并不用于限制本发明,对于本领域的技术人员来说,本发明可以有各种更改和变化。凡在本发明的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本发明的保护范围之内。The above description is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.
工业实用性Industrial applicability
通过本发明实施例,接收设备到设备D2D终端发送的传输请求,其 中,所述传输请求用于请求分配传输资源,然后根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子资源,其中,所述随机种子资源用于所述D2D终端产生相应的伪随机序列并利用所述伪随机序列进行信道接入。由于对D2D通信的发送端和接收端分配相同的随机种子资源,因此可以在收发两端产生一致的伪随机序列,可以提高无线资源的利用率,由于不同D2D终端对之间产生的伪随机序列的随机性比较好,所以在同一时隙接入相同资源的概率减少,可以减少在竞争接入时发生的资源碰撞,同时实现在不受基站控制的情况下快速实现D2D终端间的资源接入,可以解决相关技术中在信道接入时资源利用率低的问题。 According to the embodiment of the present invention, the transmission request sent by the receiving device to the device D2D terminal is The transmission request is used to request to allocate a transmission resource, and then allocate the same random seed resource to the D2D terminal and the transmission peer of the D2D terminal according to the transmission request, where the random seed resource is used for the The D2D terminal generates a corresponding pseudo-random sequence and uses the pseudo-random sequence for channel access. Since the same random seed resource is allocated to the transmitting end and the receiving end of the D2D communication, a consistent pseudo-random sequence can be generated at both ends of the transmitting and receiving, which can improve the utilization of the radio resource due to the pseudo-random sequence generated between different pairs of D2D terminals. The randomness is better, so the probability of accessing the same resource in the same time slot is reduced, the resource collision occurring during the contention access can be reduced, and the resource access between the D2D terminals can be quickly realized without being controlled by the base station. The problem of low resource utilization in channel access in the related art can be solved.

Claims (20)

  1. 一种信道接入方法,包括:A channel access method includes:
    接收设备到设备D2D终端发送的传输请求,其中,所述传输请求用于请求分配传输资源;Receiving a transmission request sent by the device to the device D2D terminal, where the transmission request is used to request to allocate a transmission resource;
    根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子;Allocating the same random seed to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request;
    其中,所述随机种子用于所述D2D终端产生相应的伪随机序列并利用所述伪随机序列进行信道接入。The random seed is used by the D2D terminal to generate a corresponding pseudo random sequence and utilize the pseudo random sequence for channel access.
  2. 根据权利要求1所述的方法,其中,接收设备到设备D2D终端发送的传输请求包括:The method according to claim 1, wherein the transmission request sent by the receiving device to the device D2D terminal comprises:
    接收D2D终端利用物理上行链路控制信道PUCCH通过上行调度请求SR发送的上行链路资源;Receiving, by the D2D terminal, an uplink resource that is sent by the uplink scheduling request SR by using a physical uplink control channel PUCCH;
    在所述上行链路资源上接收所述传输请求。The transmission request is received on the uplink resource.
  3. 根据权利要求1所述的方法,其中,在根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子之前,所述方法还包括:The method according to claim 1, wherein the method further comprises: before allocating the same random seed to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request, the method further comprising:
    在预设长度的时间窗口内,汇总一个或多个D2D终端分别发送的传输请求,并解析各个传输请求所请求传输业务的数据量和/或业务类型。The transmission request sent by one or more D2D terminals is summarized in a preset time window, and the data volume and/or service type of the transmission service requested by each transmission request is parsed.
  4. 根据权利要求3所述的方法,其中,根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子包括:The method according to claim 3, wherein allocating the same random seed to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request comprises:
    根据所述数据量和/或所述业务类型向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子。And assigning the same random seed to the transmission peers of the D2D terminal and the D2D terminal according to the data volume and/or the service type.
  5. 根据权利要求1所述的方法,其中,根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子包括: The method according to claim 1, wherein allocating the same random seed to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request comprises:
    根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的专用时隙;和/或,Allocating the same dedicated time slot to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request; and/or,
    根据所述传输请求向所述D2D终端和所述D2D终端的传输对端预分配相同的备用时隙。And transmitting, by the transmission request, to the D2D terminal and the transmission peer of the D2D terminal, the same spare time slot.
  6. 根据权利要求1所述的方法,其中,根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子包括以下之一:The method according to claim 1, wherein assigning the same random seed to the transmission peer of the D2D terminal and the D2D terminal according to the transmission request comprises one of the following:
    根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配一个或多个相同的随机种子;Allocating one or more identical random seeds to the transmission peers of the D2D terminal and the D2D terminal according to the transmission request;
    根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子、偏移量、所述随机种子所包括的时隙对应的资源块单位MRB的个数。And transmitting, by the transmission request to the D2D terminal and the transmission peer of the D2D terminal, the same random seed, the offset, and the number of resource block units MRB corresponding to the time slot included in the random seed.
  7. 一种信道接入方法,包括:A channel access method includes:
    向基站发送传输请求,以及接收所述基站根据所述传输请求分配的随机种子;Transmitting a transmission request to the base station, and receiving a random seed allocated by the base station according to the transmission request;
    基于所述随机种子按照预设算法产生相应的伪随机序列;Generating a corresponding pseudo random sequence according to the preset algorithm based on the random seed;
    根据所述伪随机序列进行信道接入。Channel access is performed according to the pseudo random sequence.
  8. 根据权利要求7所述的方法,其中,根据所述伪随机序列进行信道接入包括:The method of claim 7, wherein channel accessing according to the pseudo-random sequence comprises:
    根据所述伪随机序列得到相应的资源块单位MRB的资源块编号;Obtaining a resource block number of the corresponding resource block unit MRB according to the pseudo random sequence;
    接入到所述资源块编号对应的MRB所属的信道。Accessing to the channel to which the MRB corresponding to the resource block number belongs.
  9. 根据权利要求7所述的方法,其中,所述随机种子包括专用时隙和/或备用时隙。The method of claim 7, wherein the random seed comprises a dedicated time slot and/or a spare time slot.
  10. 根据权利要求7所述的方法,其中,所述预设算法包括以下之一:Kent映射、线性同余法。 The method of claim 7, wherein the preset algorithm comprises one of: a Kent mapping, a linear congruence method.
  11. 根据权利要求8所述的方法,其中,在所述预设算法为Kent映射时,基于所述随机种子按照Kent映射产生预设长度的伪随机序列包括:The method according to claim 8, wherein when the preset algorithm is Kent mapping, generating a pseudo-random sequence of a preset length according to the Kent mapping based on the random seed comprises:
    按照以下公式计算所述伪随机序列xn+1The pseudo-random sequence x n+1 is calculated according to the following formula:
    Figure PCTCN2017091227-appb-100001
    Figure PCTCN2017091227-appb-100001
    其中,xn为时隙编号为n的伪随机序列,n为时隙编号,a为常量,a∈(0,1)。Where x n is a pseudo-random sequence with slot number n, n is the slot number, and a is a constant, a ∈ (0, 1).
  12. 根据权利要求11所述的方法,其中,所述伪随机序列的长度和所述时隙个数相同。The method of claim 11 wherein the length of the pseudo-random sequence is the same as the number of time slots.
  13. 根据权利要求11所述的方法,其中,所述a=0.7。The method of claim 11 wherein said a = 0.7.
  14. 根据权利要求8所述的方法,其中,在所述预设算法为线性同余法时,基于所述随机种子按照预设算法产生相应的伪随机序列包括:The method according to claim 8, wherein when the preset algorithm is a linear congruence method, generating a corresponding pseudo-random sequence according to the preset algorithm based on the random seed comprises:
    按照以下公式计算所述伪随机序列xn+1The pseudo-random sequence x n+1 is calculated according to the following formula:
    xn+1=(axn+c)mod m;x n+1 =(ax n +c)mod m;
    其中,所述m为大于A的整数,A为所述随机种子包括的单个时隙的MRB个数,a、c分别为与所述A相关的预设值,xn为时隙编号为n的伪随机序列,n为时隙编号。Wherein m is an integer greater than A, A is the number of MRBs of a single time slot included in the random seed, a and c are preset values associated with the A, and x n is a slot number n A pseudo-random sequence, where n is the slot number.
  15. 根据权利要求11或14所述的方法,其中,根据所述伪随机序列得到相应的资源块单位MRB的资源块编号包括:N=[mi*A];The method according to claim 11 or 14, wherein the resource block number of the corresponding resource block unit MRB obtained according to the pseudo random sequence comprises: N = [m i * A];
    其中,所述mi为所述伪随机序列分布在[0,1]范围内的随机数值,A为所述随机种子包括的单个时隙内对应频域上的MRB个数,[]表示向下取整,i为时隙编号。Wherein, the mi is a random number whose pseudo-random sequence is distributed in the range of [0, 1], and A is the number of MRBs in the corresponding frequency domain in a single time slot included in the random seed, [] indicates Round down, i is the slot number.
  16. 一种信道接入装置,包括: A channel access device includes:
    接收模块,设置为接收设备到设备D2D终端发送的传输请求,其中,所述传输请求用于请求分配传输资源;a receiving module, configured to receive a transmission request sent by the device to the device D2D terminal, where the transmission request is used to request to allocate a transmission resource;
    分配模块,设置为根据所述传输请求向所述D2D终端和所述D2D终端的传输对端分配相同的随机种子;An allocating module, configured to allocate the same random seed to the D2D terminal and the transmission peer of the D2D terminal according to the transmission request;
    其中,所述随机种子用于所述D2D终端产生相应的伪随机序列并利用所述伪随机序列进行信道接入。The random seed is used by the D2D terminal to generate a corresponding pseudo random sequence and utilize the pseudo random sequence for channel access.
  17. 一种信道接入装置,包括:A channel access device includes:
    请求模块,设置为向基站发送传输请求,以及接收所述基站根据所述传输请求分配的随机种子;a requesting module, configured to send a transmission request to the base station, and receive a random seed allocated by the base station according to the transmission request;
    计算模块,设置为基于所述随机种子按照预设算法产生相应的伪随机序列;a calculating module, configured to generate a corresponding pseudo random sequence according to the preset algorithm based on the random seed;
    接入模块,设置为根据所述伪随机序列进行信道接入。The access module is configured to perform channel access according to the pseudo random sequence.
  18. 一种信道接入***,包括:D2D通信的发送端、D2D通信的接收端,基站,其中,A channel access system includes: a transmitting end of D2D communication, a receiving end of D2D communication, and a base station, where
    所述基站还包括:The base station further includes:
    第一接收模块,设置为接收所述发送端发送的传输请求,其中,所述传输请求用于请求分配传输资源;a first receiving module, configured to receive a transmission request sent by the sending end, where the transmission request is used to request to allocate a transmission resource;
    分配模块,设置为根据所述传输请求向所述发送端和所述接收端分配相同的随机种子;An allocating module, configured to allocate the same random seed to the sending end and the receiving end according to the transmission request;
    请求模块,设置为向基站发送所述传输请求,以及接收所述基站根据所述传输请求分配的随机种子;a requesting module, configured to send the transmission request to a base station, and receive a random seed allocated by the base station according to the transmission request;
    第一计算模块,设置为基于所述随机种子按照预设算法产生相应的伪随机序列;a first calculating module, configured to generate a corresponding pseudo random sequence according to the preset algorithm based on the random seed;
    第一接入模块,设置为根据所述伪随机序列进行信道接入; a first access module, configured to perform channel access according to the pseudo random sequence;
    所述接收端包括:The receiving end includes:
    第二接收模块,设置为接收所述基站根据所述传输请求分配的随机种子;a second receiving module, configured to receive a random seed allocated by the base station according to the transmission request;
    第二计算模块,设置为基于所述随机种子按照预设算法产生相应的伪随机序列;a second calculating module, configured to generate a corresponding pseudo random sequence according to the preset algorithm based on the random seed;
    第二接入模块,设置为根据所述伪随机序列进行信道接入。The second access module is configured to perform channel access according to the pseudo random sequence.
  19. 一种存储介质,其特征在于,所述存储介质包括存储的程序,其中,所述程序运行时执行权利要求1至6中任一项所述的方法。A storage medium, characterized in that the storage medium comprises a stored program, wherein the program is executed to perform the method of any one of claims 1 to 6.
  20. 一种存储介质,其特征在于,所述存储介质包括存储的程序,其中,所述程序运行时执行权利要求7至15中任一项所述的方法。 A storage medium, characterized in that the storage medium comprises a stored program, wherein the program is executed to perform the method of any one of claims 7 to 15.
PCT/CN2017/091227 2016-07-08 2017-06-30 Channel access method, apparatus and system, and storage medium WO2018006759A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610541534.4 2016-07-08
CN201610541534.4A CN107592626A (en) 2016-07-08 2016-07-08 Channel access method, apparatus and system

Publications (1)

Publication Number Publication Date
WO2018006759A1 true WO2018006759A1 (en) 2018-01-11

Family

ID=60911988

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/091227 WO2018006759A1 (en) 2016-07-08 2017-06-30 Channel access method, apparatus and system, and storage medium

Country Status (2)

Country Link
CN (1) CN107592626A (en)
WO (1) WO2018006759A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109451870A (en) * 2018-05-18 2019-03-08 北京小米移动软件有限公司 Uplink data transmission method, device and computer readable storage medium
CN115334488A (en) * 2022-08-15 2022-11-11 煤炭科学技术研究院有限公司 Mining mobile emergency communication system and method

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113891295B (en) * 2021-11-09 2023-05-02 中国联合网络通信集团有限公司 Information sending method, device and equipment based on D2D technology

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102984699A (en) * 2012-12-03 2013-03-20 中国联合网络通信集团有限公司 D2D (device-to-device) communication data processing method, equipment and system
CN104885379A (en) * 2012-12-21 2015-09-02 Lg电子株式会社 Method and device for transmitting discovery signal
CN105379404A (en) * 2014-01-24 2016-03-02 华为技术有限公司 Information transmission method and device
WO2016048428A1 (en) * 2014-09-25 2016-03-31 Intel IP Corporation Apparatuses, systems, and methods for probabilistic transmission of device-to-device (d2d) discovery messages
CN105592523A (en) * 2014-10-21 2016-05-18 中兴通讯股份有限公司 Device discovery apparatus and device discovery method for device-to-device communication

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102984699A (en) * 2012-12-03 2013-03-20 中国联合网络通信集团有限公司 D2D (device-to-device) communication data processing method, equipment and system
CN104885379A (en) * 2012-12-21 2015-09-02 Lg电子株式会社 Method and device for transmitting discovery signal
CN105379404A (en) * 2014-01-24 2016-03-02 华为技术有限公司 Information transmission method and device
WO2016048428A1 (en) * 2014-09-25 2016-03-31 Intel IP Corporation Apparatuses, systems, and methods for probabilistic transmission of device-to-device (d2d) discovery messages
CN105592523A (en) * 2014-10-21 2016-05-18 中兴通讯股份有限公司 Device discovery apparatus and device discovery method for device-to-device communication

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109451870A (en) * 2018-05-18 2019-03-08 北京小米移动软件有限公司 Uplink data transmission method, device and computer readable storage medium
CN109451870B (en) * 2018-05-18 2023-10-10 北京小米移动软件有限公司 Uplink data transmission method, device and computer readable storage medium
CN115334488A (en) * 2022-08-15 2022-11-11 煤炭科学技术研究院有限公司 Mining mobile emergency communication system and method

Also Published As

Publication number Publication date
CN107592626A (en) 2018-01-16

Similar Documents

Publication Publication Date Title
US11039448B2 (en) Resource scheduling method and apparatus
WO2017092535A1 (en) Transmission method and device for reference signal sequence
JP7084993B2 (en) Grouping and use of short sequence signals
WO2015016970A1 (en) Coverage-deficient terminal connection procedures
KR20190125355A (en) Method and apparatus for scheduling request in NB IOT systems
JP2019521573A (en) Method and apparatus for resource configuration, and base station
WO2018006759A1 (en) Channel access method, apparatus and system, and storage medium
CN109618309B (en) Machine communication random access method based on time slot multiplexing
WO2021013021A1 (en) Physical uplink control channel resource configuration method and apparatus
JP2020506590A (en) Data packet transmission method and terminal
WO2018006762A1 (en) Method, device and system for processing pseudo random sequence, and storage medium
CN111294940B (en) Transmission power distribution method and device, storage medium and terminal
WO2020173295A1 (en) Random access method and apparatus
CN110971362B (en) Discovery reference signal sending method and device
JP6587259B2 (en) Unlicensed carrier competition method and apparatus
WO2017031643A1 (en) Resource allocation, resource type instruction and recognition, and data receiving methods and apparatuses
US20210058929A1 (en) Uplink transmission resource allocation method and apparatus
TWI698144B (en) Resource allocation method, terminal and network side equipment
JP7055874B2 (en) Information transmission method and equipment
WO2018141214A1 (en) Data transmission method, terminal device and storage medium
WO2017133643A1 (en) Method and device for random access
US20190090281A1 (en) Method and apparatus for supporting sub-channel physical resource block uplink transmission in a wireless communication system
WO2019157679A1 (en) Information indication method and related device
WO2019178729A1 (en) Random access method and apparatus
Swain et al. A Novel RACH Scheme for Efficient Access in 5G and Beyond Networks using Hash Function

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17823571

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17823571

Country of ref document: EP

Kind code of ref document: A1