HK1145763A - Method and apparatus for supporting broadcast and multicast services in a wireless communication system - Google Patents

Description

Method and apparatus for supporting broadcast and multicast services in a wireless communication system

This application claims priority to provisional U.S. application No.60/955620 entitled "ACCESSING ANADVERTISED SERVICE IN A multiedia SYSTEM" filed on 8/13/2007, which is assigned to the assignee of the present invention and incorporated herein by reference.

Technical Field

The present disclosure relates generally to communication, and more specifically to techniques for supporting broadcast and multicast services in a wireless communication system.

Background

Wireless communication systems are widely deployed to provide various communication services such as voice, video, packet data, messaging, broadcast, and so on. These wireless systems may be multiple-access systems capable of supporting multiple users by sharing the available system resources. Examples of such multiple-access systems may include Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, Orthogonal FDMA (OFDMA) systems, and single carrier FDMA (SC-FDMA) systems.

Wireless communication systems may support broadcast and multicast services. A broadcast service is a service that can be received by all users, such as a news broadcast service. A multicast service is a service that can be received by a group of users, for example a subscription video service. A given broadcast or multicast service may be received by any number of users at any given time. It is desirable to efficiently support broadcast and multicast services in such systems.

Disclosure of Invention

Techniques for supporting broadcast and multicast services in a wireless communication system are described herein. In an aspect, a transmitter (e.g., a node B) may transmit configuration information including a mapping of long service Identifiers (IDs) to short service IDs for advertised services. The transmitter may also transmit scheduling information including a mapping of short service IDs to radio resources for scheduled services in a current scheduling period (scheduling period). All supported services may be identified using a long service ID. The short service ID in the scheduling information may be used to identify the scheduled service. Using a short service ID instead of a long service ID may reduce the amount of scheduling information to be transmitted.

In another aspect, the transmitter may transmit information identifying the traffic being transmitted and the traffic being advertised but not transmitted. Receivers, such as User Equipment (UE), may use this information to determine whether to send requests for services of interest to the receivers.

In yet another aspect, a transmitter may transmit configuration information for traffic being advertised but not transmitted. The configuration information for each such service may include a short service ID of the service and bearer information (bearer information) for receiving the service (if transmitted). The transmitter may receive a request for traffic that is being advertised but not transmitted in a scheduling period. The transmitter may start transmitting the requested service in the next scheduling period. By sending configuration information for the advertised services, the transmitter can quickly start these services upon request by the receiver.

Various aspects and features of the disclosure are described in further detail below.

Drawings

Fig. 1 illustrates a wireless communication system;

fig. 2 shows a transmission scheme for broadcast and multicast traffic;

FIG. 3 shows an exemplary Venturi diagram for different services;

fig. 4 shows an exemplary mapping of long service IDs to short service IDs and an exemplary mapping of short service IDs to radio resources;

FIG. 5 illustrates a transmission scheme for supporting advertised services;

FIG. 6 illustrates another transmission scheme for supporting advertised services;

fig. 7 and 8 illustrate a process and apparatus for transmitting configuration information and scheduling information of a service, respectively;

fig. 9 and 10 illustrate a process and apparatus for receiving configuration information and scheduling information of a service, respectively;

FIGS. 11 and 12 illustrate a process and apparatus, respectively, for transmitting information identifying a service being advertised but not transmitted;

FIGS. 13 and 14 illustrate a process and apparatus, respectively, for receiving information identifying a service being advertised but not transmitted;

FIGS. 15 and 16 show a process and apparatus, respectively, for sending configuration information for advertised services;

FIGS. 17 and 18 illustrate a process and apparatus, respectively, for receiving configuration information for an advertised service; and

fig. 19 shows a block diagram of a node B and a UE.

Detailed Description

The techniques described herein may be used for various wireless communication systems such as CDMA, TDMA, FDMA, OFDMA, SC-FDMA and other systems. The terms "system" and "network" are often used interchangeably. A CDMA system may implement a radio technology such as Universal Terrestrial Radio Access (UTRA), CDMA2000, etc. UTRA includes wideband CDMA (wcdma) and other variants of CDMA. CDMA2000 covers IS-2000, IS-95 and IS-856 standards. A TDMA system may implement a radio technology such as global system for mobile communications (GSM). OFDMA systems may implement methods such as evolved UTRA (E-UTRA), Ultra Mobile Broadband (UMB), IEEE 802.11(Wi-Fi), IEEE 802.16(WiMAX), IEEE 802.20, flash-OFDMAnd so on. UTRA and E-UTRA are part of the Universal Mobile Telecommunications System (UMTS). The 3GPP Long Term Evolution (LTE) is an upcoming release of UMTS that uses E-UTRA, which employs OFDMA on the downlink and SC-FDMA on the uplink. Under the name "third generation partnership project" (3G)PP) describes UTRA, E-UTRA, UMTS, LTE and GSM. CDMA2000 and UMB are described in a document entitled "third generation partnership project 2" (3GPP 2). These techniques may also be used in broadcast systems, which may implement MediaFLO^TMDigital video broadcasting for handheld devices (DVB-H), integrated services digital broadcasting for terrestrial television broadcasting (ISDB-T), etc. For clarity, some aspects of these techniques are described below for LTE, which LTE terminology is used in much of the description below.

Fig. 1 shows a wireless communication system 100, which may be an LTE system. System 100 may include several node bs and other network entities. For simplicity, only three node bs 110a, 110B, and 110c are shown in fig. 1. A node B may be a fixed station used for communicating with UEs and may also be referred to as an evolved node B (enb), a base station, an access point, etc. Each node B110 provides communication coverage for a particular geographic area 102. To increase system capacity, the total coverage area of the node B may be divided into a plurality of smaller areas, e.g., three smaller areas 104a, 104B, and 104 c. Each smaller area may be served by a respective node B subsystem. In 3GPP, the term "cell" can refer to the smallest coverage area of a node B and/or a node B subsystem serving that coverage area. In 3GPP2, the term "sector" can refer to the smallest coverage area of a base station and/or a base station subsystem serving that coverage area. For clarity, the 3GPP cell concept is used in the following description.

In the example shown in fig. 1, each node B110 may have three cells covering different geographic areas. For simplicity, the cells shown in fig. 1 do not overlap each other. In practical deployments, adjacent cells will typically overlap each other at the edges, which may allow the UE to receive coverage from one or more cells at any location as the UE moves within the system.

UEs 120 may be dispersed throughout the system, and each UE may be fixed or mobile. A UE may also be referred to as a mobile station, a terminal, an access terminal, a subscriber unit, a station, etc. The UE may be a handset, a Personal Digital Assistant (PDA), a wireless modem, a wireless communication device, a handheld device, a laptop computer, a cordless phone, a broadcast receiver, etc. A UE may communicate with a node B via the downlink and uplink. The downlink (or forward link) refers to the communication link from the node bs to the UEs, and the uplink (or reverse link) refers to the communication link from the UEs to the node bs. In fig. 1, a solid line with a bidirectional arrow indicates bidirectional communication between a node B and a UE. The dashed line with the unidirectional arrow indicates that the UE receives downlink signals from the node B, e.g. for broadcast and/or multicast traffic. The terms "UE" and "user" are used interchangeably herein.

The system may support evolved multimedia broadcast/multicast services (E-MBMS) for multiple UEs as well as unicast services for individual UEs. E-MBMS comprises a point-to-multipoint service that transmits data from a single source to multiple recipients. A service for E-MBMS may be referred to as an E-MBMS service, and a service for E-MBMS may be a broadcast service or a multicast service. The E-MBMS service may be a subscription-based service or a freely available service. For simplicity, in the following description, the term "service" may refer to a broadcast service or a multicast service.

In LTE, data and overhead information are processed as logical channels on the Radio Link Control (RLC) layer. The logical channels are mapped to transport channels on a Medium Access Control (MAC) layer. The transport channels are mapped to physical channels on a physical layer (PHY). Table 1 lists some logical channels for supporting broadcast and multicast services in LTE and provides a short description for each logical channel.

TABLE 1

Channel with a plurality of channels	Name (R)	Description of the invention
			E-MBMS scheduling channel	MSCH	Scheduling information for carrying E-MBMS service
E-MBMS control channel	MCCH	Configuration information for bearing E-MBMS service
			E-MBMS service channel	MTCH	Data for bearing E-MBMS service

The MSCH, MCCH, and MTCH may be used to advertise traffic, to indicate the traffic being transmitted, and to carry data for the transmitted traffic. A cell may transmit one or more sets of traffic over a particular geographic area. There may be one MSCH, one or more MCCHs and one or more MTCHs for each set of traffic. For a group of services, the MSCH may carry scheduling information for all services scheduled to be transmitted in the group. Each MCCH may carry configuration information for one or more services. Each MTCH may carry data for one or more services. The MSCHs of different sets of traffic are multiplexed (e.g., in time) within the resources available for transmitting scheduling information in the cell. For simplicity, much of the following description uses one MSCH, one MCCH, and one MTCH, which may also be referred to by other names.

As shown in table 1, different types of overhead information may be transmitted on different logical channels. The scheduling information may indicate when different traffic is transmitted, what radio resources may be used to transmit the traffic, and possible additional settings associated with those radio resources used by the UE to decode the transmitted traffic. The UE may receive the traffic using the configuration information, and the configuration information may include bearer information, mapping of service IDs, higher layer information, and the like. The bearer information may include information for bearer configuration (e.g., traffic class, RLC configuration), lower layer settings (e.g., modulation and coding scheme), and so on. The higher layer information may include information about which coder/decoder (codec) to use, information about whether to bundle several data streams for a service (e.g., bundle one or more tracks for video), information about metadata for an application layer, etc. The higher layer information may be transparent to the lower layer, and the UE may receive traffic using the higher layer information. The different types of overhead information shown in table 1 may also be referred to as other names. The scheduling information may be dynamic and the configuration information may be semi-static.

The system may support multiple modes of operation for E-MBMS, which may include multi-cell mode and single-cell mode. The multi-cell mode may also be referred to as a multicast/broadcast single frequency network (MBSFN). In the multi-cell mode, traffic content may be transmitted simultaneously over multiple cells. In single cell mode, each cell may transmit traffic content asynchronously with other cells. Different transport channels may be used for multi-cell mode and single cell mode. For example, a Multicast Channel (MCH) may carry the MCCH and MTCH in a multi-cell mode. A downlink shared channel (DL-SCH) may carry MTCH and other logical channels in a single cell mode. The techniques described herein may be used for multi-cell mode and single cell mode.

Fig. 2 shows a design of a transmission scheme 200 for MSCH, MCCH and MTCH. The transmission timeline may be divided into units of scheduling periods. Each scheduling period may cover a predetermined length of time and may include a predetermined number of subframes. Each subframe may include two slots, and each slot may include a predetermined number of symbol periods. In one design, a subframe may cover 1 millisecond (ms) and a scheduling period may cover 500 ms. The subframes and scheduling periods may also cover other lengths of time.

In the design shown in fig. 2, the MSCH may be sent in the first/early part 210 of each scheduling period. The MCCH and MTCH may be transmitted in the second/later part 220 of each scheduling period. As shown in fig. 2, the MSCH may be periodically transmitted in each scheduling period, and may carry scheduling information for the scheduling period. The MCCH may carry configuration information of a service, or may transmit the MCCH in each scheduling period. However, the configuration information may be semi-static and the UE is not required to receive the configuration information in every scheduling period unless there is a change in the configuration information, for example.

The system can support different classes of services. Table 2 lists some classes of traffic supported according to one design.

TABLE 2

Business	Description of the invention
		Advertised service	Traffic that may be transmitted by a cell.
Transmitted service	The traffic being sent by the cell.
		Scheduled service	And scheduling the transmitted service in the current scheduling period.

Fig. 3 illustrates an exemplary venturi diagram 300 for different classes of traffic. Block 310 covers all services that the system is capable of supporting. Block 320 may cover all advertised services, which may be a subset of all services. Block 330 may cover all transmitted traffic, which may include all of the advertised traffic or a subset of the advertised traffic. Block 340 may cover all scheduled traffic being transmitted in the current scheduling period. The scheduled traffic may include all or a subset of the transmitted traffic.

Region 312 may include regions within block 310 but outside block 320. The area 312 may cover non-advertised traffic, which may be system supported but not advertised traffic. Region 322 may include a region within block 320 but outside block 330. The area 322 may cover available services, which are services that are advertised but not transmitted, e.g., due to a lack of interested UEs. If there is sufficient demand for these services, the available services can be sent. Region 332 may include a region within block 330 but outside block 340. Area 332 may cover suspended traffic, which may be traffic that is being transmitted but not scheduled in the current scheduling period. The paused traffic may include carousel traffic that is currently paused between data segments (e.g., traffic that pauses slideshows between slides), low data rate traffic that is sent as widely separated bursts, and so on.

In general, a given service may be (i) advertised or not advertised, (ii) transmitted or not transmitted, and (iii) scheduled or not scheduled. Traffic may be in one of eight possible states formed by two possible values for each of the three categories being advertised, transmitted, and scheduled. Fig. 3 shows four possible states of the traffic. The remaining four possible states are ignored.

Each service may be identified by a long service ID that is unique among all services in the system. The UE and system may use the long service ID to uniquely identify the service. The long service ID may be longer and consume more radio resources to transmit and receive.

Each advertised service may be assigned a short service ID that is unique among all advertised services in a cell or group of cells. The short service ID may be much shorter than the long service ID and the short service ID may be more efficiently used to identify the advertised service. The short service ID may also be referred to as MSCH ID, logical channel ID, etc. The short service ID may be of a suitable length to provide sufficient addressing space for all advertised services. In multi-cell mode, short service IDs may be statically assigned to advertised services on all cells in an MBSFN area, even to cells that are not participating in the transmission of a given service. If these cells start to transmit traffic, then the short service ID of the traffic will be available.

In an aspect, the MSCH may carry scheduling information including a mapping of short service IDs to radio resources for scheduled services in a current scheduling period. Using a short service ID instead of a long service ID may reduce the amount of scheduling information to be transmitted and received, which is beneficial to both the system and the UE.

The mapping of short service IDs to radio resources can be used to determine which services are scheduled and being transmitted in the current scheduling period. The mapping may also be used to determine the radio resources used by each scheduled service. The radio resources for the scheduled traffic may be given in various formats. In one design, the radio resources for each scheduled traffic may include one or more resource blocks. Each resource block may include a predetermined number of subcarriers (e.g., 12 subcarriers) in one slot. The scheduling information may also include other types of information.

Fig. 4 shows an exemplary mapping 410 of long service IDs to short service IDs. In this example, 1 to N (N total) long service IDs for N advertised services may be mapped to a to N (N total) short service IDs, respectively, where N may be any integer value. The mapping 410 may be part of the configuration information sent on the MCCH. The mapping 410 is unique to a cell or group of cells and different for different cells or groups of cells. The mapping 410 may be static or semi-static.

Fig. 4 also shows an exemplary mapping 420 of short service IDs to radio resources for one scheduling period. In this example, M short service IDs a, c, d, … …, M for M scheduled services may be mapped to M radio resources R, respectively₁To R_MWhere M may be any integer value equal to or less than N. The M scheduled services in map 420 may be a subset of the N advertised services in map 410. Map 420 may be a portion of the scheduling information sent on the MSCH on each scheduling period. The mapping 420 is unique to a cell or group of cells and different for different cells or groups of cells. The mapping 420 is dynamic and the mapping 420 is varied between scheduling periods.

The MCCH may carry information identifying the service being advertised. Such information may be referred to as ad service information and may include a list of advertised services or equivalent information. The MSCH may carry information identifying the scheduled traffic. This information may be referred to as scheduled service information and may include a list of scheduled services for the current scheduling period or equivalent information.

The UE may receive the advertisement service information from the MCCH and the scheduling service information from the MSCH. The UE can identify scheduled traffic as well as advertised traffic using the received information. However, the UE does not know whether a given service x is (i) advertised but not transmitted or (ii) transmitted but not scheduled in the current scheduling period. It is desirable to be able to distinguish between scenarios (i) and (ii), which will allow the UE to take appropriate action. For case (i), if the service x is advertised but not transmitted, the UE may transmit a request for service x. For case (ii), if the traffic x has already been transmitted but is not scheduled in the current scheduling period, the UE may simply wait for the scheduling of traffic x.

In another aspect, information may be sent to convey whether traffic is sent or not sent. Such information may be referred to as transmission traffic information, and such information may be provided in various ways.

In one design, the send traffic information may include an indication of each advertised traffic. In one design, the indication for advertised traffic may be an explicit flag, e.g., the flag may be set to "1" to indicate that traffic is being sent, or set to "0" to indicate that traffic is not being sent.

In another design, the transmit traffic information may be provided implicitly by some other information, such as the construction of a message or the presence of bearer information. For example, if bearer information of a service is transmitted on the MCCH, the service may be considered as being transmitted, and if the bearer information is not transmitted on the MCCH, the service may be considered as not being transmitted. Traffic may also be considered as being sent or not sent based on the presence or absence of some other information than bearer information, respectively.

In yet another design, the transmit traffic information may include a message carrying a list of transmitted traffic. Each advertised service may be assigned a short service ID as described above. The message may carry a list of short service IDs of the services being sent.

The UE may use the transmit traffic information to determine whether to transmit a request for a service of interest to the UE. If the transmit traffic information indicates that the cell is not transmitting the traffic, the UE may transmit a traffic request to the cell to indicate an interest in the traffic. A service request may be used to trigger the sending of the service. Conversely, if the transmit traffic information indicates that the traffic is being transmitted, the UE may avoid transmitting an unnecessary traffic request, which may waste resources.

In one design, separate messages may be sent for the sent traffic and the advertised but unsent traffic. For example, the transmitted service may be identified in an MBMS TRANSMITTED SERVICES message. The advertised but unsent traffic may be identified in the MBMS ADVERTISED SERVICES message. The messages may be sent in either order. Sending separate messages for the transmitted traffic and the advertised but not transmitted traffic may allow the UE to terminate reading of the MCCH early. For example, if the UE determines that all services of interest to the UE are identified in the first message, then the UE may skip reading the second message. For example, if the UE determines that no traffic of interest to the UE is transmitted in the current scheduling period, the UE may also skip the rest of the scheduling period.

Fig. 5 shows a design of a transmission scheme 500 for transmitting data and overhead information for traffic. At a time T before the scheduling period T₀The UE decides that it is interested in receiving service x. At a time T at the beginning of the scheduling period T₁The UE may receive the MSCH, obtain scheduling information for the scheduling period t, and determine radio resources for the MCCH. The MCCH may be assigned a predetermined short service ID (e.g., short service ID 0) that all UEs may know a priori. At time T₂The UE may receive the MCCH and obtain status information, which may include information identifying the transmitted service and information identifying the advertised but not transmitted service. The UE may determine from the status information that service x is advertised but not transmitted. At time T₃The UE may send a request for service x to the cell. The cell may receive a service request from the UE and may decide to start sending service x.

At time T at the beginning of scheduling period T +1₄The UE may receive the MSCH, obtain scheduling information for the scheduling period t +1, and determine radio resources for the MCCH. At time T₅The UE may receive the MCCH and obtain the status information and configuration information of service x. The status information may indicate that service x is being transmitted by the cell. The configuration information may include all information required to receive the service x from the MTCH. In one design, configuration informationThe information may include the short service ID of service x, bearer information of service x, and possibly other information. The UE may now have all relevant information to receive service x.

At time T at the beginning of scheduling period T +2₆The UE may receive the MSCH, obtain scheduling information for scheduling period t +2, and determine the radio resources used by MTCH for traffic x in the scheduling period. At time T₇The UE may receive data of traffic x from the MTCH.

In the design shown in fig. 5, the MCCH and MTCH may be transmitted in any order during the scheduling period. In this design, configuration information for service x may be sent on MCCH first in scheduling period t + 1. The data for traffic x may then be transmitted on the MTCH in the next scheduling period t + 2. The UE may receive configuration information of the service x in the scheduling period t +1 and may receive data of the service x in the scheduling period t +2 using the configuration information. In this design, there is a delay of an additional scheduling period at the beginning of traffic x.

In another design not shown in fig. 5, the MCCH may be transmitted before the MTCH is transmitted in a scheduling period. In this design, the configuration information for service x may be sent on MCCH in scheduling period t + 1. Data of the traffic x may be transmitted on the MTCH in the same scheduling period t +1 after the configuration information is transmitted. The UE may first receive configuration information of service x from the MCCH in a scheduling period t + 1. The UE may then receive data of traffic x from the MTCH in the same scheduling period t + 1.

In yet another aspect, configuration information for advertised services may be transmitted even when such services are not being transmitted. As described below, this design may reduce the delay in starting traffic. Further, the configuration information may allow the UE to make informed decisions about resource allocation and potential conflicts when deciding whether to receive a given service.

Fig. 6 shows a design of a transmission scheme 600 for transmitting data and overhead information for traffic. At a time T before the scheduling period T₀The UE can decide it is toThe receiving service x is of interest. At a time T at the beginning of the scheduling period T₁The UE may receive the MSCH, obtain scheduling information for the scheduling period t, and determine radio resources for the MCCH. At time T₂The UE may receive the MCCH, obtain the status information and determine that service x is advertised but not transmitted. The MCCH may carry configuration information for all advertised services, and the UE may receive configuration information for service x from the MCCH during a scheduling period t. At time T₃The UE may send a request for service x to the cell. The cell may receive a service request from the UE and may decide to start sending service x.

At time T at the beginning of scheduling period T +1₄The UE may receive the MSCH, obtain scheduling information for scheduling period t +1, and determine the radio resources used by MTCH for traffic x in the scheduling period. At time T₅The UE receives data of the service x from the MCCH based on the configuration information of the service x received from the MCCH in the previous scheduling period t. The UE does not need to receive the time T in the scheduling period T +1₆The MCCH transmitted.

In the scheduling period t +1, the MCCH may carry status information indicating that the service x is being transmitted. Other UEs may use this state information to receive service x. Another UE interested in receiving service x may be at time T₄Receiving MSCH at time T₆Receiving the MCCH and determining that service x is transmitted. The UE may obtain configuration information of service x from the MCCH in scheduling period t + 1. The UE may then receive the MSCH in the next scheduling period t +2, determine the radio resources used by the MTCH for traffic x, and receive data for traffic x based on the configuration information received in scheduling period t + 1. Or, the UE may buffer the samples of the scheduling period t +1, receive the MSCH and the MCCH, determine that the service x is transmitted, and obtain the configuration information of the service x. The UE may then read the MSCH again, determine the radio resources used by the MTCH for traffic x in the scheduling period t +1, and then receive the data for traffic x based on the configuration information received in the scheduling period.

The design in fig. 6 allows the UE to start receiving the requested service in the first scheduling period after sending the service request. This may be achieved by sending configuration information for the advertised service in each symbol period. The configuration information for each advertised service can then be used in the next scheduling period, if desired.

The efficient reception of the service by the UE can be realized by:

transmitting scheduling information on the MSCH, the scheduling information comprising a mapping of short service IDs to radio resources for scheduled traffic in a current scheduling period;

sending a mapping of long service ID to short service ID of advertised services on MCCH;

sending status information on MCCH identifying the sent traffic and the advertised but not sent traffic, e.g. in the form of separate messages; and

transmitting configuration information of the advertised service on the MCCH, including configuration information of the advertised service that is not transmitted.

With the above features, the service request process is uncomplicated and efficient. A UE interested in a given advertised but unsent service may send a service request and may immediately start monitoring the MSCH for the short service ID of that service. The cell may move the service from the list of advertised but unsent services to the list of transmitted services on MCCH. This change is mainly in favor of other UEs reaching the cell. The UE making the service request already knows to start monitoring the MSCH for the short service ID of the requested service.

Fig. 7 shows a design of a process 700 for transmitting broadcast and multicast traffic in a wireless communication system. Process 700 may be performed by a transmitter, such as a node B, or some other entity. The transmitter may send configuration information including a mapping of long service IDs to short service IDs for advertised services (block 712). The transmitter may transmit scheduling information including a mapping of short service IDs to radio resources for scheduled services in the current scheduling period (block 714). The transmitter may transmit data for the scheduled service on the radio resources indicated in the mapping of short service IDs to radio resources (block 716). A long service ID may be used to identify all supported services in the system. The short service ID in the scheduling information may be used to identify the scheduled service. The advertised services may be a subset of supported services and the scheduled services may be a subset of advertised services. The transmitter may send scheduling information on a scheduling channel, configuration information on a control channel, and data for the scheduled service on a traffic channel.

Fig. 8 shows a design of an apparatus 800 for transmitting broadcast and multicast traffic in a wireless communication system. The apparatus 800 comprises: a module 812 for sending configuration information including a mapping of long service IDs to short service IDs for advertised services; a module 814 for transmitting scheduling information including a mapping of short service IDs to radio resources for scheduled services in a current scheduling period; and a module 816 for transmitting data of the scheduled service on the radio resources indicated in the mapping of short service IDs to radio resources.

Fig. 9 shows a design of a process 900 for receiving broadcast and multicast traffic in a wireless communication system. Process 900 may be performed by a receiver, such as a UE, or some other entity. The receiver may receive configuration information including a mapping of long service IDs to short service IDs for advertised services (block 912). The receiver may determine a short service ID for the selected service based on the mapping of long service IDs to short service IDs (block 914).

The receiver may receive scheduling information including a mapping of short service IDs to radio resources for scheduled services in a current scheduling period (block 916). The receiver may determine whether the selected service is scheduled in the current scheduling period based on the short service ID of the selected service and the scheduling information. The receiver may identify the selected service among the scheduled services in the current scheduling period (block 918). The receiver may determine radio resources for the selected service based on the mapping of short service IDs to radio resources (block 920). The receiver may then receive data for the selected service from the radio resources used by the selected service (block 922).

The receiver may perform blocks 912 and 914 in one scheduling period and may perform blocks 916 through 922 in another scheduling period. The receiver may receive scheduling information from a scheduling channel, configuration information from a control channel, and data for a selected service from a traffic channel.

Fig. 10 shows a design of an apparatus 1000 for receiving broadcast and multicast services in a wireless communication system. The apparatus 1000 comprises: a module 1012 for receiving configuration information including a mapping of long service IDs to short service IDs for advertised services; a module 1014 for determining a short service ID for the selected service based on the mapping of long service ID to short service ID; a module 1016 for receiving scheduling information including a mapping of short service IDs to radio resources for scheduled services in a current scheduling period; a module 1018 for identifying a selected service among scheduled services in a current scheduling period; a module 1020 for determining radio resources for the selected service based on the mapping of short service IDs to radio resources; and a module 1022 for receiving data of the selected service from the radio resource used by the selected service.

Fig. 11 shows a design of a process 1100 for transmitting broadcast and multicast traffic in a wireless communication system. Process 1100 may be performed by a transmitter, such as a node B, or some other entity. The transmitter may maintain at least one list of services being transmitted and services being advertised but not transmitted (block 1112). The transmitter may transmit information identifying the traffic being transmitted and the traffic being advertised but not transmitted (block 1114). In one design, the transmitter may set an indication for each advertised service to indicate whether the advertised service is transmitted or not transmitted. The transmitter may then generate information to include an indication of all advertised services. In one design, a transmitter may generate a first message that includes information identifying a service being transmitted. The transmitter may also generate a second message that includes information identifying the service being advertised but not transmitted. The transmitter may then transmit the first message and the second message.

The transmitter may also transmit information identifying the traffic being advertised and information identifying the traffic scheduled for transmission in the current scheduling period. The traffic being advertised may include traffic being transmitted as well as traffic being advertised but not transmitted. The traffic being transmitted may include traffic scheduled for transmission.

The transmitter may receive a request for a service that is being advertised but not transmitted (block 1116). The transmitter may begin transmitting the requested service (block 1118). The transmitter may update at least one list of services being transmitted and services being advertised but not transmitted to reflect that the requested service was transmitted (block 1120). The transmitter may transmit update information identifying the traffic being transmitted and the traffic being advertised but not transmitted (block 1122).

Fig. 12 shows a design of an apparatus 1200 for transmitting broadcast and multicast traffic in a wireless communication system. The apparatus 1200 comprises: a module 1212 for maintaining at least one list of services being transmitted and services being advertised but not transmitted; a module 1214 for transmitting information identifying the traffic being transmitted and the traffic being advertised but not transmitted; a module 1216 for receiving a request for traffic that is being advertised but not sent; a module 1218 for initiating transmission of the requested service; a module for updating at least one list of services being transmitted and services being advertised but not transmitted to reflect that the requested service was transmitted 1220; and a module 1222 for sending update information identifying the traffic being sent and the traffic being advertised but not sent.

Fig. 13 shows a design of a process 1300 for receiving broadcast and multicast traffic in a wireless communication system. Process 1300 may be performed by a receiver, such as a UE, or some other entity. The receiver may receive information identifying the traffic being transmitted and the traffic being advertised but not transmitted (block 1312). The receiver may determine whether the selected service is transmitted or advertised but not transmitted based on the received information (block 1314). If the selected service is advertised but not transmitted, the receiver may transmit a request for the selected service (block 1316).

In one design, the receiver may obtain an indication of the advertised service from the received information. The indication of each advertised service may indicate whether the advertised service is transmitted or not transmitted. The receiver may then determine whether the selected service is transmitted or advertised but not transmitted based on the indication of the selected service. In one design, a receiver may receive a first message that includes information identifying a service being transmitted. The receiver may determine whether the selected service is among the services being transmitted. If the selected service is not among the services being transmitted, the receiver may receive a second message including information identifying the services being advertised but not transmitted. In another design, the receiver may receive a second message that includes information identifying a service that is being advertised but not transmitted. The receiver may determine whether the selected service is among the services being advertised but not transmitted. If the selected service is not among the services being advertised but not transmitted, the receiver may receive a first message including information identifying the service being transmitted. In any case, the receiver may receive one message at a time, and may terminate early if the selected service is found in the received message.

Fig. 14 shows a design of an apparatus 1400 for receiving broadcast and multicast services in a wireless communication system. The apparatus 1400 comprises: a module 1412 for receiving information identifying the traffic being transmitted and the traffic being advertised but not transmitted; a module 1414 for determining whether the selected service is transmitted or advertised but not transmitted based on the received information; and a module 1416 for sending a request for the selected service if the selected service is advertised but not sent.

Fig. 15 shows a design of a process 1500 for transmitting broadcast and multicast traffic in a wireless communication system. Process 1500 may be performed by a transmitter, such as a node B, or some other entity. The transmitter may send status information identifying the service being advertised (block 1512). The transmitter may generate configuration information (e.g., including service ID and bearer information) for each service being advertised but not transmitted (block 1514). If the traffic is transmitted, the traffic may be received using bearer information of each traffic. The transmitter may send configuration information for the traffic being advertised but not sent (block 1516).

The transmitter may receive a request for traffic that is being advertised but not transmitted in a first scheduling period (block 1518). The transmitter may begin transmitting the requested traffic in a second scheduling period, e.g., immediately after the first scheduling period (block 1520).

Fig. 16 shows a design of an apparatus 1600 for transmitting broadcast and multicast traffic in a wireless communication system. The apparatus 1600 includes: a module 1612 for sending status information identifying the traffic being advertised; a module 1614 for generating configuration information for each service being advertised but not transmitted; a module 1616 for sending configuration information for traffic being advertised but not sent; a module 1618 for receiving a request for traffic that is being advertised but not transmitted in a first scheduling period; and a module 1620 for starting sending the requested service in a second scheduling period, e.g. immediately after the first scheduling period.

Fig. 17 shows a design of a process 1700 for receiving broadcast and multicast traffic in a wireless communication system. Process 1700 may be performed by a receiver, such as a UE, or some other entity. The receiver may receive configuration information for the selected service being advertised but not transmitted in a first scheduling period (block 1712). The receiver may obtain the service ID and bearer information for the selected service from the configuration information (block 1714). The receiver may send a request for the selected service in a first scheduling period (block 1716).

The receiver may receive scheduling information for a second scheduling period, which immediately follows the first scheduling period (block 1718). The receiver may determine radio resources for the selected service in the second scheduling period based on the service ID of the selected service and the scheduling information (block 1720). The receiver may then receive data for the selected service in a second scheduling period based on the configuration information received in the first scheduling period (block 1722). The receiver may then receive data for the selected service from the radio resources for the selected service and based on the bearer information.

Fig. 18 shows a design of an apparatus 1800 for receiving broadcast and multicast services in a wireless communication system. The apparatus 1800 includes: a module 1812 for receiving configuration information of a selected service being advertised but not transmitted in a first scheduling period; a module 1814 for obtaining the service ID and bearer information of the selected service from the configuration information; a module 1816 for transmitting a request for the selected service in a first scheduling period; a module 1818 for receiving scheduling information for a second scheduling period, the second scheduling period immediately following the first scheduling period; a module 1820 for determining radio resources for the selected service in the second scheduling period based on the service ID of the selected service and the scheduling information; and a module 1822 for receiving data of the selected service in a second scheduling period based on the configuration information received in the first scheduling period.

The modules in fig. 8, 10, 12, 14, 16, and 18 may comprise processors, electronics devices, hardware devices, electronics components, logic circuits, memories, etc., or any combination thereof.

Fig. 19 shows a block diagram of a design of node B110 and UE 120, where node B110 and UE 120 may be one of the node bs and one of the UEs in fig. 1. In this design, node B110 is equipped with T antennas 1934a through 1934nt and UE 120 is equipped with R antennas 1952a through 1952R, where typically T ≧ 1 and R ≧ 1.

At the node B110, a transmit processor 1920 may receive data for broadcast, multicast, and/or unicast traffic from a data source 1912. Transmit processor 1920 may process the data for each service to obtain data symbols. Transmit processor 1920 may also receive scheduling information, configuration information, and/or other overhead information from controller/processor 1940 and/or scheduler 1944. Transmit processor 1920 may process the overhead information and provide overhead symbols. A Transmit (TX) multiple-input multiple-output (MIMO) processor 1930 may multiplex the data symbols and overhead symbols with pilot symbols, process (e.g., precode) the multiplexed symbols, and provide T output symbol streams to T Modulators (MODs) 1932a through 1932T. Each modulator 1932 may process a respective output symbol stream (e.g., for OFDM) to obtain an output sample stream. Each modulator 1932 may also process (e.g., convert to analog, amplify, filter, and upconvert) the output sample stream to obtain a downlink signal. T downlink signals may be transmitted from modulators 1932a through 1932T via T antennas 1934a through 1934T, respectively.

At UE 120, antennas 1952a through 1952r may receive the downlink signals from node B110 and provide received signals to demodulators (DEMODs) 1954a through 1954r, respectively. Each demodulator 1954 may condition (e.g., filter, amplify, downconvert, and digitize) a respective received signal to obtain received samples, and may further process the received samples (e.g., for OFDM) to obtain received symbols. A MIMO detector 1960 may receive and process the received symbols from all R demodulators 1954a through 1954R and provide detected symbols. A receive processor 1970 may process the detected symbols, provide decoded data for the service of interest to a data receive apparatus 1972, and provide decoded overhead information to a controller/processor 1990. In general, the processing by MIMO detector 1960 and receive processor 1970 is complementary to the processing by TX MIMO processor 1930 and transmit processor 1920 at node B110.

On the uplink, at UE 120, data from a data source 1978 and control information (e.g., requests for traffic) from controller/processor 1990 may be processed by a transmit processor 1980, precoded by a TX MIMO processor 1982 (if applicable), conditioned by modulators 1954a through 1954r, and transmitted via antennas 1952a through 1952 r. At node B110, the uplink signals from UE 120 may be received by antennas 1934, conditioned by demodulators 1932, detected by a MIMO detector 1936, and processed by a receive processor 1938 to obtain the data and overhead information transmitted by UE 120.

Controllers/processors 1940 and 1990 may direct operation at node B110 and UE 120, respectively. Controller/processor 1940 may implement or direct process 700 in fig. 7, process 1100 in fig. 11, process 1500 in fig. 15, and/or other processes for the techniques described herein. Controller/processor 1990 may implement or direct process 900 in fig. 9, process 1300 in fig. 13, process 1700 in fig. 17, and/or other processes for the techniques described herein. Memories 1942 and 1992 may store data and program codes for node B110 and UE 120, respectively. A scheduler 1944 may schedule UEs for downlink and/or uplink transmission, schedule transmission of broadcast and multicast traffic, and provide radio resource allocation for the scheduled UEs and traffic. Controller/processor 1940 and/or scheduler 1944 may generate scheduling information and/or overhead information for broadcast and multicast traffic.

Those of skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.

Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

The various illustrative logical blocks, modules, and circuits described in connection with the disclosure may be implemented or performed with a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

The steps of a method or algorithm described in connection with the disclosure herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.

In one or more exemplary designs, the functions may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media is any available media that can be accessed by a general purpose or special purpose computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store desired program code segments in the form of instructions or data structures and which can be accessed by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, Digital Subscriber Line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. As used herein, disc or disc includes Compact Disc (CD), laser disc, optical disc, Digital Versatile Disc (DVD), floppy disc and blu-ray disc where discs usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

The previous description of the invention is provided to enable any person skilled in the art to make or use the invention. Various modifications to the disclosure will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other variations without departing from the spirit or scope of the disclosure. Thus, the present invention is not intended to be limited to the examples and designs described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (44)

1. A method for wireless communication, comprising:

transmitting scheduling information including a first mapping of short service Identifiers (IDs) for scheduled services to radio resources in a current scheduling period; and

transmitting data of the scheduled traffic on the radio resources indicated in the first mapping.

2. The method of claim 1, further comprising:

sending configuration information comprising a second mapping of long service IDs to short service IDs for advertised services, wherein short service IDs in the second mapping comprise short service IDs in the first mapping.

3. The method of claim 2, wherein all supported services are identified using the long service ID, wherein the scheduled services are identified using the short service ID in the scheduling information, wherein the advertised services are a subset of supported services, and wherein the scheduled services are a subset of the advertised services.

4. The method of claim 2, wherein transmitting the scheduling information comprises transmitting the scheduling information on a scheduling channel, wherein transmitting the configuration information comprises transmitting the configuration information on a control channel, and wherein transmitting the data comprises transmitting data for the scheduled traffic on a traffic channel.

5. An apparatus for wireless communication, comprising:

at least one processor configured to transmit scheduling information comprising a first mapping of short service Identifiers (IDs) for scheduled traffic to radio resources in a current scheduling period, and to transmit data of the scheduled traffic on the radio resources indicated in the first mapping.

6. The apparatus of claim 5, wherein the at least one processor is configured to send configuration information comprising a second mapping of long service IDs to short service IDs for advertised services, and wherein short service IDs in the second mapping comprise short service IDs in the first mapping.

7. An apparatus for wireless communication, comprising:

means for transmitting scheduling information including a first mapping of short service Identifiers (IDs) for scheduled services to radio resources in a current scheduling period; and

means for transmitting data of the scheduled traffic on the radio resources indicated in the first mapping.

8. The apparatus of claim 7, further comprising:

means for transmitting configuration information including a second mapping of long service IDs to short service IDs for advertised services, wherein short service IDs in the second mapping include short service IDs in the first mapping.

9. A computer program product, comprising:

a computer-readable medium comprising:

code for causing at least one computer to transmit scheduling information comprising a first mapping of short service Identifiers (IDs) to radio resources for scheduled services in a current scheduling period; and

code for causing the at least one computer to transmit data of the scheduled traffic on the radio resources indicated in the first mapping.

10. The computer program product of claim 9, the computer-readable medium further comprising:

code for causing the at least one computer to transmit configuration information comprising a second mapping of long service IDs to short service IDs for advertised services, wherein short service IDs in the second mapping comprise short service IDs in the first mapping.

11. A method for wireless communication, comprising:

receiving scheduling information including a first mapping of short service Identifiers (IDs) to radio resources for scheduled services in a current scheduling period;

identifying a selected service among the scheduled services in the current scheduling period;

determining radio resources for the selected service based on the first mapping; and

receiving data of the selected service from the radio resource for the selected service.

12. The method of claim 11, further comprising:

receiving configuration information, the configuration information comprising a second mapping of long service IDs to short service IDs of advertised services;

determining a short service ID for the selected service based on the second mapping; and

determining whether the selected service is scheduled in a current scheduling period based on the short service ID of the selected service and the scheduling information.

13. The method of claim 12, wherein receiving the scheduling information comprises receiving the scheduling information from a scheduling channel, wherein receiving the configuration information comprises receiving the configuration information from a control channel, and wherein receiving the data comprises receiving data for the selected service from a traffic channel.

14. An apparatus for wireless communication, comprising:

at least one processor configured to:

receiving scheduling information including a first mapping of short service Identifiers (IDs) to radio resources for scheduled services in a current scheduling period;

identifying a selected service among the scheduled services in the current scheduling period;

determining radio resources for the selected service based on the first mapping; and

receiving data of the selected service from the radio resource for the selected service.

15. The apparatus of claim 14, wherein the at least one processor is configured to:

receiving configuration information, the configuration information comprising a second mapping of long service IDs to short service IDs of advertised services;

determining a short service ID for the selected service based on the second mapping; and

determining whether the selected service is scheduled in a current scheduling period based on the short service ID of the selected service and the scheduling information.

16. A method for wireless communication, comprising:

maintaining at least one list of services being transmitted and services being advertised but not transmitted; and

transmitting information identifying the traffic being transmitted and the traffic being advertised but not transmitted.

17. The method of claim 16, further comprising:

generating a first message including information identifying the service being transmitted; and

generating a second message comprising information identifying the service being advertised but not transmitted, and wherein transmitting the information comprises transmitting the first message and the second message.

18. The method of claim 16, further comprising:

setting an indication for each advertised service to indicate whether the advertised service is transmitted or not transmitted; and

information is generated that includes an indication of all advertised services.

19. The method of claim 16, further comprising:

receiving a request for a service that is being advertised but not transmitted;

starting to transmit the requested service; and

updating the at least one list of the services being transmitted and the services being advertised but not transmitted to reflect that the requested service was transmitted.

20. The method of claim 16, further comprising:

transmitting information identifying a service being advertised, wherein the service being advertised includes the service being transmitted and the service being advertised but not transmitted.

21. The method of claim 16, further comprising:

and transmitting information for identifying the service scheduled to be transmitted in the current scheduling period, wherein the service being transmitted comprises the service scheduled to be transmitted.

22. An apparatus for wireless communication, comprising:

at least one processor configured to maintain at least one list of services being transmitted and services being advertised but not transmitted, and to transmit information identifying the services being transmitted and the services being advertised but not transmitted.

23. The apparatus of claim 22, wherein the at least one processor is configured to:

generating a first message including information identifying the service being transmitted;

generating a second message comprising information identifying the service being advertised but not transmitted; and

and sending the first message and the second message.

24. The apparatus of claim 22, wherein the at least one processor is configured to:

setting an indication for each advertised service to indicate whether the advertised service is transmitted or not transmitted; and

information is generated that includes an indication of all advertised services.

25. The apparatus of claim 22, wherein the at least one processor is configured to:

receiving a request for a service that is being advertised but not transmitted;

starting to transmit the requested service; and

updating the at least one list of the services being transmitted and the services being advertised but not transmitted to reflect that the requested service was transmitted.

26. A method for wireless communication, comprising:

receiving information identifying the traffic being transmitted and the traffic being advertised but not transmitted;

determining whether the selected service is transmitted or advertised but not transmitted based on the received information; and

if the selected service is advertised but not transmitted, a request for the selected service is transmitted.

27. The method of claim 26, wherein the receiving and the determining comprise:

receiving a first message including information identifying the service being transmitted,

determining whether the selected service is among the services being transmitted, and

receiving a second message including information identifying the service being advertised but not transmitted if the selected service is not among the services being transmitted.

28. The method of claim 26, wherein the receiving and the determining comprise receiving and determining comprise receiving a message from a mobile device

Receiving a first message comprising information identifying the service being advertised but not transmitted,

determining whether the selected service is among the advertised but unsent services, and

receiving a second message including information identifying the service being transmitted if the selected service is not among the services being advertised but not transmitted.

29. The method of claim 26, further comprising:

obtaining, from the received information, an indication of each advertised service indicating whether the advertised service was transmitted or not transmitted.

30. An apparatus for wireless communication, comprising:

at least one processor configured to:

receiving information identifying the traffic being transmitted and the traffic being advertised but not transmitted;

determining whether the selected service is transmitted or advertised but not transmitted based on the received information; and

if the selected service is advertised but not transmitted, a request for the selected service is transmitted.

31. The apparatus of claim 30, wherein the at least one processor is configured to:

receiving a first message including information identifying the service being transmitted,

determining whether the selected service is among the services being transmitted, and

receiving a second message including information identifying the service being advertised but not transmitted if the selected service is not among the services being transmitted.

32. The apparatus of claim 30, wherein the at least one processor is configured to obtain, from the received information, an indication of each advertised service that indicates whether the advertised service is sent or not sent.

33. A method for wireless communication, comprising:

sending status information identifying the service being advertised; and

configuration information for traffic being advertised but not transmitted is transmitted.

34. The method of claim 33, further comprising:

the configuration information is generated to include a service Identifier (ID) and bearer information for each service being advertised but not transmitted, the bearer information being used to receive the service if transmitted.

35. The method of claim 33, further comprising:

receiving a request for a service being advertised but not transmitted in a first scheduling period; and

transmitting the requested service is started in a second scheduling period immediately after the first scheduling period.

36. An apparatus for wireless communication, comprising:

at least one processor configured to transmit status information identifying a service being advertised and configured to transmit configuration information for a service being advertised but not transmitted.

37. The apparatus of claim 36, wherein the at least one processor is configured to generate the configuration information to include a service Identifier (ID) and bearer information for each service being advertised but not transmitted, the bearer information being used to receive the service if transmitted.

38. The apparatus of claim 36, wherein the at least one processor is configured to receive a request for traffic being advertised but not transmitted in a first scheduling period, and to begin transmitting the requested traffic in a second scheduling period immediately following the first scheduling period.

39. A method for wireless communication, comprising:

receiving configuration information of a selected service being advertised but not transmitted in a first scheduling period; and

receiving data of the selected service in a second scheduling period based on the configuration information received in the first scheduling period.

40. The method of claim 39, further comprising:

obtaining a service Identifier (ID) and bearer information of the selected service from the configuration information;

receiving scheduling information of the second scheduling period; and

determining radio resources for the selected service in the second scheduling period based on the service ID of the selected service and the scheduling information, and

wherein receiving the data comprises receiving data for the selected service from radio resources for the selected service and based on the bearer information.

41. The method of claim 39, further comprising:

receiving status information indicating the selected traffic being advertised but not transmitted in the first scheduling period; and

transmitting a request for the selected service in the first scheduling period.

42. An apparatus for wireless communication, comprising:

at least one processor configured to receive configuration information of a selected service being advertised but not transmitted in a first scheduling period, and configured to receive data of the selected service in a second scheduling period based on the configuration information received in the first scheduling period.

43. The apparatus of claim 42, wherein the at least one processor is configured to:

obtaining a service Identifier (ID) and bearer information of the selected service from the configuration information;

receiving scheduling information of the second scheduling period;

determining radio resources for the selected service in the second scheduling period based on the service ID of the selected service and the scheduling information; and

receiving data of the selected service from radio resources for the selected service and based on the bearer information.

44. The apparatus of claim 42, wherein the at least one processor is configured to receive status information indicating selected traffic being advertised but not transmitted in the first scheduling period, and to transmit a request for the selected traffic in the first scheduling period.