CN100421428C - Scheduling Method for Forward Common Control Channel Messages - Google Patents

Abstract

The invention discloses a scheduling method for forward public control channel messages. The method comprises the following steps: the base station side sets different types of FCCCH channel message queues according to the FCCCH channel message identifier; the system saves the received message that needs to be sent on the FCCCH channel to the corresponding message queue according to the message identifier; The message queue is scheduled according to the message identifier of the FCCCH channel, and the messages are framed and sent from the message queue according to the scheduling order. Wherein, the FCCCH channel message identifier includes: an identifier for distinguishing a general paging message from an enhanced broadcast paging message, a priority identifier, and an identifier for distinguishing a time slot message from a non-slot message. This scheduling method makes full use of the advantages of fast sending of paging messages and flexible framing of the FCCCH channel, and gives priority to sending time slot messages that occupy the channel for a short time in message scheduling, thereby shortening the waiting time for mobile terminals to receive messages and improving paging performance. Message reception efficiency.

Description

Scheduling Method for Forward Common Control Channel Messages

technical field

The invention relates to forward common control channel (FCCCH) technology in wireless communication, in particular to a scheduling method for FCCCH channel messages.

Background technique

In a mobile communication system, in order to be able to find a mobile terminal (MS), the wireless network needs to initiate a paging process, that is, the system sends a paging message with an MS identifier on a paging channel. At present, most paging messages in wireless communication are sent using a paging channel (PCH). According to the provisions of the IS2000 Release0 protocol, the PCH channel needs to send an overall message every 1.28s, so in the message sending of the PCH channel, part of the consumption is the sending of the overall message, and the sending of the overall message occupies the channel time, to a certain extent The efficiency of sending paging messages is reduced.

The relevant protocols after IS2000 Release 0 have newly added the Forward Common Control Channel (FCCCH). For example, the Release A protocol stipulates that system overall messages and broadcast messages are sent on the broadcast control channel (BCCH), and various paging messages are sent on the FCCCH channel. The BCCH channel and the FCCCH channel are used together to realize the PCH channel function stipulated in the IS2000 Release 0 protocol, and to improve the efficiency of sending paging messages.

As far as the performance of the channel itself is concerned, the agreement stipulates that: the PCH channel supports data transmission at a rate of 4.8kbps/9.6kbps, and only supports a 20ms frame structure; while the transmission rate supported by the FCCCH channel is: 9.6kbps/19.2kbps/38.4kbps, And it supports 5ms/10ms/20ms frame structure at the same time. Regardless of the data transmission rate or the flexibility of the frame structure, the performance of the FCCCH channel is better than that of the PCH channel.

Since the FCCCH channel is a newly added channel of the protocol after IS2000 Release 0, the prior art has not yet provided a corresponding implementation method for the scheduling of the FCCCH channel message. The FCCCH channel message described in this application refers to the message sent on the FCCCH channel .

Contents of the invention

In view of this, the main purpose of the present invention is to provide a scheduling method for FCCCH channel messages, which fully utilizes the advantages of high speed of sending paging messages and flexible framing of FCCCH channels to improve the receiving efficiency of paging messages.

In order to achieve the above object, the technical solution of the present invention is specifically realized in the following way:

A method for scheduling forward common control channel messages, the method comprising the following steps:

a. The system saves the received message that needs to be sent on the FCCCH channel into the preset corresponding message queue according to the FCCCH channel message identifier;

b. The system schedules the message queue according to the system time slot number and the FCCCH channel message ID, and takes messages from the message queue in the order of scheduling and sends them in frames.

The FCCCH channel message identifier in the method includes: an identifier for distinguishing general paging messages from enhanced broadcast paging messages, a priority identifier, and an identifier for distinguishing time slot messages from non-slot messages.

Further, the time slot message further includes the following identifiers: a slot cycle identifier, a sending slot identifier, and an identifier for distinguishing short-slot and normal-slot messages.

Preferably, the time slot message is further divided according to the identifier of the sending time slot.

The scheduling of the message queue described in step b in the method includes the following steps: the system judges whether the message queue has a general paging identifier or an enhanced broadcast paging identifier, and if it has a general paging identifier, then sends the message in the message queue If the message has an enhanced broadcast paging identifier, the messages in the message queue will be sent after the message queue with the general paging identifier.

Preferably, the scheduling of the message queue with the general paging identifier further includes: the system judges whether the message queue has a high priority identifier or a low priority identifier, and if it has a high priority identifier, then sends the message queue If the message has a low priority ID, the message in the message queue is sent after the message queue with a high priority ID.

Preferably, the scheduling of message queues with the same priority identifier further includes: the system judges whether the message queue has a time slot message ID or a non-slot message ID, and if it has a time slot message ID, then sends the message queue If the message has a non-slot message ID, the messages in the message queue will be sent after the message queue with the slot message ID.

Preferably, the scheduling of the message queue with a time slot message ID further includes: the system judges whether the message queue has a short time slot message ID or a normal time slot message ID, and if it has a short time slot message ID, then sends the message If the message in the queue has a message ID of a normal time slot, the message in the message queue will be sent after the message queue with a message ID of a short time slot.

Further, the system determines the time slot message queue to which the current time slot is scheduled according to the sending time slot identifier.

Getting the message framing in the message queue described in step b in this method comprises the following steps:

b1. The system judges whether the storage space allocated to the current time slot in the write frame BUFFER is full, if the storage space of the current time slot is full, then perform step b5, if not, then perform step b2.

b2. Determine whether there is a message to be sent in a message queue that is scheduled in the current time slot, if it exists, execute step b3, if not, end the operation on the message queue, and search for the next scheduled message queue in the current time slot .

b3. Take a message from the message queue and fill it into the write frame BUFFER.

b4. Determine whether the storage space allocated to the current time slot in the write frame BUFFER is full, if it is full, execute step b5, otherwise execute step b2.

b5. End the framing operation of the current time slot.

It can be seen from the above-mentioned technical solution that the FCCCH channel message scheduling method of the present invention makes full use of the advantages of fast sending paging message speed and flexible framing of the FCCCH channel, and gives priority to sending time slot messages that occupy the channel for a short time in message scheduling. Therefore, the waiting time for the mobile terminal to receive the message is shortened, and the efficiency of receiving the paging message is improved. The method has a good application prospect in the field requiring real-time sending and receiving of paging messages.

Description of drawings

Fig. 1 is the scheduling flowchart of FCCCH channel message among the present invention;

Fig. 2 is a schematic diagram of message queue classification in the present invention;

Fig. 3 is a flow chart of message frame sending in a preferred embodiment of the present invention.

Detailed ways

The core idea of the method of the present invention is: the base station side sets different types of FCCCH channel message queues according to the FCCCH channel message identifiers, and the system saves the received messages that need to be sent on the FCCCH channel into the corresponding message queues according to the message identifiers, and finally the system The message queue is scheduled according to different FCCCH channel message identifiers, and messages are framed and sent from the message queue according to the scheduling order.

Wherein, the FCCCH channel message identifier includes: an identifier for distinguishing general paging messages from enhanced broadcast paging messages, a priority identifier, and an identifier for distinguishing time slot messages from non-slot messages. For the time slot message, it also includes: a time slot cycle identifier, a sending time slot identifier (PGSLOT), and an identifier for distinguishing short-slot and normal-slot messages.

In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings and examples.

As shown in Figure 1, the dispatch process of the present invention about FCCCH channel message comprises the following steps:

Step 101: the base station side sets different types of FCCCH channel message queues according to the FCCCH channel message identifiers.

The division of FCCCH channel messages is shown in FIG. 2 . A general paging message 202 and an enhanced broadcast paging message 203 can be sent on the FCCCH channel. Wherein, the enhanced broadcast paging message 203 is used to notify the mobile terminal to receive a broadcast message of a specific broadcast control channel (BCCH).

For the general paging message 202, the message can be divided into a high-priority message 204 and a low-priority message 205 according to the priority identifier of the message. The priority identifier is set according to the service type of the message. For example, the base station can set a high priority identifier for call-related messages and a low priority identifier for call-related messages.

For messages with the same priority identifier, this type of message is further subdivided into: high-priority time-slot message 206, high-priority non-slot message 207, and low-priority Slotted messages 208, and low priority non-slotted messages 209.

Further, the time slot message can also be divided into short time slot message and normal time slot message, namely: high priority short time slot message 210, high priority normal time slot message 211, low priority short time slot message 212 and Low priority normal slot message 213 . Wherein, the normal slot paging message refers to a paging message with a slot cycle of 1.28*2 ⁱ s, and i is a slot cycle index (SLOT_CYCLE_INDEX) of the slot paging message. According to the agreement, the definition range of i is 0-7. The short slot paging message is defined relative to the normal slot paging message. The slot cycle of this type of paging message is smaller than the minimum slot cycle of the normal slot paging message, that is, when the slot cycle is less than 1.28s A short-slot paging message is called a short-slot paging message.

According to the above classification of FCCCH channel message 201, the system constructs a corresponding message queue for each message type to store different messages, which is convenient for searching during scheduling.

Since the time slot paging message is only sent in a certain time slot of its time slot cycle, the system further stores this type of message in queues according to its sending time slot identifier (PGSLOT).

For short-slot paging messages, the system saves each short-slot paging message into the corresponding queue according to the queue number of the time slot. Wherein, the time slot queue number is obtained according to formula (1):

Time slot queue number = PGSLOT mod (message time slot period/system unit time slot length) (1)

In the embodiment of the present invention, the system unit time slot length can be set to 80ms.

The slot cycles of the short slot paging message are 80ms, 160ms, 320ms and 640ms, and four slot cycle identifiers are used to distinguish different slot cycles. A short-slot paging message with a time slot cycle of 80ms has only one sending time slot per time slot cycle, and this type of message has only one message queue with a time slot queue number of 0; a short-slot paging message with a time slot cycle of 160 ms There are two sending time slots in the period, and the system constructs two message queues with the time slot queue numbers 0 and 1 for this type of message; the 320ms short-slot paging message has four sending time slots in each time slot cycle, and the system is This type of message constructs four message queues with slot queue numbers from 0 to 3; the 640ms short-slot paging message has eight sending slots per slot cycle, and the system constructs a slot queue number of 0 for this type of message Eight message queues for ~7.

For the normal time slot paging message, similarly, the system saves each normal time slot paging message in the corresponding queue according to the time slot queue number, wherein the time slot queue number obtains according to formula (2):

Time slot queue number = PGSLOT mod (normal time slot message minimum slot period/system unit time slot length) (2)

Wherein, the time slot cycle of the normal time slot paging message is 1.28*2 ⁱ s, so the minimum slot cycle is 1.28 s. In the embodiment of the present invention, assuming that the unit time slot length of the system is 80 ms, the system needs to construct 16 message queues for all normal time slot paging messages, and the time slot queue numbers are 0-15.

Step 102: the system saves the received message to be sent on the FCCCH channel into the corresponding message queue according to the message identifier.

After receiving the message to be sent on the FCCCH channel from the base station controller (BSC), the base station saves the currently received message into the corresponding message queue according to the identifier of the message.

Step 103: The system schedules the message queue according to the time slot number N and the FCCCH channel message identifier, and takes the message frame from the message queue according to the scheduling sequence and sends it.

In a time slot where the system time slot number is N, the system searches for messages to be sent in the FCCCH channel message queue 201, and the scheduling sequence of the message queue is as follows:

For the general paging message queue 202 and the enhanced broadcast paging message queue 203, the system sends the messages in the general paging message queue 202 first, and then sends the messages in the enhanced broadcast paging message queue 203.

For the message queue of the general paging message type, the system judges the priority identification of the message queue, and the messages in the high-priority message queue 204 are sent first, and the messages in the low-priority message queue 205 are sent later.

For queues with the same priority ID, the system sends the messages in the message queue with the slot ID first, and then sends the messages in the message queue with the non-slot ID. For example: for the time-slot message queue 206 and the non-slot message queue 207, the system sends the messages in the time-slot message queue 206 first.

For queues with time slot IDs, the system sends messages in message queues with short slot IDs first, and then sends messages in message queues with normal slot IDs. For example: for the short-slot message queue 210 and the normal-slot message queue 211 , the system sends the messages in the short-slot message queue 210 first.

In a time slot where the system time slot number is N, the base station determines the scheduled time slot message queue of the current time slot according to the sending time slot identifier (PGSLOT) of the message, and satisfies the condition: ((N-PGSLOT) mod (time slot of the message Period/system unit time slot length)==0) messages are sent in the current time slot.

In the current time slot of the system, the process of the system taking out messages from the message queue and framing them is shown in Figure 3.

Step 301: When the trigger of the current time slot arrives, the system judges whether the storage space allocated to the current time slot in the write frame BUFFER is full. If the storage space of the current time slot is full, execute step 306; if not, then Execute step 302.

Step 302: Judging whether there is a message to be sent in a message queue scheduled for the current time slot, if yes, execute step 303; if not, execute step 305.

Step 303: Take a message from the message queue and fill it into the frame writing BUFFER.

Step 304: Determine whether the storage space allocated to the current time slot of the system in the write frame BUFFER is full. If it is full, go to step 306; otherwise go to step 302.

Step 305: End the operation on this message queue, and continue to search for the next scheduled message queue in the current time slot of the system.

Step 306: End the framing operation of the current time slot of the system, and wait for the arrival of the next time slot meeting the condition of the message sending time slot.

During framing, if the messages in the message queue scheduled first fill up the storage space of the current time slot in the write frame BUFFER, the messages in the message queue scheduled later will not be sent, and wait for the next message that matches the message to be sent. The time slot for the slot condition arrives.

On the side of the wireless communication base station, the FCCCH channel message is sent with a frame as the smallest time unit, that is, the channel sends a frame of message each time. In the existing agreement, the system unit time slot length is 80ms, and the unit frame length is 5ms, 10ms or 20ms. For the case where the unit frame length is 20 ms, the system unit time slot is divided into four frames, and each time slot message is sent four times.

The scheduling, framing and message sending operations described in step 103 are performed synchronously by the system. The system searches the message queue according to the scheduling sequence, finds the message queue that is scheduled first in the current time slot, and takes the messages in the queue to form a frame. During the framing process, the system searches for the next scheduled message queue. When each frame request arrives, the system fetches the message from the write frame BUFFER and sends it.

It can be seen from the above embodiments that the method for scheduling FCCCH channel messages of the present invention is simple and practical. This method makes full use of the advantages of fast paging message sending speed and flexible framing of the FCCCH channel, and gives priority to sending time slot messages that occupy the channel for a short time in the message scheduling, thereby shortening the waiting time for the mobile terminal to receive the message and improving the efficiency of the paging message. receiving efficiency.

Claims (10)

1. a method for scheduling forward common control channel FCCCH message, it is characterized in that, the method may further comprise the steps: a. The system saves the received message that needs to be sent on the FCCCH channel into the preset corresponding message queue according to the FCCCH channel message identifier; b. The system schedules the message queue according to the system time slot number and the FCCCH channel message ID, and takes messages from the message queue in the order of scheduling and sends them in frames. 2. The method according to claim 1, wherein the FCCCH channel message identifier comprises: an identifier for distinguishing general paging messages and enhanced broadcast paging messages, a priority identifier, and distinguishing time slots and non-slot messages logo. 3. The method according to claim 2, wherein the time slot message also includes the following marks: a time slot cycle mark, a sending time slot mark, and a mark for distinguishing short time slots and normal time slot messages. 4. The method according to claim 3, wherein the time slot message is further divided according to the sending time slot identifier. 5. The method according to claim 3, wherein the scheduling of the message queue described in step b comprises the following steps: the system judges whether the message queue has a general paging identifier or an enhanced broadcast paging identifier, if it has If the general paging identifier is used, the messages in the message queue are sent. If the enhanced broadcast paging identifier is used, the messages in the message queue are sent after the message queue with the general paging identifier. 6. The method according to claim 5, wherein the scheduling of the message queue with the general paging identifier further comprises: the system judges whether the message queue has a high-priority identifier or a low-priority identifier, and if the message queue has a high-priority identifier Priority identification, then send the message in the message queue, if it has a low priority identification, then the message in the message queue will be sent after the message queue with a high priority identification. 7. The method according to claim 6, wherein the scheduling of message queues with the same priority identification further comprises: the system judges whether the message queue has a time slot message identification or has a non-slot message identification, if it has time slot message ID, then send the message in the message queue, if it has a non-time slot message ID, then send the message in the message queue after the message queue with the time slot message ID. 8. The method according to claim 7, wherein, the scheduling of the message queue with the time slot message identification further comprises: the system judges whether the message queue has a short time slot message identification or has a normal time slot message identification, if If it has a message ID of a short time slot, then the messages in the message queue are sent; if it has a message ID of a normal time slot, the messages in the message queue are sent after the message queue with a message ID of a short time slot. 9. The method according to claim 3, wherein the system determines the scheduled time slot message queue of the current time slot according to the sending time slot identification. 10. method according to claim 1, is characterized in that, the message framing in the message queue of getting described in step b comprises the following steps: b1. The system judges whether the storage space allocated to the current time slot in the write frame buffer BUFFER is full, if the storage space of the current time slot is full, then perform step b5, if not, then perform step b2; b2. Determine whether there is a message to be sent in a message queue that is scheduled in the current time slot, if it exists, execute step b3, if not, end the operation on the message queue, and search for the next scheduled message queue in the current time slot ; b3. Take a message from the message queue and fill it into the write frame BUFFER; b4. Judging whether the storage space allocated to the current time slot in the write frame BUFFER is full, if it is full, then perform step b5, otherwise perform step b2; b5. End the framing operation of the current time slot.

Images