WO2019085911A1

WO2019085911A1 - Window-based scheduling method, device and computer readable medium

Info

Publication number: WO2019085911A1
Application number: PCT/CN2018/112797
Authority: WO
Inventors: Zhuo WU; Tao Tao; Jianguo Liu; Gang Shen; Jun Wang; Zhe LUO
Original assignee: Nokia Shanghai Bell Co., Ltd.; Nokia Solutions And Networks Oy; Nokia Technologies Oy
Priority date: 2017-10-30
Filing date: 2018-10-30
Publication date: 2019-05-09
Also published as: CN109729586B; CN109729586A

Abstract

Embodiments of the present disclosure provide a window-based scheduling method, deVice and computer readable medium in unlicensed spectrum. The method comprises transmitting scheduling information associated with a downlink message to a terminal deVice. The scheduling infbrmation indicates a message window in which the network deVice will transmit the downlink message to the terminal deVice. The message window comprises a plurality of consecutive slots. The method further comprises： in response to detecting, in the message window, that a channel between the network device and terrminal device is idle, transmitting the downlink message to the terminal device.

Description

WINDOW-BASED SCHEDULING METHOD, DEVICE AND COMPUTER READABLE MEDIUM

CROSS REFERENCE TO RELATED APPLICATIONS

The present application claims priority to Chinese Patent Application No. 201711035628.5 filed on October 30, 2017, which is incorporated herein by reference in its entirety.

FIELD

Embodiments of the present disclosure generally relate to communication technologies, and more specifically to a window-based scheduling method, device and computer readable medium in unlicensed spectrum.

BACKGROUND

In a new radio (NR) system using licensed spectrum, to facilitate performing downlink transmission to a terminal device, a network device may employ a scheduling process based on a fixed timing. In the scheduling process based on the fixed timing, the network device transmits scheduling information to the terminal device in a current slot, and the scheduling information indicates a single slot subsequent to the current slot in which the network device will transmit a downlink (DL) message to the terminal device.

The NR system relates to transmissions in the unlicensed spectrum. To perform a downlink transmission to the terminal device in the unlicensed spectrum, the network device needs to first perform Listen Before Talk (LBT) operation to determine whether a channel between the network device and terminal device is idle. Only after the channel is determined as being idle can the network device initiate the downlink transmission to the terminal device. A result of the LBT operation in the unlicensed spectrum is uncertain. If the LBT operation in a single slot indicated by the scheduling information fails, the network device cannot initiate the downlink transmission to the terminal device in the single slot, which causes waste of the scheduling information that has been already transmitted.

SUMMARY

Embodiments of the present disclosure provide a window-based scheduling method, device and computer readable medium in unlicensed spectrum.

In a first aspect, embodiments of the present disclosure provide a method implemented at a network device. The method comprises transmitting scheduling information associated with a downlink message to a terminal device. The scheduling information indicates a message window in which the network device will transmit the downlink message to the terminal device. The message window comprises a plurality of consecutive slots. The method further comprises: in response to detecting, in the message window, that a channel between the network device and terminal device is idle, transmitting the downlink message to the terminal device.

In some embodiments, the scheduling information indicates at least one of: a starting slot of the plurality of consecutive slots, an ending slot of the plurality of consecutive slots, and the number of the plurality of consecutive slots.

In some embodiments, the starting slot or the ending slot is determined based on at least one of: a length of transmission bursts in which the scheduling information is transmitted, and a condition of the channel.

In some embodiments, transmitting the scheduling information comprises transmitting multiple copies of the scheduling information in a time division manner via a set of transmission beams, the multiple copies indicating a set of message windows in which the network device will transmit a set of downlink messages to the terminal device.

In some embodiments, the number of message windows in the set of message windows is the same as the number of the transmission beams in the set of transmission beams.

In some embodiments, transmitting the downlink message comprises transmitting, in the set of message windows, the set of downlink messages in the time division manner via the set of transmission beams.

In some embodiments, transmitting the scheduling information comprises transmitting multiple copies of the scheduling information in a time division manner via a set of transmission beams, the multiple copies indicating a single message window in which the network device will transmit the downlink message to the terminal device.

In some embodiments, transmitting the downlink message comprises transmitting the downlink message in a broadcast manner in the single message window.

In some embodiments, the downlink message comprises at least one of the following: a paging message and a system information message. In some embodiments, the system information message comprises a Remaining Minimum System Information (RMSI) message.

In some embodiments, transmitting the scheduling information comprises transmitting the scheduling information via at least one of Downlink Control Information (DCI) and a high layer signaling.

In a second aspect, embodiments of the present disclosure provide a method implemented at a terminal device. The method comprises receiving, from a network device, scheduling information associated with a downlink message, the scheduling information indicating a message window in which the network device will transmit the downlink message to the terminal device, the message window comprising a plurality of consecutive slots. The method further comprises receiving the downlink message from the network device in the message window.

In a third aspect, embodiments of the present disclosure provide a network device. The network device comprises a processor and a memory. The memory stores instructions. The instructions, when executed by the processor, cause the network device to execute the method according to the first aspect of the present disclosure.

In a fourth aspect, embodiments of the present disclosure provide a terminal device. The terminal device comprises a processor and a memory. The memory stores instructions. The instructions, when executed by the processor, cause the terminal device to execute the method according to the second aspect of the present disclosure.

In a fifth aspect, embodiments of the present disclosure provide a computer readable medium which comprises machine executable instructions. The machine executable instructions, when executed by an apparatus, cause the apparatus to execute the method according to the first aspect of the present disclosure.

In a sixth aspect, embodiments of the present disclosure provide a computer readable medium which comprises machine executable instructions. The machine executable instructions, when executed by an apparatus, cause the apparatus to execute the method according to the second aspect of the present disclosure.

It will be appreciated that the Summary part does not intend to indicate essential or important features of embodiments of the present disclosure or to limit the scope of the present disclosure. Other features of the present disclosure will be made apparent by the following description.

BRIEF DESCRIPTION OF THE DRAWINGS

Through the following detailed description with reference to the accompanying drawings, the above and other features, advantages and aspects of example embodiments of the present disclosure will become more apparent. In the drawings, identical or similar reference numbers represent the same or similar elements, in which:

Fig. 1 illustrates an example radio communication system in which an embodiment of the present disclosure may be implemented;

Fig. 2 illustrates a schematic diagram of a conventional scheduling process based on a fixed timing;

Fig. 3 illustrates a schematic diagram of a conventional scheduling process based on a fixed timing in a multi-beam scenario;

Fig. 4 illustrates an interaction diagram of a window-based scheduling process according to some embodiments of the present disclosure;

Fig. 5 illustrates a schematic diagram of a window-based scheduling process according to some embodiments of the present disclosure;

Fig. 6 illustrates a schematic diagram of a window-based scheduling process according to some embodiments of the present disclosure under a multi-beam scenario;

Fig. 7 illustrates a schematic diagram of a window-based scheduling process according to other embodiments of the present disclosure under the multi-beam scenario;

Fig. 8 illustrates a flow chart of a method implemented at a network device according to some embodiments of the present disclosure;

Fig. 9 illustrates a flow chart of a method implemented at a terminal device according to some embodiments of the present disclosure; and

Fig. 10 illustrates a block diagram of a device adapted to implement embodiments of the present disclosure.

DETAILED DESCRIPTION OF EMBODIMENTS

Embodiments of the present disclosure will be described with reference to the drawings in detail. Though some embodiments of the present disclosure are shown in the drawings, it should be appreciated that the present disclosure can be implemented in various manners and should not be interpreted as limited to the implementations described herein. Conversely, these implementations are provided for thorough and complete understanding of the present disclosure. It is to be understood that the drawings and implementations are only for the purpose of example, rather than to limit the scope of protection of the present disclosure.

The term “network device” used here refers to other entities or nodes having specific functions in a base station or communication network. The term “base station (BS) ” may represent a node B (NodeB or NB) , an Evolved Node B (eNodeB or eNB) , a remote radio unit (RRU) , a radio-frequency head (RH) , a remote radio head (RRH) , a repeater, or a low power node such as a Picocell, a Femto cell and the like. In the context of the present disclosure, the terms “network device” and “base station” may be used interchangeably, and generally, the eNB is taken as an example of the network device, for the sake of discussion.

The term “terminal equipment” or “user equipment (UE) ” used herein refers to any terminal device that can perform wireless communications with the base station or one another. As an example, the terminal equipment may comprise a mobile terminal (MT) , a subscriber station (SS) , a portable subscriber station (PSS) , a mobile station (MS) or an access terminal (AT) , and the above on-board devices. In the context of the present disclosure, the terms “terminal equipment” and “user equipment” may be used interchangeably for the sake of discussion.

As used herein, the term “comprises” and its variants are to be read as open-ended terms that mean “comprises, but is not limited to. ” The term “based on” is to be read as “based at least in part on. ” The term “one example embodiment” is to be read as “at least one example embodiment, ” and the term “another embodiment” is to be read as “at least one another embodiment. ” Relevant definition for other terms will be given in the following depiction.

Fig. 1 illustrates an example radio communication system 100 in which an embodiment of the present disclosure may be implemented. The radio communication device 100 comprises a network device 110 and a terminal device 120 served by the network device 110. It should be appreciated that the number of network device and the number of terminal device shown in Fig. 1 are only for illustration purpose, not intended to limit. The radio communication system 100 may comprise any proper types and number of network devices, each of which may provide any proper number of cells, and the radio communication system 100 may further comprise any proper number of terminal devices.

Communication between the network device 110 and terminal device 120 may be implemented according to any proper communication protocol, including but not limited to the first generation (1G) , the second generation (2G) , the third generation (3G) , the fourth generation (4G) , the fifth generation (5G) and other cellular communication protocol, wireless local area network communication protocols such as Institute of Electrical and Electronics Engineers (IEEE) 802.11, and/or any other protocols that are currently known or to be developed later. Furthermore, the communication utilizes any appropriate wireless communication technology, including without limitation to, code division multiple access (CDMA) , frequency division multiple access (FDMA) , time division multiple access (TDMA) , frequency division duplexing (FDD) , time division duplexing (TDD) , multiple input multiple output (MIMO) , orthogonal frequency division multiplexing (OFDM) , and/or any other technology that is currently known or to be developed in future. It should be appreciated that although embodiments of the present disclosure is mainly described by using an NR system as an example, this is only exemplary, and the technical solution of the present disclosure may completely applied to other proper already-existing or to-be-developed systems.

In the new radio (NR) system using licensed spectrum, to facilitate performing downlink transmission to a terminal device, a network device may employ a scheduling process based on a fixed timing. However, the scheduling process based on the fixed timing is not completely adapted to the NR system using unlicensed spectrum. In the below descriptions, reference is made to Fig. 2 and Fig. 3 to describe a conventional scheduling process based on a fixed timing.

Fig. 2 illustrates a schematic diagram of a conventional scheduling process 200 based on a fixed timing that is executed in the NR system. As shown in Fig. 2, the network device transmits scheduling information associated with a DL message to the terminal device in the slot 210. The scheduling information indicates a single slot 220 subsequent to the slot 210 in which the network device will transmit a DL message to the tenninal device.

To perfonn downlink transmission to the terminal device in the unlicensed spectrum, the network device needs to first perform the LBT operation to determine whether a channel between the network device and terminal device is idle. After the LBT operation succeeds (namely, determine that the channel is idle) , the network device can initiate the downlink transmission to the terminal device. In Fig. 2, since the LBT operation at the slot 220 indicated by the scheduling information fails, the network device cannot initiate the downlink transmission to the terminal device in the slot 220, which causes waste of the scheduling information that has been transmitted.

In addition, in the NR system below 6 GHz, an operation for a signal with broadcast characteristics may be similar to an operation in the LTE system. However, in the NR system above 6 GHz, beamforming is essential to compensate for path loss. One transmission beam cannot provide the full cell coverage. Therefore, the signal with broadcast characteristics needs to be transmitted using multiple transmission beams, i.e., beam sweeping.

Fig. 3 illustrates a schematic diagram of a conventional scheduling process 300 based on a fixed timing in a multi-beam scenario. As shown in Fig. 3, in a maximum channel occupation time (MCOT) 340, the network device employs six transmission beams 311 to 316 to transmit six copies 330 of the scheduling information. The six copies 330 of the scheduling information indicate slots 321 to 326 in which the network device will transmit the DL message to the terminal device.

The MCOT 340 may be defined according to spectrum specification of different regions. For example, in Japan, the MCOT of 5 GHz unlicensed frequency band is defined as 4ms, whereas it is defined as 6ms in Europe. In addition, under some conditions, the MCOT may be enlarged to 8ms or 10ms. In Fig. 3, MCOT 340 is 8ms. Due to limitations of MCOT, the network device cannot complete transmission of the DL message within the MCOT 340. To perform transmission of the DL message, the network device needs to execute LBT operation again. Since the LBT operation in

slots

321 and 322 fails, the network device cannot use beams 311 and 312 in the

slots

321 and 322 to transmit the DL message to the terminal device, thereby causing waste of the scheduling information that is transmitted by the beams 311 and 312.

Embodiments of the present disclosure provide a window-based scheduling solution. Different from the conventional scheduling solution based on the fixed timing, the network device transmits the terminal device the scheduling information associated with a DL message. The scheduling information indicates a message window in which the network device will transmit the DL message to the terminal device. The message window comprises a plurality of consecutive slots. If the network device detects, in any slot in the message window, that the channel between the network device and terminal device is idle, the network device will transmit the DL message to the terminal device in this slot. After receiving the scheduling information, the terminal device only needs to monitor its DL message in the message window indicated by the scheduling information, and need not monitor constantly after receiving the scheduling information. In this way, it is possible to increase a success rate of reception of the DL message as well as avoid excessive power consumption of the terminal device. In the below description, the window-based scheduling solution according to the present disclosure will be described in detail with reference to Figs. 4 to 9.

Fig. 4 illustrates an interaction diagram of a window-based scheduling process 400 according to some embodiments of the present disclosure. The process 400 for example may be executed by the network device 110 and the terminal device 120 as shown in Fig. 1. For ease of discussion, the process 400 will be described in conjunction with the network device 110 and terminal device 120. It should be appreciated that the process 400 may further comprise additional acts not shown and/or shown acts may be omitted. The scope of the present disclosure is not limited in this aspect.

As shown in Fig. 4, the network device 100 transmits (410) to the terminal device 120 the scheduling information associated with the DL message. The scheduling information indicates a message window in which the network device 110 will transmit the DL message to the terminal device 120. The message window comprises a plurality of consecutive slots.

In some embodiments, the network device 110 may detect condition of the channel between the network device 110 and terminal device 120, and then determine the number of consecutive slots in the message window based on the detected condition of the channel. For example, in the case of excellent condition of the channel, the network device 110 may determine the number of consecutive slots as a smaller value to reduce complexity of monitoring the message window by the terminal device 120. In the case of undesirable condition of channel, the network device 110 may determine the number of the consecutive slots as a larger value so as to increase the probability of successful transmission of the DL message. Alternatively, the network device 110 may further determine the number of consecutive slots in the message window based on the MCOT.

It should be appreciated that determining the number of consecutive slots in the message window based on conditions of the channel is only exemplary not restrictive. Depending on a specific application scenario, the network device 110 may determine the number of consecutive slots in the message window in any suitable manner.

In some embodiments, the scheduling information indicates at least one of a starting slot, an ending slot of the plurality of consecutive slots in the message window, and the number of the plurality of consecutive slots. In some embodiments, the starting slot or the ending slot may be determined based on at least one of: a length of transmission bursts in which the scheduling information is sent, and channel condition.

In some embodiments, the network device 110 may use downlink control information (DCI) to perform dynamic configuration for the message window. For example, the network device 110 may, via the DCI, indicate the starting slot of the plurality of consecutive slots in the message window and the number of the plurality of consecutive slots to the terminal device 120.

In some embodiments, the network device 110 may use a high layer signaling to perform semi-static configuration for the message window. Examples of the high layer signaling may include but not limited to: radio resource control (RRC) signaling and media access control cell (MAC CE) . For example, the network device 110 may, via the RRC signaling, indicate the starting slot of the plurality of consecutive slots in the message window and the number of the plurality of consecutive slots to the terminal device 120.

In other embodiments, the network device 110 may use the DCI and the high layer signaling in combination to perform dynamic configuration for the message window. For example, the network device 110 may use the DCI to perform dynamic configuration for the starting slot of the message window, and use the high layer signaling to perform semi-static configuration for the number of the plurality of consecutive slots in the message window.

Further referring to Fig. 4, after the scheduling information is received from the network device 110, the terminal device may monitor (420) the message window indicated by the scheduling information.

After the above scheduling information is transmitted, the network device 110 may perform the LBT operation to detect (430) whether the channel between the network device 110 and terminal device 120 is idle. If the network device 110 detects that the channel is idle in any one of the plurality of slots in the message window, the network device 110 may transmit (440) the DL message to the terminal device 120 in the slot.

As compared with the conventional scheduling solution based on the fixed timing, in the scheduling solution of the present disclosure, if the network device detects that channel between the network device and terminal device is idle in any slot in the message window, the network device may transmit the DL message to the terminal device in the slot, thereby increasing the success rate of reception of the DL message.

Fig. 5 illustrates a schematic diagram of a window-based scheduling process according to some embodiments of the present disclosure. In this example, the network device 110 transmits the scheduling information to the terminal device 120 in the n ^th slot (n is a non-negative integer) 510 via the DCI 512. The scheduling information may indicate that the network device 110 will transmit the DL message to the terminal device 120 in the message window 520 including n+2 ^th to n+4 ^th

slots

521, 522 and 523.

If the network device 110 detects that the channel is idle in any of the

slots

521, 522 and 523 in the message window 520, the network device 110 may transmit the DL message to the terminal device 120 in the slot. In the example shown in Fig. 5, since the network device 110 detects that the channel is idle in the slot 522, the network device 110 transmits the DL message 524 to the terminal device 120 in the slot 522.

Since the network device 110 may transmit the DL message 524 to the terminal device 120 in any of the

slots

521, 522 and 523, the success rate of reception of the DL message is increased. In addition, the terminal device 120 only needs to monitor its DL message 524 in the message window 520, and need not monitor constantly after receiving the scheduling information. Thus, excessive power consumption is not caused.

In some embodiments, the network device 110 may employ a plurality of transmission beams (namely, beam sweeping) to transmit a signal to the terminal device 120. In the below description, reference is made to Fig. 6 and Fig. 7 to describe the window-based scheduling process according to some embodiments under the multi-beam scenario.

Fig. 6 illustrates an example of a window-based scheduling process 600 under a multi-beam scenario. In the scheduling process 600, the network device 110 transmits to the terminal device 120 multiple copies of the scheduling information associated with a set of the DL messages via the multiple beams and transmits to the terminal device 120 the set of DL messages via the multiple beams.

As shown in Fig. 6, the network device 110 transmits multiple copies 630 of the scheduling information in a time division manner in the scheduling window 610 via six transmission beams 621 to 626. The network device 110 may pre-transmit information related to the scheduling window 610 to the terminal device 120 via a high layer signaling. For example, the network device 110 may transmit position information and a size of the scheduling window 610 via the high layer signaling.

The multiple copies 630 of the scheduling information are associated with the set of DL messages 650. The multiple copies of the scheduling information 630 include six copies of the scheduling information, the set of DL messages 650 comprises six copies of DL message, and each of the six copies of the scheduling information is associated with one of six copies of the DL message.

The multiple copies of the scheduling information 630 indicate a set of message windows 640 in which the network device 110 will transmit the set of the DL messages 650. The set of message windows 640 comprises six message windows (not shown) . The multiple copies of the scheduling information 630 indicate six message windows, and each message window in the six message windows comprises one of the

slots

661 and 666.

The network device 110 transmits a set of DL messages 650 to the terminal device 120 in a time division manner in the set of the message windows 640 via six transmission beams 621 to 626. In the example shown in Fig. 6, since the network device 110 detects in the slots 661 to 666 that the channel between the network device 110 and terminal device 120 is idle, the network device 110 may transmit in the slots 661 to 666 the DL message associated with the scheduling information sent via the beams 621 to 626.

By using the scheduling process 600, the network device 110 may employ the scheduling window 610 and a message window separated from the scheduling window 610 to respectively schedule transmission of the scheduling information associated with the DL message and transmission of the DL message. Thus, scheduling flexibility of the network device 110 is improved.

It should be appreciated that the number of transmission beams, the number of copies of the scheduling information and the number of message windows shown in Fig. 6 is only for illustration purpose and not intended for limitation. Depending on a desired transmission precision, the network device may employ any suitable number of transmission beams to transmit a corresponding number of copies of the scheduling information, thereby indicating a corresponding number of message windows.

The above describes with reference to Fig. 6 a scheduling process in which the network device 110 transmits the set of DL messages to the terminal device 120 via multiple beams. However, in some embodiments, the network device 110 may transmit the DL message to the terminal device 120 in an omnidirectional manner via a single transmission beam. For example, the network device 110 may transmit the DL message to the terminal device 120 in a broadcast manner via a single transmission beam. In such embodiment, the network device 110 transmits multiple copies of the scheduling information in a time division manner via a set of transmission beams. The multiple copies of the scheduling information indicate a single message window in which the network device 110 will transmit downlink message to the terminal device 120. If the network device 110 determines in the single message window that the channel between the network device 110 and terminal device 120 is idle, the network device 110 will transmit the downlink message to the terminal device 120 in a broadcast manner in the single message window.

The window-based scheduling solution according to the present disclosure may be adapted for transmission of signals with broadcast characteristics Examples of the signals with broadcast characteristics may include but not limited to paging message. During paging, the terminal device periodically wakes up and monitors Physical Downlink Control Channel (PDCCH) in order to check for the presence of a paging message during idle mode. If the PDCCH comprises the paging indicator/DCI which indicates that a paging message is transmitted in the slot, then terminal device needs to demodulate the paging channel (PCH) to see if the paging message is directed to it. By this way, the terminal device can save the battery while it is in sleeping mode and can get the paging message as well. In conventional scheduling based on a fixed timing, if the LBT operation at the single slot indicated by the paging DCI for paging message at the network device, the terminal device cannot receive the paging message from the network device on the single slot. Therefore, the terminal device has to wait for next paging cycle to detect the paging DCI again. This undoubtedly delays the terminal device’s access to the network. With the window-based scheduling solution of the present disclosure being used, if the network device detects in any of the plurality of consecutive slots in the message window that the channel is idle, it is possible to transmit the paging message to the terminal device in the slot, which increases the success rate of reception of the paging message and thereby avoids the delay of the terminal device’s access to the network.

In addition to the paging message, examples of signals with broadcast characteristics may further include a remaining minimum system information (RMSI) message. At present, since a payload of the RMSI message is larger, for example at least about 200 bits, the network device may schedule the transmission of the RMSI message and transmission of RMSI message-related DCI (briefly called “RMSI DCI” ) in separate transmission bursts.

Fig. 7 illustrates an example of a window-based scheduling process 700 for RMSI message under the multi-beam scenario. In the scheduling process 700, the network device 110 schedules transmission of RMSI DCI 721 to 724 and transmission of RMSI messages 731 to 734 in synchronous signal burst 710 and RMSI burst 720 which are separate.

Specifically, in the synchronous signal burst 710, the network device 110 may perform frequency division multiplexing for RMSI DCIs 721 to 724 and synchronous signal blocks (SSB) 711 to 714, and then perform transmission on PDCCH.

The network device 110 transmits, in the first slot, the

SSBs

711 and 712 for performing frequency division multiplexing with the

RMSI DCIs

721 and 722, via two transmission beams. The network device 110 transmits, in the second slot, the

SSBs

713 and 714 for performing frequency division multiplexing with the

RMSI DCIs

723 and 724, via two transmission beams. Each of the first slot and the second slot comprises 14 symbols, and each of SSBs 711 to 714 occupies four symbols.

The RMSI DCIs 721 to 724 are associated with RMSI messages 731 to 734 respectively, and respectively indicate RMSI message windows 741 to 744 in which the network device 110 will transmit the RMSI messages 731 to 734.

So long as the network device 110 detects in any slot in each of the RMSI message windows 741 to 744 that the channel between the network device 110 and terminal device 120 is idle, the network device 110 may transmit the RMSI messages 731 to 734 to the terminal device 120 in the RMSI message windows 741 to 744 via four transmission beams, thereby increasing the success rate of reception of the RMSI messages.

It should be appreciated that for brevity purpose, Fig. 7 only shows S SB 711 to 714 with respect to four transmission directions and RMSI DCIs 721 to 724 performing multiplexing therewith. However, the synchronous signal burst 710 usually may include SSBs with respect to eight transmission directions. In this regard, the network device 100 may schedule, in the synchronous signal burst 710, RMSI DCIs performing multiplexing with SSBs in the eight transmission directions.

In addition, the embodiments of the present disclosure are described above in conjunction with RMSI messages, but this is only an example. The scheduling solution of the present disclosure may also be adapted for the scheduling of other system information messages other than RMSI message. In addition, performing frequency division multiplexing for RMSI DCIs and SSBs is only an example, and performing time division multiplexing for the RMSI DCIs and SSBs is also possible. The scope of the present disclosure is not limited in this aspect.

Fig. 8 illustrates a flow chart of a method 800 implemented at a network device according to some embodiments of the present disclosure. For ease of description, the method 800 is described with reference to Fig. 1 by taking an example in which the method is implemented at the network device 110 shown in Fig. 1. It should be appreciated that the method 800 may further comprise additional steps not shown and/or shown steps may be omitted. The scope of the present disclosure is not limited in this aspect.

At block 810, the network device 110 transmits to the terminal device 120 the scheduling information associated with the downlink message. The scheduling information indicates a message window in which the network device 110 will transmit the downlink message to the terminal device 120. The message window comprises a plurality of consecutive slots.

At block 820, in response to detecting, in the message window, that the channel between the network device 110 and terminal device 120 is idle, the network device 110 transmits the downlink message to the terminal device 120.

In some embodiments, the scheduling information indicates at least one of: a starting slot, an ending slot of the plurality of consecutive slots in the message window, and the number of the plurality of consecutive slots.

In some embodiments, the starting slot or the ending slot may be determined based on at least one of: a length of transmission bursts in which the scheduling information is transmitted, and channel condition.

In some embodiments, transmitting the scheduling information comprises transmitting multiple copies of the scheduling information in a time division manner via a set of transmission beams. The multiple copies indicate a set of message windows in which the network device 110 will transmit a set of downlink messages to the terminal device 120.

In some embodiments, the number of the message windows in the set of message windows is the same as the number of multiple transmission beams in the set of transmission beams.

In some embodiments, transmitting the downlink message comprises transmitting, in the set of message windows, the set of downlink messages in a time division manner via the set of transmission beams.

In some embodiments, transmitting the scheduling information comprises transmitting multiple copies of the scheduling information in a time division manner via the set of transmission beams. The multiple copies indicate a single message window in which the network device 110 will transmit the downlink message to the terminal device 120.

In some embodiments, the downlink message comprises at least one of the following: a paging message and a system information message. In some embodiments, the system information message comprises an RMSI message.

In some embodiments, transmitting the scheduling information comprises transmitting the scheduling information via at least one of DCI and a high layer signaling.

It should be appreciated that the operations and features related to the network device 110 described above with reference to Fig. 1 and Figs. 4-7 also apply to the method 800 and achieve similar effects. Detailed depictions thereof are omitted herein for brevity purpose.

Fig. 9 illustrates a flow chart of a method 900 implemented at a terminal device according to some embodiments of the present disclosure. For ease of description, the method 900 is described with reference to Fig. 1 by taking an example in which the method is implemented at the terminal device 120 shown in Fig. 1. It should be appreciated that the method 900 may further comprise additional steps not shown and/or shown steps may be omitted. The scope of the present disclosure is not limited in this aspect.

At block 910, the terminal device 120 receives from the network device 110 scheduling information associated with a downlink message. The scheduling information indicates a message window in which the network device 110 will transmit the downlink message to the terminal device 120. The message window comprises a plurality of consecutive slots.

At block 920, the terminal device 120 receives the downlink message from the network device 110 in the message window.

In some embodiments, receiving the scheduling information comprises receiving multiple copies of the scheduling information in a time division manner via a set of transmission beams. The multiple copies indicate a set of message windows in which the network device 110 will transmit a set of downlink messages to the terminal device 120.

In some embodiments, the number of message windows in the set of message windows is the same as the number of multiple transmission beams in the set of transmission beams.

In some embodiments, receiving the downlink message comprises receiving, in the set of message windows, the set of downlink messages in a time division manner via the set of transmission beams.

In some embodiments, receiving the scheduling information comprises receiving multiple copies of the scheduling information in a time division manner via the set of transmission beams. The multiple copies indicate a single message window in which the network device 110 will transmit the downlink message to the terminal device 120.

In some embodiments, the receiving the downlink message comprises receiving the downlink message in a broadcast manner in a single message window.

In some embodiments, receiving the scheduling information comprises receiving the scheduling information via at least one of: DCI and a high layer signaling.

It should be appreciated that the operations and features related to the terminal device 120 described above with reference to Fig. 1 and Figs. 4-7 also apply to the method 900 and achieve similar effects. Detailed depictions thereof are omitted herein for brevity purpose.

Fig. 10 illustrates a block diagram of a communication device 1000 adapted to implement embodiments of the present disclosure. The device 1000 may be used to implement a data transmitting apparatus or data receiving apparatus according to embodiments of the present disclosure, for example, the network device 110 or terminal device 120 as shown in Fig. 1.

As shown in Fig. 10, the communication device 1000 comprises one or more processors 1010, one or more memories 1020 coupled to the processor 1010, and one or more transmitters and/or receivers (TX/RX) 1040 coupled to the processor (s) 1010.

The processor 1010 may be in any suitable type adapted for local technical environment, and may include but not limited to one or more of a general-purse computer, a dedicated computer, a microcomputer, a digital signal processor (DSP) and a process-based multi-core processor architecture. The device 1000 may also include a plurality of processors, for example a dedicated integrated circuit chip temporally following a clock synchronous with a main processor.

The memory 1020 may be in any suitable type adapted for local technical environment, and may be implemented using any suitable data storage technology. Non-restrictive examples of the memory are for example a non-transient computer-readable storage medium, a semiconductor-based storage device, a magnetic storage device and system, an optical storage device and system, a fixed memory and a removable memory.

The memory 1020 stores at least part of the program 1030. TX/RX 1040 is used for bidirectional communication. The TX/RX 1040 has at least one antenna to promote communication. However, in practice the device may have several antennas. The communication interface may represent any interface needed in communicating with other network elements.

The program 1030 may comprise a program instruction. The program instruction, when executed by the associated processor 1010, enables the device 1000 to operate according to the embodiment of the present disclosure, as stated with reference to Fig. 2 through Fig. 9. That is to say, embodiments of the present disclosure may be implemented by computer software executed by the processor 1010 of the communication device 1000, or implemented by hardware, or implemented by software and hardware in combination.

Generally, various exemplary embodiments of the present disclosure may be implemented in hardware or application-specific circuit, software, logic, or in any combination thereof. Some aspects may be implemented in hardware, while the other aspects may be implemented in firmware or software executed by a controller, a microprocessor or other computing device. When various aspects of the present invention are illustrated or described into block diagrams, flowcharts, or other graphical representations, it would be appreciated that the block diagrams, apparatus, system, technique or method described here may be implemented, as non-restrictive examples, in hardware, software, firmware, dedicated circuit or logic, common software or controller or other computing device, or some combinations thereof. Examples for implementing hardware devices of embodiments of the present disclosure comprise but not limited to: a field-programmable gate arrays (FPGA) , Application Specific Integrated Circuit (ASIC) , Application Specific Standard Parts (ASSP) , System on Chip (SOC) , Complex Programmable Logic Device (CPLD) and the like.

As an example, the implementations of the subject matter disclosed herein can be described in a context of machine-executable instructions which are included, for instance, in the program module executed in the device on a target real or virtual processer. Generally, a program module comprises routine, program, bank, object, class, component and data structure, etc. and performs a particular task or implements a particular abstract data structure. In the implementations, the functions of the program modules can be combined or divided among the described program modules. The machine executable instructions for the program module can be executed in a local or distributed device. In the distributed device, the program module can be located between the local and remote storage mediums.

The computer program code for implementing the method of the present disclosure may be complied with one or more programming languages. These computer program codes may be provided to a general-purpose computer, a dedicated computer or a processor of other programmable data processing apparatus, such that when the program codes are executed by the computer or other programmable data processing apparatus, the functions/operations prescribed in the flowchart and/or block diagram are caused to be implemented. The program code may be executed completely on a computer, partially on a computer, partially on a computer as an independent software packet and partially on a remote computer, or completely on a remote computer or server.

In the context of the present disclosure, the machine-readable medium may be any tangible medium including or storing a program for or about an instruction executing system, apparatus or device. The machine-readable medium may be a machine-readable signal medium or machine-readable storage medium. The machine-readable medium may include, but not limited to, electronic, magnetic, optical, electro-magnetic, infrared, or semiconductor system, apparatus or device, or any appropriate combination thereof. More detailed examples of the machine-readable storage medium comprises, an electrical connection having one or more wires, a portable computer magnetic disk, hard drive, random-access memory (RAM) , read-only memory (ROM) , erasable programmable read-only memory (EPROM or flash memory) , optical storage device, magnetic storage device, or any appropriate combination thereof.

Besides, although the operations are depicted in a particular sequence, it should not be understood that such operations are completed in a particular sequence as shown or in a successive sequence, or all shown operations are executed so as to achieve a desired result. In some cases, multi-task or parallel-processing would be advantageous. Likewise, although the above discussion comprises some specific implementation details, they should not be explained as limiting the scope of any invention or claims, but should be explained as a description for a particular implementation of a particular invention. In the present invention, some features described in the context of separate implementations may also be integrated into a single implementation. On the contrary, various features described in the context of a single implementation may also be separately implemented in a plurality of implementations or in any suitable sub-group.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter specified in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.

Claims

A method implemented at a network device, comprising:

transmitting scheduling information associated with a downlink message to a terminal device, the scheduling information indicating a message window in which the downlink message is to be transmitted by the network device to the terminal device, the message window comprising a plurality of consecutive slots; and

in response to detecting in the message window that a channel between the network device and terminal device is idle, transmitting the downlink message to the terminal device.
The method of claim 1, wherein the scheduling information indicates at least one of:

a starting slot of the plurality of consecutive slots,

an ending slot of the plurality of consecutive slots, and

the number of the plurality of consecutive slots.
The method of claim 2, wherein the starting slot or the ending slot is determined based on at least one of:

a length of transmission bursts in which the scheduling information is transmitted, and

a condition of the channel.
The method of claim 1, wherein transmitting the scheduling information comprises:

transmitting a plurality of copies of the scheduling information in a time division manner via a set of transmission beams, the plurality of copies indicating a set of message windows in which a set of downlink messages are to be transmitted by the network device to the terminal device.
The method of claim 4, wherein the number of the message windows in the set of message windows is the same as the number of the transmission beams in the set of transmission beams.
The method of claim 5, wherein transmitting the downlink message comprises:

transmitting, in the set of message windows, the set of downlink messages in the time division manner via the set of transmission beams.
The method of claim 1, wherein transmitting the scheduling information comprises:

transmitting a plurality of copies of the scheduling information in a time division manner via a set of transmission beams, the plurality of copies indicating a single message window in which the downlink message is to be transmitted by the network device to the terminal device.
The method of claim 7, wherein transmitting the downlink message comprises:

transmitting, in the single message window, the downlink message in a broadcast manner.
The method of claim 1, wherein the downlink message comprises at least one of the following:

a paging message, and

a system information message.
The method of claim 9, wherein the system information message comprises a Remaining Minimum System Information (RMSI) message.
The method of claim 1, wherein transmitting the scheduling information comprises transmitting the scheduling information via at least one of

Downlink Control Information (DCI) , and

higher layer signaling.
A method implemented at a terminal device, comprising:

receiving, from a network device, scheduling information associated with a downlink message, the scheduling information indicating a message window in which the downlink message is to be transmitted by the network device to the terminal device, the message window comprising a plurality of consecutive slots; and

receiving the downlink message from the network device in the message window.
The method of claim 12, wherein the scheduling information indicates at least one of:

a starting slot of the plurality of consecutive slots,

an ending slot of the plurality of consecutive slots, and

the number of the plurality of consecutive slots.
The method of claim 13, wherein the starting slot or the ending slot is determined based on at least one of:

a length of transmission bursts in which the scheduling information is transmitted, and

a condition of the channel.
The method of claim 12, wherein receiving the scheduling information comprises:

receiving a plurality of copies of the scheduling information in a time division manner via a set of transmission beams, the plurality of copies indicating a set of message windows in which a set of downlink messages are to be transmitted by the network device to the terminal device.
The method of claim 15, wherein the number of message windows in the set of message windows is the same as the number of the transmission beams in the set of transmission beams.
The method of claim 16, wherein receiving the downlink message comprises:

receiving, in the set of message windows, the set of downlink messages in a time division manner via the set of transmission beams.
The method of claim 12, wherein receiving the scheduling information comprises:

receiving a plurality of copies of the scheduling information in a time division manner via a set of transmission beams, the plurality of copies indicating a single message window in which the downlink message is to be transmitted by the network device to the terminal device.
The method of claim 18, wherein receiving the downlink message comprises:

receiving, in the single message window, the downlink message in a broadcast manner.
The method of claim 12, wherein the downlink message comprises at least one of the following:

a paging message, and

a system information message.
The method of claim 20, wherein the system information message comprises a Remaining Minimum System Information (RMSI) message.
The method of claim 12, wherein receiving the scheduling information comprises receiving the scheduling information via at least one of

Downlink Control Information (DCI) and

higher layer signaling.
A network device, comprising:

a processor; and

a memory storing instructions which, when executed by the processor, causes the network device to implement the method of any of claims 1-11.
A terminal device, comprising:

a processor; and

a memory storing instructions which, when executed by the processor, cause the network device to implement the method of any of claims 12-22.
A computer readable medium comprising machine executable instructions, the machine executable instructions, when executed by an apparatus, causing the apparatus to implement the method of any of claims 1-11.
A computer readable medium comprising machine executable instructions, the machine executable instructions, when executed by an apparatus, causing the apparatus to implement the method of any of claims 12-22.