CN115119337A - Method and device used in wireless communication - Google Patents
Method and device used in wireless communication Download PDFInfo
- Publication number
- CN115119337A CN115119337A CN202110284507.4A CN202110284507A CN115119337A CN 115119337 A CN115119337 A CN 115119337A CN 202110284507 A CN202110284507 A CN 202110284507A CN 115119337 A CN115119337 A CN 115119337A
- Authority
- CN
- China
- Prior art keywords
- message
- random access
- threshold
- access resource
- candidate
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 104
- 238000004891 communication Methods 0.000 title claims abstract description 75
- 230000005540 biological transmission Effects 0.000 claims abstract description 72
- 230000009471 action Effects 0.000 claims abstract description 8
- 230000004044 response Effects 0.000 claims abstract description 7
- 230000001934 delay Effects 0.000 claims description 84
- 230000008569 process Effects 0.000 claims description 10
- 238000010586 diagram Methods 0.000 description 26
- 238000013507 mapping Methods 0.000 description 22
- 238000012545 processing Methods 0.000 description 14
- 230000006870 function Effects 0.000 description 12
- 230000011664 signaling Effects 0.000 description 10
- 230000001413 cellular effect Effects 0.000 description 5
- 238000004590 computer program Methods 0.000 description 4
- 238000007726 management method Methods 0.000 description 4
- 230000006399 behavior Effects 0.000 description 3
- 230000006835 compression Effects 0.000 description 3
- 238000007906 compression Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 230000011218 segmentation Effects 0.000 description 3
- 101100533725 Mus musculus Smr3a gene Proteins 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 230000006837 decompression Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000007274 generation of a signal involved in cell-cell signaling Effects 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 230000010363 phase shift Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000008054 signal transmission Effects 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 102220488785 ADP-ribosylation factor 1_N52A_mutation Human genes 0.000 description 1
- 230000027311 M phase Effects 0.000 description 1
- 101100274486 Mus musculus Cited2 gene Proteins 0.000 description 1
- 101150096622 Smr2 gene Proteins 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000010267 cellular communication Effects 0.000 description 1
- 239000003795 chemical substances by application Substances 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013523 data management Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- GVVPGTZRZFNKDS-JXMROGBWSA-N geranyl diphosphate Chemical compound CC(C)=CCC\C(C)=C\CO[P@](O)(=O)OP(O)(O)=O GVVPGTZRZFNKDS-JXMROGBWSA-N 0.000 description 1
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical group [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000000153 supplemental effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W76/00—Connection management
- H04W76/20—Manipulation of established connections
- H04W76/27—Transitions between radio resource control [RRC] states
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A method and apparatus used in wireless communications is disclosed. A first node receiving a first message from an air interface; triggering a first random access procedure in response to receiving the first message as the action; sending a second message, the second message belonging to the first random access procedure; wherein whether the first message satisfies a first set of conditions is used to determine a target set of random access resources; when the first message does not satisfy any of the conditions in the first set of conditions, the target set of random access resources includes only one candidate subset of random access resources; when the first message satisfies all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets, wherein Q is a positive integer greater than 1; the one subset of candidate random access resources is reserved for the second message. The method and the device can improve the success rate of sending the small data and reduce the transmission delay.
Description
Technical Field
The present application relates to a method and apparatus in a wireless communication system, and more particularly, to a method and apparatus for transmitting a large amount of small data bursts using a random access procedure in wireless communication.
Background
Random Access (RA) is a common method in cellular communication, and uplink synchronization and uplink transmission resources can be obtained through a 4-step Random Access process. In order to be able to adapt to various application scenarios and meet different requirements, a Study Item (SI) of Non-orthogonal Multiple Access (NoMA) under a New air interface technology (NR, New Radio) is also passed through #76 omnisessions of 3GPP (3rd Generation Partner Project) RAN (Radio Access Network), the study item starts at Release 16, and after the SI ends, a Work Item (WI) is started to standardize the related technology. As a bearing NoMA research project, the 3GPP RAN #82 also passed WI of 2-step random access (2-step RACH) under NR over the second whole meeting.
NR supports RRC (Radio Resource Control) Inactive (RRC _ Inactive) state, and a terminal Equipment (UE) with sparse (sparse) data transmission requirements (including periodic and aperiodic) is typically configured by the network to stay in the RRC Inactive state when there is no data transmission. When the UE has a data transmission requirement, the UE enters an RRC connection (RRC _ Connected) state from the RRC inactive state to perform data transmission, and enters the RRC inactive state again after the data transmission is finished. Until Rel-16, 3GPP does not support data transmission in RRC inactive state, and for small data transmission, the signaling overhead for RRC state transition is greater than the transmission overhead for small data, and at the same time, the power consumption overhead of UE is also increased. Therefore, it was decided to initiate WI standardization work for small data transmission in RRC inactive state over 3GPP RAN #88e global meeting.
Disclosure of Invention
The inventor finds out through research that the UE can send small data through a competitive random access process in an RRC inactive state, aiming at the transmission requirements of a large amount of burst small data of some special services, if random access resources used for sending the small data are pre-configured by a system, the random access resources configured by the system are seriously insufficient, and a large amount of random access pilot frequency collision is caused to cause the sending delay of the small data to be overlong, so that the service performance is reduced; on the other hand, if the random access resource configuration for small data transmission is large enough, the radio resource utilization may be reduced due to traffic unpredictability. How to support burst large amount of small data transmission while effectively utilizing radio resources needs to be studied.
In view of the above problems, the present application discloses a solution for supporting transmission of small data through a contention random access procedure in an RRC inactive state. When a large amount of burst small data needs to be transmitted, compared with the traditional method in which a next random access resource is selected for transmission, the user equipment selects a random access resource from a group of candidate random access resources in the delay budget for transmission, so as to reduce the number of users competing for the same random access resource. The method and the device can effectively reduce the random access pilot frequency collision probability, improve the success rate of the random access process, and further improve the success rate of sending small data.
Further, although the present application was originally directed to the Uu air interface, the present application can also be used for the PC5 interface. The embodiments and features of the embodiments of the present application may be combined with each other arbitrarily without conflict. Further, although the original purpose of the present application is to the terminal and base station scenario, the present application is also applicable to the V2X (Vehicle-to-electrical networking) scenario, the communication scenario between the terminal and the relay, and the communication scenario between the relay and the base station, and achieves similar technical effects in the terminal and base station scenario. Furthermore, adopting a unified solution for different scenarios (including but not limited to V2X scenario and terminal to base station communication scenario) also helps to reduce hardware complexity and cost.
In particular, the terms (Terminology), noun, function, variable in the present application may be explained (if not specifically stated) with reference to the definitions in the specification protocols TS36 series, TS38 series, TS37 series of 3 GPP.
The application discloses a method in a first node used for wireless communication, characterized by comprising:
receiving a first message from an air interface;
triggering a first random access procedure in response to receiving the first message as the action;
sending a second message, the second message belonging to the first random access procedure;
wherein whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
As an embodiment, the present application is applicable to small data transmission based on a random access procedure.
As an embodiment, the present application is applicable to large burst small data transmission based on a random access procedure.
As an embodiment, the performance of the PDCCH order (PDCCH order) triggered random access procedure except for small data transmission is not affected by the present application.
As an embodiment, the problem to be solved by the present application is: aiming at the scene of sending a large amount of small data in burst of some special services, the random access resources pre-configured by the system are seriously insufficient, and a large amount of random access collisions are caused to cause overlong small data sending delay, so that the service performance is reduced.
As an embodiment, the solution of the present application comprises: when a large amount of burst small data needs to be transmitted, the user equipment selects one random access resource from a group of candidate random access resources in the delay budget to transmit so as to reduce the number of users competing for the same random access resource.
As an embodiment, the beneficial effects of the present application include: the beneficial effects of low signaling overhead and low power consumption of small data transmission in the RRC inactive state through the random access process are obtained; meanwhile, the random access pilot frequency collision probability can be effectively reduced aiming at the requirement of sudden large amount of small data transmission, the success rate of the random access process is improved, the success rate of sending small data is further improved, and the time delay of small data transmission is reduced.
According to one aspect of the application, comprising:
the first set of conditions includes a transmission type being non-unicast.
According to one aspect of the application, comprising:
the first set of conditions comprises sending over a first bearer;
wherein the first message comprises a first set of bits.
According to one aspect of the application, comprising:
receiving a third message, the third message comprising a first set of delays;
wherein the first set of delays is used to determine the Q subsets of candidate random access resources.
According to one aspect of the application, comprising:
the first set of delays comprises only first delays; the time interval between the time domain starting time of the last candidate random access resource subset of the Q candidate random access resource subsets and the receiving time of the first message is less than the first delay.
According to one aspect of the application, comprising:
the first set of delays comprises Q delays; the Q candidate random access resource subsets are first candidate random access resource subsets after the Q delays at the receiving time of the first message, respectively.
According to one aspect of the application, comprising:
the second message comprises at least the former of a random access pilot and a second signal;
at least a portion of the bits in the second set of bits are used to generate the second signal.
The present application discloses a first node for wireless communication, comprising:
a first receiver to receive a first message from an air interface;
a first transmitter, responsive to the behavior receiving a first message, for triggering a first random access procedure; sending a second message, the second message belonging to the first random access procedure;
wherein whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
The application discloses a method in a second node used for wireless communication, characterized by comprising:
sending a first message to an air interface;
receiving a second message, wherein the second message belongs to a first random access process;
wherein the first message is used to trigger the first random access procedure; whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving time of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
According to one aspect of the application, comprising:
the first set of conditions includes a transmission type being non-unicast.
According to one aspect of the application, comprising:
the first set of conditions comprises sending over a first bearer;
wherein the first message comprises a first set of bits.
According to one aspect of the application, comprising:
sending a third message, the third message comprising a first set of delays;
wherein the first set of delays is used to determine the Q subsets of candidate random access resources.
According to one aspect of the application, comprising:
the first set of delays comprises only first delays; and the time interval between the time domain starting time of the last candidate random access resource subset in the Q candidate random access resource subsets and the receiving time of the first message is less than the first delay.
According to one aspect of the application, comprising:
the first set of delays comprises Q delays; the Q candidate random access resource subsets are first candidate random access resource subsets after the Q delays at the receiving time of the first message, respectively.
According to one aspect of the application, comprising:
the second message comprises at least the former of a random access pilot and a second signal;
at least a portion of the bits in the second set of bits are used to generate the second signal.
The present application discloses a second node for wireless communication, comprising:
a second transmitter to transmit the first message to the air interface;
a second receiver receiving a second message, the second message belonging to a first random access procedure;
wherein the first message is used to trigger the first random access procedure; whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 illustrates a transmission flow diagram of a first node according to an embodiment of the application;
FIG. 2 illustrates a schematic diagram of a network architecture according to one embodiment of the present application;
fig. 3 illustrates a schematic diagram of radio protocol architecture of a user plane and a control plane according to an embodiment of the present application;
FIG. 4 illustrates a hardware module diagram of a communication device according to one embodiment of the present application;
FIG. 5 illustrates a wireless signal transmission flow diagram according to an embodiment of the present application;
FIG. 6 illustrates a first message structure diagram according to one embodiment of the present application;
fig. 7 illustrates a schematic diagram of a first message and a set of target random access resources according to an embodiment of the present application;
fig. 8 illustrates a schematic diagram of another first message and a set of target random access resources according to an embodiment of the present application;
FIG. 9 illustrates a second message diagram according to one embodiment of the present application;
figure 10 illustrates a diagram of a candidate random access resource subset according to an embodiment of the present application;
FIG. 11 illustrates a block diagram of a processing device in a first node according to one embodiment of the present application;
fig. 12 illustrates a block diagram of a processing device in a second node according to an embodiment of the present application.
Detailed Description
The technical solutions of the present application will be further described in detail with reference to the accompanying drawings, and it should be noted that the embodiments and features of the embodiments of the present application can be arbitrarily combined with each other without conflict.
Example 1
Embodiment 1 illustrates a transmission flow diagram of a first node according to an embodiment of the present application, as shown in fig. 1.
In embodiment 1, a first node 100 receives a first message from an air interface in step 101; triggering a first random access procedure in response to receiving the first message as the behavior in step S102; sending a second message in step S103, the second message belonging to the first random access procedure; wherein whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
For one embodiment, a first message is received from an air interface.
As an embodiment, the air interface is a Uu interface.
For one embodiment, the air interface is a PC5 interface.
For one embodiment, the air interface includes a cellular link.
As one embodiment, the cellular link includes an Uplink (UL).
For one embodiment, the cellular link includes a Downlink (DL).
As one embodiment, the air interface includes a Sidelink (SL).
As an embodiment, the first message is received in an RRC inactive state.
As an embodiment, the first message is in an RRC idle state when received.
As an embodiment, the first message is received at a protocol layer below the RRC layer.
For one embodiment, the first message is a physical layer control message.
As an embodiment, the first message is a PDCCH order (PDCCH order).
As one embodiment, the first message includes DCI (Downlink Control Information).
As an embodiment, the first message includes a MAC (Medium Access Control) layer message.
As one embodiment, the first message is dynamically configured.
As an embodiment, the first message is configured periodically.
As one embodiment, the first message is event-triggered configured.
As an embodiment, the first message is sporadic (infrequent).
As an embodiment, the first message is a trigger event of the first random access procedure.
As an embodiment, the first random access procedure is performed at a MAC entity of the first node.
As one embodiment, the phrase triggering the first random access procedure includes: emptying the Msg3(Message 3) buffer.
As one embodiment, the phrase triggering the first random access procedure includes: the MSGA (MessageA ) buffer is emptied.
As one embodiment, the phrase triggering the first random access procedure comprises: the value of the variable pilot TRANSMISSION COUNTER (PREAMBLE _ TRANSMISSION _ COUNTER) is set to 1.
As one embodiment, the phrase triggering the first random access procedure includes: the value of the variable pilot POWER ramp COUNTER (PREAMBLE _ POWER _ RAMPING _ COUNTER) is set to 1.
As one embodiment, the phrase triggering the first random access procedure includes: selecting a carrier (carrier) for a random access procedure to perform the first random access procedure if the carrier is explicitly indicated by signaling.
As one embodiment, the phrase triggering the first random access procedure includes: selecting a carrier for performing the first random access procedure according to a Reference Signal Received Power (RSRP) value of a downlink loss Reference (downlink path loss Reference) if the carrier for the random access procedure is not explicitly indicated by signaling and a serving cell of the random access procedure is configured with a secondary (supplemental) uplink.
As a sub-embodiment of the foregoing embodiment, when RSRP of the downlink path loss reference is less than RSRP-threshold SSB-SUL (reference signal received power-SSB (SS/PBCH block, SS/PBCH block) threshold — auxiliary uplink), a SUL (auxiliary uplink) carrier is selected to execute the first random access procedure.
As a sub-embodiment of the foregoing embodiment, when RSRP of the downlink loss reference is not less than RSRP-threshold ssb-SUL, a NUL (normal uplink) carrier is selected to perform the first random access procedure.
As one embodiment, the phrase triggering the first random access procedure comprises: BWP (BandWidth Part) operation (operation) is performed.
As one embodiment, the phrase triggering the first random access procedure includes: setting a random access procedure type of the first random access procedure, the random access procedure type including one of 2-step random access (2-steprA) or 4-step random access (4-steprA).
As a sub-embodiment of the foregoing embodiment, when the first message is the PDCCH order and a ra-preamblelndex (random access-pilot index) field explicitly indicated by the PDCCH order is not 0b000000, the type of the first random access procedure is set to be a 4-step random access procedure.
As one embodiment, the phrase triggering the first random access procedure includes: the random access procedure type of the first random access procedure is set according to the method described in section 5.1 of the protocol 38.321 of the 3GPP standard.
As one embodiment, the phrase triggering the first random access procedure comprises: the variables of the first random access procedure are initialized according to the method described in section 5.1 of protocol 38.321 of the 3GPP standard.
As an embodiment, a second message is sent, the second message belonging to the first random access procedure.
In one embodiment, the second message is sent in an RRC inactive state.
As an embodiment, the second message is in an RRC idle state when sent.
As an embodiment, the second Message is Msg1(Message 1) in the first random access procedure.
As an embodiment, the second Message is MsgA (Message a) in the first random access procedure.
As an embodiment, whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition.
As an embodiment, when the first message does not satisfy any condition in the first set of conditions, the target set of random access resources is a first candidate random access resource subset after a time interval no less than a first threshold from a reception time of the first message.
For one embodiment, the first threshold comprises a processing latency of the first node.
For one embodiment, the first threshold includes at least a latency of the first node to process the first message.
As an embodiment, the first threshold is standard defined (specified).
As an embodiment, the first threshold is fixed.
As an embodiment, the first threshold is variable.
For one embodiment, the first threshold includes 6 subframes.
As an embodiment, the first threshold comprises 8 subframes.
As an embodiment, the duration of the one subframe is 1 ms.
As an embodiment, the first threshold includes at least one of a PUSCH (Physical Uplink Shared Channel) preparation time, a BWP handover time, or an Uplink handover interval (gap) time.
As an embodiment, for FR1 (band 1), the first threshold comprises 0.5 milliseconds (ms); for FR2 (band 2), the first threshold comprises 0.25 ms.
As an example, the first threshold may be determined according to the method described in section 8 of the protocol 38.213 of the 3GPP standard.
As an embodiment, a plurality of subsets of candidate random access resources are included after a time interval not less than the second threshold from the time of reception of the first message.
As an embodiment, when the first message satisfies all conditions in the first set of conditions, the target set of random access resources includes Q candidate random access resource subsets no less than a second threshold away from the receiving time of the first message; and Q is a positive integer greater than 1.
For one embodiment, the second threshold includes the first threshold and a time delay for waiting for the second set of bits to arrive.
As an embodiment, the second threshold is standard defined (specified).
As an embodiment, the second threshold is fixed.
As an embodiment, the second threshold is variable.
For one embodiment, the value of the second threshold is not less than the value of the first threshold.
For one embodiment, the value of the second threshold is greater than the value of the first threshold.
As an embodiment, said one subset of candidate random access resources is reserved for said second message.
As an embodiment, a first subset of candidate random access resources after a time interval not less than the first threshold from the time of reception of the first message is reserved for the second message.
As an embodiment, one of Q candidate random access resource subsets that are not less than the second threshold from the time of reception of the first message is reserved for the second message.
Example 2
Embodiment 2 illustrates a network architecture diagram according to an embodiment of the present application, as shown in fig. 2. Fig. 2 illustrates a diagram of a network architecture 200 of NR 5G, LTE (Long-Term Evolution), and LTE-a (Long-Term Evolution-enhanced) systems. The NR 5G, LTE or LTE-a network architecture 200 may be referred to as a 5GS (5G System)/EPS (Evolved Packet System) 200 or some other suitable terminology. The 5GS/EPS 200 may include one or more UEs (User Equipment) 201, NG-RANs (next generation radio access networks) 202, 5 GCs (5G Core networks )/EPCs (Evolved Packet cores) 210, HSS (Home Subscriber Server)/UDMs (Unified Data Management) 220, and internet services 230. The 5GS/EPS may interconnect with other access networks, but these entities/interfaces are not shown for simplicity. As shown, the 5GS/EPS provides packet switched services, however those skilled in the art will readily appreciate that the various concepts presented throughout this application may be extended to networks providing circuit switched services or other cellular networks. The NG-RAN includes NR node b (gNB)203 and other gnbs 204. The gNB203 provides user and control plane protocol termination towards the UE 201. The gnbs 203 may be connected to other gnbs 204 via Xn interfaces (e.g., backhaul links). The XnAP protocol of the Xn interface is used to transmit control plane messages of the wireless network, and the user plane protocol of the Xn interface is used to transmit user plane data. The gNB203 may also be referred to as a base station, a base transceiver station, a radio base station, a radio transceiver, a transceiver function, a Basic Service Set (BSS), an Extended Service Set (ESS), a TRP (Transmission Reception Point), or some other suitable terminology, and in an NTN (Non Terrestrial/satellite Network) Network, the gNB203 may be a satellite, an aircraft, or a ground base station relayed through a satellite. The gNB203 provides the UE201 with an access point to the 5GC/EPC 210. Examples of the UE201 include a cellular phone, a smart phone, a Session Initiation Protocol (SIP) phone, a laptop, a Personal Digital Assistant (PDA), a satellite radio, a global positioning system, a multimedia device, a video device, a Digital audio player (e.g., MP3 player), a camera, a game console, a drone, an aircraft, a narrowband internet of things device, a machine type communication device, a terrestrial vehicle, an automobile, a vehicular device, a vehicular communication unit, a wearable device, or any other similar functioning device. Those skilled in the art may also refer to UE201 as a mobile station, a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a mobile device, a wireless communication device, a remote device, a mobile subscriber station, an access terminal, a mobile terminal, a wireless terminal, a remote terminal, a handset, a user agent, a mobile client, a client, or some other suitable terminology. The gNB203 is connected to the 5GC/EPC210 through an S1/NG interface. The 5GC/EPC210 includes MME (Mobility Management Entity)/AMF (Authentication Management domain)/SMF (Session Management Function) 211, other MME/AMF/SMF214, S-GW (serving Gateway)/UPF (User Plane Function) 212, and P-GW (Packet data Network Gateway)/UPF 213. The MME/AMF/SMF211 is a control node that handles signaling between the UE201 and the 5GC/EPC 210. In general, the MME/AMF/SMF211 provides bearer and connection management. All user IP (Internet Protocol) packets are transmitted through the S-GW/UPF212, and the S-GW/UPF212 itself is connected to the P-GW/UPF 213. The P-GW provides UE IP address assignment as well as other functions. The P-GW/UPF213 is connected to the internet service 230. The internet service 230 includes an operator-corresponding internet protocol service, and may specifically include an internet, an intranet, an IMS (IP Multimedia Subsystem), and a PS (Packet Switching) streaming service.
As an embodiment, the UE201 corresponds to a first node in the present application.
As an embodiment, the gNB203 corresponds to a second node in the present application.
As an example, the gNB203 is a macro Cell (Marco Cell) base station.
As an embodiment, the gNB203 is a Micro Cell (Micro Cell) base station.
As an embodiment, the gNB203 is a Pico Cell (Pico Cell) base station.
As an embodiment, the gNB203 is a home base station (Femtocell).
As an embodiment, the gNB203 is a base station device supporting a large delay difference.
As an example, the gNB203 is a flight platform device.
As an embodiment, the gNB203 is a satellite device.
As an embodiment, the gNB203 is a base station device supporting a large delay difference.
As an embodiment, the gNB203 is a testing device (e.g., a transceiver simulating a function of a base station part, a signaling tester).
As an embodiment, the radio link from the UE201 to the gNB203 is an uplink, which is used to perform uplink transmission.
As an embodiment, the radio link from the gNB203 to the UE201 is a downlink, which is used to perform downlink transmission.
As an embodiment, the wireless link between the UE201 and the UE241 is a sidelink, which is used to perform sidelink transmissions.
As an embodiment, the UE201 and the gNB203 are connected via a Uu air interface.
For one embodiment, the UE201 and the UE241 are connected through an air interface of PC 5.
Example 3
Embodiment 3 illustrates a schematic diagram of radio protocol architecture of a user plane and a control plane according to an embodiment of the present application, as shown in fig. 3. Fig. 3 is a schematic diagram illustrating an embodiment of radio protocol architecture for the user plane 350 and the control plane 300, fig. 3 showing the radio protocol architecture of the control plane 300 for the UE and the gNB in three layers: layer 1, layer 2 and layer 3. Layer 1(L1 layer) is the lowest layer and implements various PHY (physical layer) signal processing functions. The L1 layer will be referred to herein as PHY 301. Layer 2(L2 layer) 305 is above PHY301, and is responsible for the link between the UE and the gNB through PHY 301. The L2 layer 305 includes a MAC (Medium Access Control) sublayer 302, an RLC (Radio Link Control) sublayer 303, and a PDCP (Packet Data Convergence Protocol) sublayer 304, which terminate at the gbb on the network side. The PDCP sublayer 304 provides data ciphering and integrity protection, and the PDCP sublayer 304 also provides handover support for UEs between the gnbs. The RLC sublayer 303 provides segmentation and reassembly of packets, retransmission of missing packets by ARQ, and the RLC sublayer 303 also provides duplicate packet detection and protocol error detection. The MAC sublayer 302 provides mapping between logical and transport channels and multiplexing of logical channel identities. The MAC sublayer 302 is also responsible for allocating various radio resources (e.g., resource blocks) in one cell among the UEs. The MAC sublayer 302 is also responsible for HARQ (Hybrid Automatic Repeat Request) operations. The RRC (Radio Resource Control) sublayer 306 in layer 3(L3 layer) in the Control plane 300 is responsible for obtaining Radio resources (i.e., Radio bearers) and configuring the lower layers using RRC signaling between the gNB and the UE. The radio protocol architecture of the user plane 350 includes layer 1(L1 layer) and layer 2(L2 layer), the radio protocol architecture in the user plane 350 is substantially the same for the physical layer 351, the PDCP sublayer 354 in the L2 layer 355, the RLC sublayer 353 in the L2 layer 355, and the MAC sublayer 352 in the L2 layer 355 as the corresponding layers and sublayers in the control plane 300, but the PDCP sublayer 354 also provides header compression for upper layer packets to reduce radio transmission overhead. The L2 layer 355 in the user plane 350 further includes an SDAP (Service Data Adaptation Protocol) sublayer 356, and the SDAP sublayer 356 is responsible for mapping between QoS streams and Data Radio Bearers (DRBs) to support diversity of services. The radio protocol architecture of the UE in the user plane 350 may include part or all of the protocol sublayers of the SDAP sublayer 356, the PDCP sublayer 354, the RLC sublayer 353, and the MAC sublayer 352 at the L2 layer. Although not shown, the UE may also have several upper layers above the L2 layer 355, including a network layer (e.g., IP layer) that terminates at the P-GW on the network side and an application layer that terminates at the other end of the connection (e.g., far end UE, server, etc.).
As an example, the wireless protocol architecture in fig. 3 is applicable to the first node in the present application.
As an example, the wireless protocol architecture in fig. 3 is applicable to the second node in the present application.
As an embodiment, the first message in this application is generated in the RRC 306.
As an embodiment, the first message in this application is generated in the MAC 302.
As an embodiment, the first message in this application is generated in the MAC 352.
As an embodiment, the first message in this application is generated in the PHY 301.
As an embodiment, the first message in this application is generated in the PHY 351.
As an embodiment, the second message in this application is generated in the MAC 302.
As an embodiment, the second message in this application is generated in the MAC 352.
For one embodiment, the second signal is generated in the PHY 301.
As an example, the second signal in this application is generated in the PHY 351.
As an embodiment, the third message in this application is generated in the RRC 306.
As an embodiment, the fourth message in this application is generated in the RRC 306.
As an example, the first set of bits in this application is generated in the MAC 302.
As an embodiment, the first set of bits in this application is generated in the MAC 352.
As an example, the second set of bits in this application is generated in the MAC 302.
As an embodiment, the second set of bits in this application is generated in the MAC 352.
As an embodiment, the second set of bits in this application is generated in the RLC 303.
As an example, the second set of bits in this application is generated at the RLC 353.
As an embodiment, the second set of bits in this application is generated in the PDCP 304.
As an example, the second set of bits in this application is generated in the PDCP 354.
As an embodiment, the RRC sublayer 306 in the L3 layer belongs to a higher layer.
Example 4
Embodiment 4 illustrates a hardware module schematic diagram of a communication device according to an embodiment of the present application, as shown in fig. 4. Fig. 4 is a block diagram of a first communication device 450 and a second communication device 410 communicating with each other in an access network.
The first communications device 450 includes a controller/processor 459, a memory 460, a data source 467, a transmit processor 468, a receive processor 456, a multiple antenna transmit processor 457, a multiple antenna receive processor 458, a transmitter/receiver 454, and an antenna 452.
The second communication device 410 includes a controller/processor 475, a memory 476, a data source 477, a receive processor 470, a transmit processor 416, a multiple antenna receive processor 472, a multiple antenna transmit processor 471, a transmitter/receiver 418, and an antenna 420.
In transmission from the second communication device 410 to the first communication device 450, at the second communication device 410, an upper layer data packet from a core network or an upper layer data packet from a data source 477 is provided to the controller/processor 475. The core network and data source 477 represents all protocol layers above the L2 layer. The controller/processor 475 implements the functionality of layer L2. In transmissions from the second communications device 410 to the first communications device 450, the controller/processor 475 provides for header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and radio resource allocation to the first communications device 450 based on various priority metrics. The controller/processor 475 is also responsible for retransmission of lost packets, and signaling to the first communication device 450. The transmit processor 416 and the multi-antenna transmit processor 471 implement various signal processing functions for the L1 layer (i.e., the physical layer). The transmit processor 416 implements coding and interleaving to facilitate Forward Error Correction (FEC) at the second communication device 410, as well as mapping of signal constellation based on various modulation schemes (e.g., Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK), M-phase shift keying (M-PSK), M-quadrature amplitude modulation (M-QAM)). The multi-antenna transmit processor 471 performs digital spatial precoding, including codebook-based precoding and non-codebook based precoding, and beamforming processing on the coded and modulated symbols to generate one or more spatial streams. Transmit processor 416 then maps each spatial stream to subcarriers, multiplexes with reference signals (e.g., pilots) in the time and/or frequency domain, and then uses an Inverse Fast Fourier Transform (IFFT) to generate the physical channels carrying the time-domain multicarrier symbol streams. The multi-antenna transmit processor 471 then performs transmit analog precoding/beamforming operations on the time domain multi-carrier symbol stream. Each transmitter 418 converts the baseband multi-carrier symbol stream provided by the multi-antenna transmit processor 471 into a radio frequency stream that is then provided to a different antenna 420.
In a transmission from the second communications apparatus 410 to the first communications apparatus 450, each receiver 454 receives a signal through its respective antenna 452 at the first communications apparatus 450. Each receiver 454 recovers information modulated onto a radio frequency carrier and converts the radio frequency stream into a baseband multi-carrier symbol stream provided to a receive processor 456. Receive processor 456 and multi-antenna receive processor 458 implement the various signal processing functions of the L1 layer. A multi-antenna receive processor 458 performs receive analog precoding/beamforming operations on the baseband multi-carrier symbol stream from the receiver 454. Receive processor 456 converts the baseband multicarrier symbol stream after the receive analog precoding/beamforming operation from the time domain to the frequency domain using a Fast Fourier Transform (FFT). In the frequency domain, the physical layer data signals and the reference signals to be used for channel estimation are demultiplexed by the receive processor 456, and the data signals are subjected to multi-antenna detection in the multi-antenna receive processor 458 to recover any spatial streams destined for the first communication device 450. The symbols on each spatial stream are demodulated and recovered at a receive processor 456 and soft decisions are generated. The receive processor 456 then decodes and deinterleaves the soft decisions to recover the upper layer data and control signals transmitted by the second communications device 410 on the physical channel. The upper layer data and control signals are then provided to a controller/processor 459. The controller/processor 459 implements the functionality of the L2 layer. The controller/processor 459 may be associated with a memory 460 that stores program codes and data. Memory 460 may be referred to as a computer-readable medium. In transmissions from the second communications device 410 to the first communications device 450, the controller/processor 459 provides multiplexing between transport and logical channels, packet reassembly, deciphering, header decompression, control signal processing to recover higher layer packets from the second communications device 410. The upper layer packet is then provided to all protocol layers above the L2 layer. Various control signals may also be provided to L3 for L3 processing.
In a transmission from the first communications device 450 to the second communications device 410, an upper layer data packet is provided at the first communications device 450 to a controller/processor 459 using a data source 467. Data source 467 represents all protocol layers above the L2 layer. Similar to the send function at the second communications apparatus 410 described in the transmission from the second communications apparatus 410 to the first communications apparatus 450, the controller/processor 459 implements header compression, encryption, packet segmentation and reordering, and multiplexing between logical and transport channels, implementing L2 layer functions for the user plane and control plane. The controller/processor 459 is also responsible for retransmission of lost packets and signaling to said second communications device 410. A transmit processor 468 performs modulation mapping, channel coding, and digital multi-antenna spatial precoding by a multi-antenna transmit processor 457 including codebook-based precoding and non-codebook based precoding, and beamforming, and the transmit processor 468 then modulates the resulting spatial streams into multi-carrier/single-carrier symbol streams, which are provided to different antennas 452 via a transmitter 454 after analog precoding/beamforming in the multi-antenna transmit processor 457. Each transmitter 454 first converts the baseband symbol stream provided by the multi-antenna transmit processor 457 into a radio frequency symbol stream and provides the radio frequency symbol stream to the antenna 452.
In a transmission from the first communication device 450 to the second communication device 410, the functionality at the second communication device 410 is similar to the receiving functionality at the first communication device 450 described in the transmission from the second communication device 410 to the first communication device 450. Each receiver 418 receives an rf signal through its respective antenna 420, converts the received rf signal to a baseband signal, and provides the baseband signal to a multi-antenna receive processor 472 and a receive processor 470. The receive processor 470 and the multiple antenna receive processor 472 collectively implement the functionality of the L1 layer. Controller/processor 475 implements the L2 layer functions. The controller/processor 475 can be associated with a memory 476 that stores program codes and data. Memory 476 may be referred to as a computer-readable medium. In transmission from the first communication device 450 to the second communication device 410, the controller/processor 475 provides demultiplexing between transport and logical channels, packet reassembly, deciphering, header decompression, control signal processing to recover upper layer packets from the first communication device 450. Upper layer packets from the controller/processor 475 may be provided to the core network or all protocol layers above the L2 layer and various control signals may also be provided to the core network or L3 for L3 processing.
As an embodiment, the first communication device 450 apparatus includes: at least one processor and at least one memory including computer program code; the at least one memory and the computer program code configured to, for use with the at least one processor, the first communication device 450 apparatus at least: receiving a first message from an air interface; triggering a first random access procedure in response to receiving the first message as the action; sending a second message, the second message belonging to the first random access procedure; wherein whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
As an embodiment, the first communication device 450 apparatus includes: a memory storing a program of computer readable instructions that when executed by at least one processor result in actions comprising: receiving a first message from an air interface; triggering a first random access procedure in response to receiving the first message as the action; sending a second message, the second message belonging to the first random access procedure; wherein whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold after the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
As an embodiment, the second communication device 410 apparatus includes: at least one processor and at least one memory including computer program code; the at least one memory and the computer program code are configured for use with the at least one processor. The second communication device 410 means at least: sending a first message to an air interface; receiving a second message, wherein the second message belongs to a first random access process; wherein the first message is used to trigger the first random access procedure; whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
As an embodiment, the second communication device 410 apparatus includes: a memory storing a program of computer readable instructions that when executed by at least one processor result in actions comprising: sending a first message to an air interface; receiving a second message, wherein the second message belongs to a first random access process; wherein the first message is used to trigger the first random access procedure; whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving time of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
As an embodiment, the first communication device 450 corresponds to a first node in the present application, and the second communication device 410 corresponds to a second node in the present application.
For one embodiment, the first communication device 450 is a UE.
As an example, the first communication device 450 is a RSU (Road Side Unit).
For one embodiment, the first communication device 410 is a relay node.
For one embodiment, the second communication device 410 is a base station.
For one embodiment, at least one of the antenna 452, the receiver 454, the multi-antenna receive processor 458, the receive processor 456, or the controller/processor 459 is configured to receive a first message in accordance with the present application.
For one embodiment, at least one of the antenna 420, the transmitter 418, the multi-antenna transmit processor 471, the transmit processor 416 or the controller/processor 475 is configured to send the first message.
For one embodiment, at least one of the antenna 452, the transmitter 454, the multi-antenna transmit processor 457, the transmit processor 468, or the controller/processor 459 is configured to transmit a second message as described herein.
For one embodiment, at least one of the antenna 420, the receiver 418, the multi-antenna receive processor 472, the receive processor 470 or the controller/processor 475 is configured to receive the second message.
For one embodiment, at least one of the antenna 452, the receiver 454, the multi-antenna receive processor 458, the receive processor 456 or the controller/processor 459 is configured to receive the third message in this application.
For one embodiment, at least one of the antenna 420, the transmitter 418, the multi-antenna transmit processor 471, the transmit processor 416 or the controller/processor 475 is configured to send the third message.
For one embodiment, at least one of the antenna 452, the receiver 454, the multi-antenna receive processor 458, the receive processor 456, or the controller/processor 459 is configured to receive a fourth message in accordance with the present disclosure.
For one embodiment, at least one of the antenna 420, the transmitter 418, the multi-antenna transmit processor 471, the transmit processor 416 or the controller/processor 475 is configured to send the fourth message.
Example 5
Embodiment 5 illustrates a wireless signal transmission flow diagram according to an embodiment of the present application, as shown in fig. 5. In FIG. 5, a first node U51 and a second node N52 communicate over a Uu air interface.
For theFirst node U51Receiving a third message in step S511; receiving a first message in step S512; triggering a first random access procedure in step S513; a second message is sent in step S514.
For theSecond node N52A third message is transmitted in step S521; transmitting a first message in step S522; the second message is received in step S523.
In embodiment 5, a first message is received from an air interface; triggering a first random access procedure in response to receiving the first message as the action; sending a second message, the second message belonging to the first random access procedure; wherein whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message; the first set of conditions includes that a transmission type is non-unicast; the first set of conditions comprises sending over a first bearer; wherein the first message comprises a first set of bits; receiving a third message, the third message comprising a first set of delays; wherein the first set of delays is used to determine the Q subsets of candidate random access resources; the first set of delays comprises only first delays; the time interval between the time domain starting time of the last candidate random access resource subset of the Q candidate random access resource subsets and the receiving time of the first message is less than the first delay; the first set of delays comprises Q delays; the Q candidate random access resource subsets are first candidate random access resource subsets after the Q delays at the receiving moment of the first message respectively; the second message includes at least the former of a random access pilot and a second signal; at least a portion of the bits in the second set of bits are used to generate the second signal.
As an embodiment, the second node is a serving base station of the first node.
For one embodiment, the first node is within a coverage area of the second node.
As an embodiment, the first node is in a serving cell (serving cell) of the second node.
For one embodiment, the first set of conditions includes a transmission type being non-unicast (non-unicast).
As an embodiment, the first set of conditions only includes that the transmission type is non-unicast (non-unicast).
As one embodiment, the non-unicast includes broadcast (broadcast).
For one embodiment, the non-unicast includes multicast (groupcast).
As one embodiment, the non-unicast includes multicast (multicast).
As one embodiment, the phrase that the first message does not satisfy any of the first set of conditions includes: the first set of conditions includes that a transmission type is non-unicast; the sending type of the first message is unicast.
As an embodiment, the phrase transmission type being non-unicast includes: and sending through the first identifier.
For one embodiment, the phrase that the first message does not satisfy any of the first set of conditions comprises: the first set of conditions comprises sending via a first identity; the first message is associated to a second identity; the second identifier is an identifier other than the first identifier.
As an embodiment, the second identity is used to uniquely indicate the first node.
As an embodiment, the second identity is a unicast identity.
As an embodiment, the second identity is unique within the coverage of the second node.
As one embodiment, the phrase that the first message satisfies all conditions in the first set of conditions includes: the first set of conditions includes only that the transmission type is non-unicast; the sending type of the first message is the non-unicast.
As one embodiment, the phrase that the first message satisfies all conditions in the first set of conditions includes: the first set of conditions includes only transmissions by a first identity; the first message is associated to the first identity.
As one embodiment, the first identification is used to indicate a first set of nodes, the first set of nodes including at least one node, the first set of nodes including the first node.
As an embodiment, any node in the first set of nodes is within the coverage of the second node.
For one embodiment, the first identity is a non-unicast identity.
As one embodiment, the phrase the first message being associated with a first identity comprises: the first identity is used to generate the first message.
As one embodiment, the phrase the first message being associated with a first identity comprises: the first message includes the first identification.
As one embodiment, the phrase the first message being associated with a first identity comprises: the first identity is used to scramble the first message.
As one embodiment, the phrase the first message being associated with a first identity comprises: the first identifier is used to scramble a Cyclic Redundancy Check (CRC) of the first message.
As one embodiment, the phrase the first message being associated with a first identity comprises: the first message occupies a first physical layer channel, and the first identifier is used for generating a DMRS (DeModulation Reference Signal) of the first physical layer channel.
As an embodiment, the association of the first message to the second identifier may be analogized from the association of the first message to the first identifier, and is not described herein again.
As an embodiment, the first identifier is an application identifier (application ID).
As an embodiment, the first identifier is a service identifier (service ID).
As an embodiment, the first identifier is a session identifier (session ID).
As an embodiment, the first identifier is a bearer identifier (bearer ID).
As an example, the first identifier is a Logical Channel Identifier (LCID)
As an embodiment, the first identifier is a logical channel identifier of a non-unicast channel.
As an embodiment, the first identity is a Temporary Mobile Group Identity (TMGI).
As an embodiment, the first identity is an RNTI (Radio Network Temporary identity).
As an embodiment, the first identity is a G-RNTI (Group-RNTI).
As an embodiment, the first identity is a P-RNTI (Paging-RNTI).
As an embodiment, the first identity is an MBMS interest indication (mbmsinterrestindication).
As an embodiment, the second identity is a C-RNTI (Cell-RNTI, Cell radio network temporary identity).
As an example, the second identifier is an IMSI (International Mobile Subscriber Identity).
As an embodiment, the second identifier is a TMSI (Temporary Mobile Subscriber Identity).
As an embodiment, the first identifier is a positive integer.
For one embodiment, the first identifier includes a plurality of bits.
As an embodiment, the first flag comprises 6 bits.
As an embodiment, the first flag comprises 8 bits.
As an embodiment, the first flag comprises 16 bits.
As an embodiment, the first flag comprises 24 bits.
For one embodiment, the first flag includes 48 bits.
For one embodiment, the first set of conditions includes sending over a first bearer.
As an embodiment, the first bearer is an RLC bearer.
As one embodiment, the first Bearer is a Data Radio Bearer (DRB).
As an embodiment, the first Bearer is a Signaling Radio Bearer (SRB).
As an embodiment, the first bearer is an EPS (Evolved Packet switched System) bearer.
As an embodiment, the first bearer is an E-RAB (E-UTRAN radio access network bearer, evolved UMTS (Universal Mobile telecommunications System) terrestrial radio access network radio access bearer).
As an embodiment, the transmitting the phrase over the first bearer comprises: and transmitting through the first logical channel.
As an embodiment, the first bearer is mapped to the first logical channel, the first logical channel being identified by a first logical channel identity (identity).
As one embodiment, the first logical channel indicates that the first bearer belongs to a non-unicast channel.
As an embodiment, the first logical Channel is an MCCT (Multicast Control Channel).
As an embodiment, the first logical Channel is MTCH (Multicast Traffic Channel).
As an embodiment, the first logical Channel is a SC-MTCH (Single-Cell Multicast Traffic Channel).
As an embodiment, the first logical Channel is a BCCH (Broadcast Control Channel).
As an embodiment, the first logical Channel is a BR-BCCH (Bandwidth Reduced Broadcast Control Channel).
For one embodiment, the first logical channel is an sbcch (sidelink Broadcast Control channel).
As an embodiment, the first logical Channel is a PCCH (Paging Control Channel).
As an embodiment, the first logical Channel is a Common Control Channel (CCCH).
As an embodiment, the first message includes a MAC sub PDU (sub PDU), where a MAC SDU (Service Data Unit) included in the MAC sub PDU includes the first bit set, and a MAC sub header (sub header) included in the MAC sub PDU includes the first logical channel identifier.
As one embodiment, one MAC PDU (Protocol Data Unit) includes at least one MAC sub PDU.
As an embodiment, the one MAC sub pdu is composed of one MAC sub header and one MAC SDU.
As an embodiment, the one MAC sub pdu is composed of one MAC sub header.
As an embodiment, the one MAC sub pdu is composed of one MAC sub header and one MAC CE (Control Element).
As an embodiment, the one MAC sub pdu is composed of one MAC sub header and padding.
As one embodiment, the phrase that the first message does not satisfy any of the first set of conditions includes: the first set of conditions comprises sending over a first bearer; the first set of bits comprised by the first message is sent over a second bearer; the second bearer is one other than the first bearer.
For one embodiment, the second bearer is mapped to a second logical channel; the second logical channel is a logical channel other than the first logical channel.
As an embodiment, the second logical channel indicates that the second bearer belongs to a unicast channel.
As an embodiment, the second logical CHannel is a DTCH (Dedicated Traffic CHannel).
As an embodiment, the second logical CHannel is STCH (Sidelink Traffic CHannel).
As an embodiment, the second logical CHannel is a DCCH (Dedicated Control CHannel).
As one embodiment, the phrase that the first message does not satisfy any of the first set of conditions includes: the first set of conditions comprises transmitting over a first logical channel; the first set of bits included in the first message is sent over the second logical channel.
As one embodiment, the phrase that the first message satisfies all conditions in the first set of conditions includes: the first set of conditions includes only transmissions over a first bearer; the first set of bits comprised by the first message is sent over the first bearer.
As one embodiment, the phrase that the first message satisfies all conditions in the first set of conditions includes: the first set of conditions includes only transmissions over the first logical channel; the first set of bits comprised by the first message is sent over the first logical channel.
As one embodiment, the phrase that the first message satisfies all conditions in the first set of conditions includes: the first set of conditions includes only transmissions over the first logical channel; the first message includes the first logical channel identification.
As one embodiment, the first set of conditions includes a transmission type being non-unicast and being transmitted over the first bearer.
As one embodiment, the first set of conditions includes a transmission type being non-unicast and being transmitted over the first logical channel.
As one embodiment, the phrase that the first message satisfies all conditions in the first set of conditions includes: the first condition set comprises that the sending type is non-unicast and is sent through the first bearer; the type of sending of the first message is the non-unicast, and the first set of bits included in the first message is sent over the first bearer.
As one embodiment, the phrase that the first message satisfies all conditions in the first set of conditions includes: the first set of conditions includes a transmission type being non-unicast and transmitted over the first logical channel; the type of transmission of the first message is the non-unicast, and the first set of bits comprised by the first message is transmitted over the first logical channel.
As one embodiment, the phrase that the first message satisfies all conditions in the first set of conditions includes: the first set of conditions includes a transmission type being non-unicast and transmitted over the first logical channel; the sending type of the first message is the non-unicast, and the first message comprises the first logical channel identifier.
As one embodiment, the first set of conditions includes that the transmission type is non-unicast and the first channel state includes an RSRP value not less than a second threshold.
As an embodiment, the first set of conditions includes that the transmission type is non-unicast and is transmitted through the first bearer, and the first channel state includes an RSRP value not less than a second threshold.
As an embodiment, the first channel state is a channel state between the first node and a serving base station of the first node.
For one embodiment, the phrase that the first message does not satisfy any of the first set of conditions comprises: the first condition set comprises that the sending type is non-unicast and the RSRP value included by the first channel state is not less than a second threshold value; the first message comprises a reference signal having an RSRP value less than the second threshold.
As one embodiment, the phrase that the first message satisfies all conditions in the first set of conditions includes: the first condition set comprises that the sending type is non-unicast and the RSRP value included by the first channel state is not less than a second threshold value; the sending type of the first message is the non-unicast, and the RSRP value of the reference signal included in the first message is not less than the second threshold.
As one embodiment, the phrase that the first message satisfies all conditions in the first set of conditions includes: the first condition set comprises that the sending type is non-unicast and is sent through the first bearer, and the RSRP value included by the first channel state is not less than a second threshold value; the sending type of the first message is the non-unicast, the first bit set included in the first message is sent through the first bearer, and the RSRP value of the reference signal included in the first message is not smaller than the second threshold.
As an embodiment, the second threshold is configured by a network.
As an embodiment, the second threshold is pre-configured.
As an embodiment, the reference signal included in the first message is a DMRS reference signal.
As an embodiment, the reference signal included in the first message is a CSI (Channel State Information) reference signal.
For one embodiment, the third message is received from an air interface.
As an embodiment, the third message is an RRC message.
As an embodiment, the third message includes all or part of an IE (Information Element) in an RRC message.
As an embodiment, the third message comprises all or part of a field in an IE in an RRC message.
As an embodiment, the third message includes rrcreeconfiguration (RRC reconfiguration).
As an embodiment, the third message is received from a NAS (Non-access stratum) layer of the first node.
For one embodiment, the third message includes a configuration of the first bearer.
As an embodiment, the third message includes the first logical channel identification; the first logical channel identification indicates the first logical channel; the first logical channel is mapped to the first bearer.
As an embodiment, the third message comprises a configuration of a bearer to which the first set of bits belongs.
For one embodiment, the third message includes a first set of delays; the first set of delays includes at least one delay value.
For one embodiment, the first set of delays is used to determine the Q subsets of candidate random access resources.
For one embodiment, the first set of delays includes only first delays.
As an embodiment, the first delay is used to indicate a maximum delay for uplink feedback for the first set of bits included in the first message.
As an embodiment, the first delay is used to indicate a maximum delay for uplink feedback of the first message.
As an embodiment, the first delay is used to indicate a maximum time interval between a transmission time of the second message and a reception time of the first message.
For one embodiment, the value of the first delay is greater than the value of the second threshold.
As an embodiment, the target random access resource set includes Q candidate random access resource subsets included between a time when the receiving time of the first message passes the second threshold and a time when the receiving time of the first message passes the first delay.
As a sub-embodiment of the foregoing embodiment, the Q candidate random access resource subsets are orthogonal in time domain or orthogonal in frequency domain.
As an embodiment, a time interval between a time domain starting time of a last candidate random access resource subset of the Q candidate random access resource subsets and a receiving time of the first message is less than the first delay and not less than the second threshold.
As an embodiment, the time domain starting time of any candidate random access resource subset of the Q candidate random access resource subsets is between the time when the receiving time of the first message passes the second threshold and the time when the receiving time of the first message passes the first delay.
As an embodiment, the first node randomly selects a subset of candidate random access resources from the Q subsets of candidate random access resources with an equal probability (equivalent probability) to send the second message.
As an embodiment, the delay value is determined according to a time interval between a time domain starting time of a candidate random access resource subset selected from the Q candidate random access resource subsets and a receiving time of the first message.
As a sub-embodiment of the above-mentioned embodiment, the phrase triggering the first random access procedure includes: the value of the variable pilot DELAY (PREAMBLE DELAY) is set to the DELAY value.
As a sub-embodiment of the above embodiment, a first subset of candidate random access resources after the delay value has elapsed from the reception time of the first message is used for transmitting the second message.
For one embodiment, the first set of delays includes Q delays.
For one embodiment, the values of the Q delays comprised by the first set of delays are expressed in milliseconds.
For one embodiment, the values of the Q delays comprised by the first set of delays are expressed in subframes.
For one embodiment, the values of any two of the Q delays included in the first delay set are different.
For one embodiment, the first set of delays includes at least two delays of the Q delays that have different values.
As an embodiment, the phrase that the Q candidate random access resource subsets are first candidate random access resource subsets after the Q delays of the receiving time of the first message respectively includes: one of the Q candidate random access resource subsets is a first candidate random access resource subset after one of the Q delays at the time of receiving the first message.
As an embodiment, the phrase that the Q candidate random access resource subsets are first candidate random access resource subsets after the Q delays of the receiving time of the first message respectively includes: the Q subsets of candidate random access resources are orthogonal in the time domain.
As one embodiment, the Q delays comprise [ T ] 1 ,T 2 ,…,T Q ]Wherein T is 1 <T 2 …<T Q The reception time of the first message passes through the T 1 And the reception time of the first message passes through the T 2 Comprises at least one candidate random access resource subset within the time interval of the time instant of (a); the receiving time of the first message passes through the T 2 And the reception time of the first message passes through the T 3 Comprises at least one candidate random access resource subset within the time interval of the time instant of (a); and so on, the receiving time of the first message passes through the T Q-1 And the reception time of the first message passes through the T Q Comprises at least one candidate random access resource subset within the time interval of the time instants of (a).
For one embodiment, the first node randomly selects a delay from the Q equal probabilities of delays included in the first set of delays; and the first candidate random access resource subset after the time delay of the receiving time of the first message is used for sending the second message.
As a sub-embodiment of the above embodiment, the phrase triggering the first random access procedure includes: the value of the variable pilot DELAY (PREAMBLE DELAY) is set to the value of the DELAY.
As an embodiment, taking an example of randomly selecting one delay from the Q delays with a medium probability, the randomly selecting with the medium probability includes: generating a random number between 0 and 1 in an even distribution, and if the random number is between 0 and 1/Q, selecting a first delay from Q delays; if the random number is between 1/Q and 2/Q, selecting a second delay of the Q delays; and so on; selecting the Q-th delay of the Q delays if the random number is between (Q-1)/Q and 1.
For one embodiment, the phrase said second message comprises at least the former of a random access pilot and a second signal comprising: the second message includes only one random access pilot.
For one embodiment, when the second message includes only one random access pilot, the second signal is Msg1(message 1).
As an embodiment, when the second message includes only one random access pilot, the second signal is Msg3(message 3) of the first random access procedure.
As an embodiment, when the second message includes only one random access pilot, the second signal is scheduled to be sent by Msg2 (message 2) of the first random access procedure.
For one embodiment, the phrase said second message comprises at least the former of a random access pilot and a second signal comprising: the second message comprises a random access pilot and a second signal; the random access pilot is associated with the second signal, and the second signal is a PUSCH.
As an embodiment, when the second message includes a random access pilot and the second signal, the second message is MsgA (message a).
As an embodiment, the transmission of one random access pilot and the second signal comprised by the second message is not separable (i.e. atomic).
For one embodiment, the phrase random access pilot and the second signal association comprises: the random access pilot is used to determine time-frequency resources of the second signal and a DMRS of the second signal.
As an embodiment, the second set of bits belongs to uplink data.
As an embodiment, the amount of data (data volume) of the second set of bits is not greater than a first threshold.
As an embodiment, the amount of data of the second set of bits is smaller than the first threshold.
As an embodiment, the first threshold is used to determine whether the second set of bits may be transmitted through a random access procedure.
As a sub-embodiment of the above embodiment, when the data amount of the second bit set is not greater than the first threshold, the second bit set is sent through MsgA or Msg3 of the random access procedure.
As a sub-embodiment of the above embodiment, the second set of bits is sent when the first node is in an RRC inactive state when the amount of data of the second set of bits is not greater than the first threshold.
As a sub-embodiment of the foregoing embodiment, when the data amount of the second bit set is greater than the first threshold, the second bit set is sent when the first node is in an RRC connected state.
As an embodiment, the first threshold is configured by a network.
As one embodiment, the first threshold is pre-configured.
As an embodiment, the first threshold is a fixed value.
As an embodiment, the first threshold is standard defined (specified).
As one embodiment, the first threshold is expressed in bytes.
For one embodiment, the second set of bits includes at least one bit.
For one embodiment, the second set of bits includes all currently buffered bits.
As an embodiment, the second set of bits includes all bits currently buffered at the MAC sublayer.
As an embodiment, the second set of bits includes all bits currently buffered in the MAC sublayer and the RLC sublayer.
As an embodiment, the second set of bits includes all bits currently buffered in the MAC sublayer, the RLC sublayer and the PDCP sublayer.
As an embodiment, the data amount of the second bit set includes a value obtained by dividing the number of bits of all bits included in the second bit set by 8.
As an embodiment, the amount of data of the second set of bits is expressed in bytes.
As an embodiment, at least a part of the bits of the second set of bits is used for generating the second signal.
As an embodiment, at least a part of the bits of the second set of bits constitutes a second group of bits.
As an embodiment, all bits comprised by said second set of bits belong to said second group of bits.
As an embodiment, the second set of bits comprises at least one bit not belonging to the second group of bits.
As an embodiment, the second group of bits is used to generate the second signal.
As an embodiment, any bit included in the second bit group belongs to the same MAC SDU.
As an embodiment, all or a part of bits included in the second bit group sequentially undergo CRC Calculation (CRC Calculation), Channel Coding (Channel Coding), Rate matching (Rate matching), Scrambling (Scrambling), Modulation (Modulation), Layer Mapping (Layer Mapping), Antenna Port Mapping (Antenna Port Mapping), Mapping to Virtual Resource Blocks (Mapping to Virtual Resource Blocks), Mapping from Virtual Resource Blocks to Physical Resource Blocks (Mapping to Physical Resource Blocks), OFDM Baseband Signal Generation (OFDM Baseband and Signal Generation), and Modulation and frequency conversion (Modulation and Up conversion) to obtain the second Signal.
As an embodiment, the second set of bits is sent over the first bearer.
As an embodiment, the first set of bits and the second set of bits belong to the same data radio bearer.
For one embodiment, the second signal includes a MAC sub pdu; the MAC SDU included in the MAC sub PDU includes the second bit group; the MAC subheader included in the MAC subPDU includes the first logical channel identifier.
Example 6
Embodiment 6 illustrates a first message structure diagram according to an embodiment of the present application, as shown in fig. 6.
As an embodiment, the first message comprises only a control message part; the control message part is DCI.
As one embodiment, the first message includes a control message portion and a data message portion; the control message part is DCI; the control message part comprises a configuration message of the data message part; the configuration message includes at least one of time-frequency resources or a modem mode.
As one embodiment, the phrase the first message being associated with a first identity comprises: the first identity is used to scramble a CRC of the control message portion of the first message.
As one embodiment, the phrase the first message being associated with a first identity comprises: the first identification is used to scramble the control message portion of the first message.
As one embodiment, the phrase the first message being associated with a first identity comprises: the first identification is used to scramble the data message portion of the first message.
As one embodiment, the phrase the first message being associated with a first identity comprises: the first identity is a load (payload) of the first message; the first identity is not used to scramble the first message.
As one embodiment, the phrase the first message being associated to a first identity comprises: the data message part of the first message includes a MAC CE, which includes the first identifier.
As an embodiment, the data message part of the first message belongs to one MAC PDU.
As one embodiment, the data message portion of the first message includes the first set of bits.
As an embodiment, the first message comprises only a control message part; the control message portion is scrambled by the first identity; the first identity is indicative of at least one node; the load of the control message part comprises the first logical channel identification.
As an embodiment, the first message comprises a control message part and a data message part; the control message portion is scrambled by the first identity; the first identity is indicative of at least one node; the data message portion includes the first set of bits.
As one embodiment, the first message includes a control message portion and a data message portion; the control message portion is scrambled by the first identity; the first identity is indicative of at least one node; the data message part includes the first logical channel identification.
In case a of embodiment 6, the first message comprises only a control message part, the first message comprising the first identity.
In case B of embodiment 6, the first message includes a control message part and a data message part; the control message part comprises the first identifier and the data message part comprises the first set of bits.
For one embodiment, the first message comprises a paging message.
As an embodiment, the first message and a paging message belong to the same MAC PDU.
Example 7
Embodiment 7 illustrates a schematic diagram of a first message and a target set of random access resources according to an embodiment of the present application, as shown in fig. 7. In fig. 7, a dashed box indicates a target random access resource set, and a rectangle with a forward slash indicates a candidate random access resource subset.
As an embodiment, a plurality of candidate random access resource subsets are included after a time interval no less than the first threshold from the time of reception of the first message; the time frequency resources included by the candidate random access resource subsets are orthogonal in time domain or orthogonal in frequency domain.
As an embodiment, the target set of random access resources only comprises a first subset of candidate random access resources after a time interval not less than the first threshold from the time of reception of the first message.
As an embodiment, there is no candidate random access resource subset between the time of receiving the first message and the time domain starting time of the target random access resource set.
As an embodiment, the receiving time of the first message is an end time of a last time slot of receiving the first message.
As an embodiment, the receiving time of the first message is an end time of receiving a last multicarrier symbol of the first message.
As an embodiment, the receiving time of the first message is a starting time of a last slot for receiving the first message.
As an embodiment, the receiving time of the first message is a starting time of receiving a last multicarrier symbol of the first message.
As an embodiment, the time domain starting time of the target random access resource set is a starting time of a first time domain resource included in the target random access resource set.
As an embodiment, the time domain starting time of the target random access resource set is a starting time of an earliest time domain resource included in the target random access resource set.
As an embodiment, the time domain resource comprises at least one time slot; the starting time of the time domain resource is the starting time of the earliest time slot in the at least one time slot.
As an embodiment, the time domain resource comprises at least one multicarrier symbol; the start time of the time domain resource is the start time of the earliest multi-carrier symbol in the at least one multi-carrier symbol.
As an embodiment, a time interval between a time domain starting time of the target random access resource set and a receiving time of the first message is equal to the first threshold.
As an embodiment, a time interval between a time domain starting time of the target random access resource set and a receiving time of the first message is greater than the first threshold.
In embodiment 7, a time interval between a time domain starting time of the target random access resource set and the receiving time of the first message is greater than the first threshold.
Example 8
Embodiment 8 illustrates a schematic diagram of another first message and a target set of random access resources according to an embodiment of the present application, as shown in fig. 8. In fig. 8, a dashed box indicates a target random access resource set, and a rectangle with a forward slope in the dashed box indicates a candidate random access resource subset.
As an embodiment, the phrase that a time interval from a time domain start time of a last candidate random access resource subset of the Q candidate random access resource subsets to a reception time of the first message is less than the first delay includes: q candidate random access resource subsets are included between the first time and the second time; the first time is the time when the receiving time of the first message passes the time interval of the second threshold; the second time is the time when the receiving time of the first message is after the time interval of the first delay; and Q is a positive integer greater than 1.
As an embodiment, the phrase including Q subsets of candidate random access resources between the first time instant and the second time instant comprises: a time domain starting time of any one of the Q candidate random access resource subsets is between the first time and the second time.
For one embodiment, the phrase including Q subsets of candidate random access resources between the first time instant and the second time instant includes: the last candidate random access resource subset of the Q candidate random access resource subsets comprises at least one multicarrier symbol between the first time instant and the second time instant.
For one embodiment, the phrase including Q subsets of candidate random access resources between the first time instant and the second time instant includes: a first candidate random access resource subset of the Q candidate random access resource subsets comprises a first multicarrier symbol between the first time instant and the second time instant.
For one embodiment, the first set of delays includes Q delays, and a value of a 1 st delay of the Q delays is equal to the value of the second threshold.
For one embodiment, the first set of delays includes Q delays, and a value of a 1 st delay of the Q delays is greater than a value of the second threshold.
In case a of embodiment 8, the first set of delays includes only a first delay, and Q candidate random access resource subsets included in the target set of random access resources are determined according to the first delay and the second threshold.
In case B of embodiment 8, the first delay set includes Q delays, values of the Q delays are different, and Q candidate random access resource subsets included in the target random access resource set are determined according to the Q delays.
Example 9
Embodiment 9 illustrates a second message diagram according to an embodiment of the present application, as shown in fig. 9.
In one embodiment, the random access pilot included in the second message is transmitted before the second signal.
As an embodiment, the second message includes the ending time of the random access pilot no later than the starting time of the second signal.
As an embodiment, the second message includes the start time of the random access pilot no later than the start time of the second signal.
As an embodiment, the second message includes an end time of the random access pilot no later than an end time of the second signal.
As an embodiment, the second message includes an ending time of the random access pilot earlier than a starting time of the second signal.
As an embodiment, the second message includes the random access pilot with a start time earlier than a start time of the second signal.
As an embodiment, the second message includes an end time of the random access pilot earlier than an end time of the second signal.
As an embodiment, the transmission start time of the second signal is after the transmission of the random access pilot included in the second message passes through at least N multicarrier symbols; when the subcarrier interval is 15KHz or 30KHz, the N is 2; when the subcarrier interval is 60KHz or 120KHz, the N is 4; the subcarrier spacing is a subcarrier spacing of an active BWP of the first node.
As a sub-embodiment of the foregoing embodiment, the sending of the random access pilot included in the second message is a sending start time of the random access pilot included in the second message.
As a sub-embodiment of the foregoing embodiment, the transmission of the random access pilot included in the second message is a transmission end time of the random access pilot included in the second message.
In case a of embodiment 9, the second message includes only one random access pilot.
In case B of embodiment 9, the second message comprises a random access pilot and the second signal.
Example 10
Embodiment 10 illustrates a diagram of a candidate random access resource subset according to an embodiment of the present application, as shown in fig. 10. The solid box in fig. 10 represents the set of PRACH occasions that one subset of candidate random access resources includes; a rectangle with a positive slash in a solid line frame represents a PRACH opportunity; a dotted line frame indicates that one PRACH opportunity comprises a plurality of random access pilots; the dashed box represents a PUSCH opportunity set included in one candidate random access resource subset; a rectangle with a reverse slash in a dashed frame represents a PUSCH opportunity; a double-dot line frame shows that one PUSCH opportunity comprises a plurality of PUSCHs; a rectangle with a cross grid line in a dot line frame represents a time frequency resource which is included in the first random access resource and used for sending the random access pilot frequency; the rectangle with the positive grid in the double-dot line frame represents the time-frequency resource for sending the PUSCH included in the first random access resource.
As an embodiment, the second message occupies the first random access resource; the first random access resource is one random access resource of a subset of candidate random access resources comprised in the target set of random access resources.
As an embodiment, the first random access resource only includes time-frequency resources for transmitting random access pilots.
In an embodiment, the first random access resource includes a time-frequency resource for transmitting a random access pilot and an uplink time-frequency resource for transmitting the second signal.
As an embodiment, the target set of random access resources comprises at least one candidate subset of random access resources; the one subset of candidate random access resources comprises at least one random access resource.
In one embodiment, the one random access resource includes at least a time-frequency resource containing one random access pilot.
For one embodiment, the one random access pilot comprises a pseudo-random sequence.
As an embodiment, the one random access pilot comprises a Gold sequence.
For one embodiment, the one random access pilot comprises an M sequence.
As an embodiment, the one random access pilot includes a ZC (Zadoff-chu) sequence.
As an embodiment, one candidate Random Access resource subset includes one set of PRACH (Physical Random Access CHannel) occasions (occasion); the one set of PRACH opportunities includes at least one PRACH opportunity.
As an embodiment, one candidate random access resource subset comprises at least two PRACH occasions; and the time frequency resources included by any two PRACH occasions in the at least two PRACH occasions are orthogonal in time domain or orthogonal in frequency domain.
As an embodiment, the first node determines PRACH occasions included in a candidate random access resource subset according to an SSB (ss (synchronization signals)/pbch (physical Broadcast channel) Block synchronization signal/physical Broadcast channel Block) index.
As one embodiment, the SSB index is associated to a PRACH occasion.
As an embodiment, the phrase that the SSB index is associated to a PRACH occasion includes: an SSB index is mapped to consecutive PRACH occasions, including in frequency multiplexed PRACH occasions according to an increasing frequency resource index mapping; then mapping according to the incremental time resource index in the PRACH time slot with time multiplexing; and then according to the incremental PRACH slot mapping.
As an embodiment, one subset of candidate random access resources comprises one set of PRACH occasions and one set of PUSCH occasions (PUSCH occasions); the one set of PRACH opportunities comprises at least one PRACH opportunity; the one set of PUSCH occasions includes at least one PUSCH occasion.
As an embodiment, the one PRACH opportunity includes one time-frequency resource block.
As one embodiment, the one PRACH opportunity is used for transmitting a set of random access pilots.
As an embodiment, the one PUSCH occasion includes one time-frequency resource block.
As an embodiment, the one PUSCH occasion is used for transmitting a set of PUSCHs; the set of PUSCHs is distinguished by a DMRS sequence.
As an embodiment, the time-frequency resource blocks included in the PRACH opportunity and the time-frequency resource blocks included in the PUSCH opportunity are not overlapped (overlapping).
In an embodiment, the time-frequency resource blocks included in the PRACH occasion and the time-frequency resource blocks included in the PUSCH occasion are orthogonal in a time domain.
As an embodiment, the one PUSCH occasion includes at least one DMRS.
As an embodiment, the one PUSCH occasion and the one DMRS comprised by the PUSCH occasion uniquely determine the one PUSCH comprised by the one PUSCH occasion.
As an embodiment, the one time-frequency resource block includes at least one subcarrier.
As an embodiment, the one time-frequency Resource Block includes at least one PRB (Physical Resource Block), and the one PRB includes 12 subcarriers.
As an embodiment, the one time-frequency resource block comprises at least one multicarrier symbol.
In one embodiment, the one time-frequency resource block includes at least one slot.
In one embodiment, the one time-frequency resource block includes at least one subframe.
As an embodiment, the duration of the one subframe is 1 millisecond (ms).
As an embodiment, the duration of the one slot is determined by a Subcarrier Spacing (Subcarrier Spacing) of the frequency domain resource.
As an embodiment, the number M of slots included in the subframe is determined by a subcarrier spacing of the frequency domain resource, i.e. M is 2 μ Wherein the subcarrier spacing of the frequency domain resource is 2 μ X 15 KHz; mu is 0, 1, 2, 3, 4, 5; when the subcarrier interval of the frequency domain resource is 15KHz, the subframe comprises 1 time slot, and the time length of each time slot is 1 ms; when the subcarrier interval of the frequency domain resource is 30KHz, the subframe comprises 2 time slots, and the time length of each time slot is 0.5 ms; and so on, and will not be described in detail.
As one embodiment, the subcarrier spacing is 1.25 KHz.
As one embodiment, the subcarrier spacing is 5 KHz.
As one embodiment, the subcarrier spacing is 15 KHz.
As one embodiment, the subcarrier spacing is 30 KHz.
As one embodiment, the subcarrier spacing is 60 KHz.
For one embodiment, the subcarrier spacing is 120 KHz.
In case a of embodiment 10, the one subset of candidate random access resources includes only a set of PRACH occasions, where the set of PRACH occasions includes three PRACH occasions, and each PRACH occasion includes multiple random access pilots; wherein a rectangle with a cross-hatched line in the dotted line frame represents the first random access resource.
In case B of embodiment 10, the one candidate random access resource subset includes a set of PRACH occasions and a set of PUSCH occasions, where the set of PRACH occasions includes three PRACH occasions, and each PRACH occasion includes multiple random access pilots; the set of PUSCH occasions comprises 2 PUSCH occasions, each PUSCH occasion comprising a plurality of PUSCHs; wherein a rectangle with an oblique lattice line in the dotted line frame and a rectangle with a positive lattice in the double-dotted line frame collectively represent the first random access resource.
As an embodiment, any random access pilot comprised in one subset of candidate random access resources is associated to one PUSCH in said one subset of candidate random access resources.
As an embodiment, any random access pilot comprised in one subset of candidate random access resources is associated to a DMRS of one PUSCH in said one subset of candidate random access resources.
As an embodiment, any random access pilot included in one subset of candidate random access resources is not separable (i.e., atomic) from the transmission of the associated PUSCH.
As an embodiment, the phrase that any random access pilot included in one candidate random access resource subset is associated to one PUSCH in the one candidate random access resource subset comprises: consecutive N of one valid PRACH occasion included in the one subset of candidate random access resources preamble The pilot indexes are sequentially mapped to one PUSCH in an SSB-RO (RACH occupancy, random access Occasion) mapping period (mapping cycle).
As an embodiment, the phrase that any random access pilot included in one candidate random access resource subset is associated to one PUSCH in the one candidate random access resource subset comprises: consecutive N of one valid PRACH occasion included in the one subset of candidate random access resources preamble The individual pilot indexes are sequentially mapped to one PUSCH.
As an example, the consecutive N preamble The selection method of the pilot frequency index comprises the following steps: the method comprises the steps of firstly selecting according to the increasing random access pilot index in one PRACH occasion, then selecting according to the increasing frequency resource index in a plurality of PRACH occasions of frequency multiplexing, and thirdly selecting according to the increasing time resource index in a plurality of PRACH occasions of time multiplexing.
As an embodiment, the mapping of the phrase to one PUSCH includes: mapping according to the incremental frequency resource index on a plurality of frequency multiplexing PUSCH occasions, then mapping according to the incremental DMRS resource index in one PUSCH occasion, mapping according to the incremental time resource index on a plurality of time multiplexing PUSCH occasions, and mapping according to the incremental time slot index on a PUSCH occasion with a plurality of PUSCH occasion slots; wherein the DMRS resource index is first determined by an incremented DMRS port (port) index, and then the DMRS resource index is determined by an incremented DMRS sequence (sequence) index.
As an embodiment, the phrase that any random access pilot included in one candidate random access resource subset is associated to one PUSCH in the one candidate random access resource subset comprises: any random access pilot included in the one subset of candidate random access resources is mapped to one PUSCH in the one subset of candidate random access resources according to the method described in section 8 of the 38.213 protocol of the 3GPP standard.
As an example, the N preamble =ceil(T preamble /T PUSCH ) Wherein said T is preamble Multiplying the number of PRACH occasions included in the candidate random access resource subset by the product of the number of effective random access pilot frequencies included in each PRACH occasion; t is PUSCH And multiplying the product of the number of PUSCH occasions included by the one candidate random access resource subset and the index number of the DMRS resource included by each PUSCH occasion.
As an embodiment, the determining of the first random access resource includes: the first node determines a PRACH occasion included in a candidate random access resource subset according to SSB indexes, randomly selects a random access pilot frequency according to a group of random access pilot frequencies included in the PRACH occasion with equal probability, and then determines the time-frequency resource of the PUSCH according to the relation between the random access pilot frequency and the PUSCH.
As an embodiment, the first node receives a fourth set of messages, the fourth set of messages indicating the SSB index, the fourth set of messages including a configuration of parameters in a random access procedure, the parameters including at least a time-frequency-code resource of a PRACH opportunity and a time-frequency resource of a PUSCH opportunity.
As an embodiment, the fourth set of messages comprises a System message SIB (System Information Block).
For one embodiment, the fourth set of messages includes SIB1 (system message block 1).
As an embodiment, the fourth set of messages includes rrcreeconfiguration.
As an embodiment, the first node determines the candidate random access resource subset according to the method described in this embodiment.
As an embodiment, the first node determines the subset of candidate random access resources according to the information comprised in the fourth message and the method described in section 8 of the 38.213 protocol of the 3GPP standard.
As an embodiment, the first node determines the set of random access resources according to the information comprised in the fourth message and a table in section 6.3.3 of the 38.211 protocol of the 3GPP standard.
Example 11
In fig. 11, a first node processing apparatus 1100 includes a first receiver 1101 and a first transmitter 1102. The first receiver 1101 comprises at least one of the transmitter/receiver 454 (including the antenna 452), the receive processor 456, the multiple antenna receive processor 458, or the controller/processor 459 of fig. 4 of the present application; the first transmitter 1102 includes at least one of the transmitter/receiver 454 (including the antenna 452), the transmit processor 468, the multi-antenna transmit processor 457, or the controller/processor 459 of fig. 4 herein.
In embodiment 11, a first receiver 1101 receives a first message from an air interface; a first transmitter 1102, responsive to the behavior receiving a first message, for triggering a first random access procedure; sending a second message, the second message belonging to the first random access procedure; wherein whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
For one embodiment, the first set of conditions includes a transmission type being non-unicast.
For one embodiment, the first set of conditions includes sending over a first bearer; wherein the first message comprises a first set of bits.
For one embodiment, the first receiver 1101 receives a third message, the third message comprising a first set of delays; wherein the first set of delays is used to determine the Q subsets of candidate random access resources.
For one embodiment, the first receiver 1101 receives a third message, the third message comprising a first set of delays; wherein the first set of delays is used to determine the Q subsets of candidate random access resources; the first set of delays comprises only first delays; the time interval between the time domain starting time of the last candidate random access resource subset of the Q candidate random access resource subsets and the receiving time of the first message is less than the first delay.
For one embodiment, the first receiver 1101 receives a third message, the third message comprising a first set of delays; wherein the first set of delays is used to determine the Q subsets of candidate random access resources; the first set of delays comprises Q delays; the Q candidate random access resource subsets are first candidate random access resource subsets after the Q delays at the receiving time of the first message, respectively.
For one embodiment, the second message includes at least the former of a random access pilot and the second signal; at least a portion of the bits in the second set of bits are used to generate the second signal.
Example 12
Embodiment 12 illustrates a block diagram of a processing device in a second node according to an embodiment of the present application, as shown in fig. 12.
In fig. 12, the second node processing apparatus 1200 includes a second receiver 1201 and a second transmitter 1202. Second receiver 1201 includes at least one of transmitter/receiver 418 (including antenna 420), receive processor 470, multi-antenna receive processor 472, or controller/processor 475 of fig. 4 herein; the second transmitter 1202 includes at least one of the transmitter/receiver 418 (including the antenna 420), the transmit processor 416, the multi-antenna transmit processor 471, or the controller/processor 475 of fig. 4 of the present application.
In an embodiment, the second transmitter 1202 sends the first message to the air interface; a second receiver 1201 receiving a second message, the second message belonging to a first random access procedure; wherein the first message is used to trigger the first random access procedure; whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving time of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold after the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
For one embodiment, the first set of conditions includes a transmission type being non-unicast.
As an embodiment, the first set of conditions includes sending over a first bearer; wherein the first message comprises a first set of bits.
For one embodiment, the second transmitter 1202 sends a third message, the third message comprising a first set of delays; wherein the first set of delays is used to determine the Q subsets of candidate random access resources.
For one embodiment, the second transmitter 1202 sends a third message, the third message comprising a first set of delays; wherein the first set of delays is used to determine the Q subsets of candidate random access resources; the first set of delays comprises only first delays; the time interval between the time domain starting time of the last candidate random access resource subset of the Q candidate random access resource subsets and the receiving time of the first message is less than the first delay.
For one embodiment, the second transmitter 1202 sends a third message, the third message comprising a first set of delays; wherein the first set of delays is used to determine the Q subsets of candidate random access resources; the first set of delays comprises Q delays; the Q candidate random access resource subsets are first candidate random access resource subsets after the Q delays at the receiving time of the first message, respectively.
For one embodiment, the second message includes at least the former of a random access pilot and the second signal; at least a portion of the bits in the second set of bits are used to generate the second signal.
It will be understood by those skilled in the art that all or part of the steps of the above methods may be implemented by instructing relevant hardware through a program, and the program may be stored in a computer readable storage medium, such as a read-only memory, a hard disk or an optical disk. Alternatively, all or part of the steps of the above embodiments may be implemented by using one or more integrated circuits. Accordingly, the module units in the foregoing embodiments may be implemented in the form of hardware, or may be implemented in the form of software functional modules, and the present application is not limited to any specific combination of software and hardware. The first Type of Communication node or UE or terminal in the present application includes, but is not limited to, a mobile phone, a tablet computer, a notebook, a network card, a low power consumption device, an eMTC (enhanced Machine Type Communication) device, an NB-IoT device, a vehicle-mounted Communication device, an aircraft, an airplane, an unmanned aerial vehicle, a remote control plane, and other wireless Communication devices. The second type of communication node, base station or network side device in the present application includes, but is not limited to, a macro cell base station, a micro cell base station, a home base station, a relay base station, an eNB, a gNB, a Transmission and Reception node TRP (Transmission and Reception Point), a relay satellite, a satellite base station, an air base station, and other wireless communication devices.
The above description is only a preferred embodiment of the present application, and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (10)
1. A first node configured for wireless communication, comprising:
a first receiver to receive a first message from an air interface;
a first transmitter, responsive to the behavior receiving a first message, for triggering a first random access procedure; sending a second message, the second message belonging to the first random access procedure;
wherein whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
2. The first node of claim 1, wherein the first set of conditions includes a transmission type being non-unicast.
3. The first node of claim 1 or 2, wherein the first set of conditions comprises sending over a first bearer;
wherein the first message comprises a first set of bits.
4. The first node according to any of claims 1 to 3, comprising:
the first receiver receives a third message, wherein the third message comprises a first delay set;
wherein the first set of delays is used to determine the Q subsets of candidate random access resources.
5. The first node of claim 4, wherein the first set of delays comprises only first delays; the time interval between the time domain starting time of the last candidate random access resource subset of the Q candidate random access resource subsets and the receiving time of the first message is less than the first delay.
6. The first node of claim 4, wherein the first set of delays comprises Q delays; the Q candidate random access resource subsets are first candidate random access resource subsets after the Q delays at the receiving time of the first message, respectively.
7. The first node according to any of claims 1 to 6, wherein the second message comprises at least the former of a random access pilot and a second signal;
at least a portion of the bits in the second set of bits are used to generate the second signal.
8. A second node configured for wireless communication, comprising:
a second transmitter to transmit a first message to an air interface;
a second receiver receiving a second message, the second message belonging to a first random access procedure;
wherein the first message is used to trigger the first random access procedure; whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving time of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
9. A method in a first node used for wireless communication, comprising:
receiving a first message from an air interface;
triggering a first random access procedure in response to receiving the first message as the action;
sending a second message, the second message belonging to the first random access procedure;
wherein whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
10. A method in a second node used for wireless communication, comprising:
sending a first message to an air interface;
receiving a second message, wherein the second message belongs to a first random access process;
wherein the first message is used to trigger the first random access procedure; whether the first message satisfies a first set of conditions is used to determine a target set of random access resources, the first set of conditions including at least one condition; when the first message does not satisfy any condition in the first condition set, the target random access resource set comprises a first candidate random access resource subset after a time interval which is not less than a first threshold from the receiving moment of the first message; when the first message meets all conditions in the first condition set, the target random access resource set comprises Q candidate random access resource subsets which are not less than a second threshold from the receiving time of the first message, wherein Q is a positive integer greater than 1; the value of the second threshold is not less than the value of the first threshold; the one subset of candidate random access resources is reserved for the second message.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110284507.4A CN115119337A (en) | 2021-03-17 | 2021-03-17 | Method and device used in wireless communication |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110284507.4A CN115119337A (en) | 2021-03-17 | 2021-03-17 | Method and device used in wireless communication |
Publications (1)
Publication Number | Publication Date |
---|---|
CN115119337A true CN115119337A (en) | 2022-09-27 |
Family
ID=83323363
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110284507.4A Pending CN115119337A (en) | 2021-03-17 | 2021-03-17 | Method and device used in wireless communication |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN115119337A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2024199335A1 (en) * | 2023-03-31 | 2024-10-03 | 上海朗帛通信技术有限公司 | Method and apparatus used in node for wireless communication |
-
2021
- 2021-03-17 CN CN202110284507.4A patent/CN115119337A/en active Pending
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2024199335A1 (en) * | 2023-03-31 | 2024-10-03 | 上海朗帛通信技术有限公司 | Method and apparatus used in node for wireless communication |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US12127168B2 (en) | Method and device used in node for wireless communication | |
CN113141597B (en) | Method and device for wireless communication of discontinuous reception | |
CN118695397A (en) | Method and apparatus in a node for wireless communication | |
US20240080906A1 (en) | Method and device used in communication node for wireless communication | |
CN113543354B (en) | Method and apparatus in a node used for wireless communication | |
CN113853028A (en) | Method and arrangement in a communication node used for wireless communication | |
US20230022606A1 (en) | Method and device in nodes used for wireless communication | |
CN115119337A (en) | Method and device used in wireless communication | |
CN113810161B (en) | Method and device for wireless communication of sidelink | |
CN114679686A (en) | Method and arrangement in a communication node used for wireless communication | |
CN114205915B (en) | Method and apparatus for wireless communication | |
CN115175371B (en) | Method and apparatus for wireless communication | |
CN113597017B (en) | Method and apparatus in a node used for wireless communication | |
US11979909B2 (en) | Method and device used for relay wireless communication | |
US20230247711A1 (en) | Method and device in communication node for wireless communication | |
US20230337183A1 (en) | Method and device used for wireless communication | |
WO2024131710A1 (en) | Method and apparatus used in node for wireless communication | |
US20230379881A1 (en) | Method and device used for wireless communication | |
CN115038191A (en) | Method and device used in wireless communication | |
CN116113040A (en) | Method and apparatus for use in wireless communication | |
CN116133003A (en) | Method and apparatus for use in wireless communication | |
CN118678450A (en) | Method and apparatus for use in a new wireless system | |
CN118234026A (en) | Method and apparatus for use in wireless communication | |
CN118158823A (en) | Method and device for wireless communication of sidelink | |
CN117320064A (en) | Method and apparatus for wireless communication |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination |