Method and system for reducing message instances

CROSS REFERENCE TO RELATED APPLICATION

P-0001[0001] This application claims priority from U.S. Provisional Application No. 60/378,718, filed on May 6, 2002, which is incorporated by reference as if fully set forth.

FIELD OF INVENTION

P-0002[0002] The present invention relates to the field of wireless communications. More particularly, the present invention relates to messaging within wireless transmission systems.

BACKGROUND

P-0003[0003] Messaging is an expanding part of wireless transmission systems. The prior art, however, fails to make efficient use of scarce radio resources with respect to the transmission of messages.

P-0004[0004] In the case of general broadcasts, messages are transmitted at a specific time, on a specific channel, with a specific channelization code. Broadcast messages are only retransmitted if there is a problem with the robustness of delivery or timing (i.e., devices typically want to receive a message while being in the right place at the right time). Broadcast messages, however, are often transmitted over large geographical regions and therefore encompass a large number of cells. For this reason, broadcasting messages is only efficient where there will be a large number of users receiving the message.

P-0005[0005] Multicasting, where messages are sent to a predetermined number of users, involves limited receivers and selective transmissions to each of the targeted receivers. In contrast to a broadcast message which is transmitted over large geographical regions, with multicasting, multiple instances of the same data (i.e., message) are transmitted, but only to the devices of the target group. Despite being more efficient than broadcasting, transmitting multiple instances of the same message is not an efficient use of radio resources. That is, with prior art multicast transmissions, messages and their associated pointers have a one-to-one correspondence which leads to multiple transmissions of the same message.

P-0006[0006] Another approach is to assign a group identifier to a number of devices. The group identifier reduces one-to-one correspondence between messages and pointers and allows a single instance of a message to be received by each device having the assigned identifier. The group identifier approach, however, is efficient only where there is prior knowledge of the devices that should form the group and the group identifier is expected to be used a number of times over a period of time. Moreover, since the group identifier must be established in the devices via offline or online programming, it is not an efficient means of ad hoc (ad hoc with respect to at least the wireless network) message delivery. That is, a group page from an email source may indeed be a repeating group, but the RF network will not have a priori knowledge of the repeating group.

P-0007[0007] Accordingly, a method and system is needed wherein a single message instance may be used for multiple recipients of the same message.

SUMMARY

P-0008[0008] The present invention is a method and system for transmitting messages with reduced message instances. A determination is made as to whether there are multiple WTRUs identified for receipt of the same message. If so, a single instance of the message may be transmitted for all of the receiving WTRUs.

BRIEF DESCRIPTION OF THE DRAWING(S)

P-0009[0009]FIG. 1 is a diagram illustrating a framed time sequence having a one-to-one correspondence between messages and pointers for a plurality of WTRUs receiving the same message in accordance with the prior art.

P-0010[0010]FIG. 2 is a diagram showing a mobile network in which multiple WTRUs receive messages in accordance with the present invention.

P-0011[0011]FIG. 3 is a diagram illustrating a framed time sequence wherein only a single instance of a message is transmitted despite the message being identified for delivery to a plurality of destination identifiers in accordance with the present invention.

P-0012[0012]FIG. 4 is a diagram for more efficiently processing destination identifiers and pointers contained within a framed time sequence.

P-0013[0013]FIG. 5 is a variation of the diagram shown in FIG. 4 wherein messages are included directly in the SIBs.

P-0014[0014]FIG. 6 is a flow chart illustrating method steps implemented by a message arrival analysis routine in accordance with a preferred embodiment of the present invention.

P-0015[0015]FIG. 7 is a flow chart illustrating method steps for periodically checking to see if there is a recipient list that has been in a multicast queue past a predetermined hold time in accordance with a preferred embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

P-0016[0016] The present invention will be described with reference to the drawing figures wherein like numerals represent like elements throughout. For purposes of describing the invention, a wireless transmit/receive unit (WTRU) may have a transmit-only, a receive-only or a transmit and receive capability. An example would be a standard pager, which can receive but not transmit messages. In the present invention, a receive ability is important to the receipt of messages, in which case the particular unit would have at least a wireless receive function. On the other hand, a WTRU capable of both transmission and reception can generally be used to receive one-way messages. Therefore, for purposes of describing the invention, a WTRU may be any device capable of receiving and/or transmitting data in a wireless environment.

P-0017[0017] Referring now to FIG. 1, a diagram illustrating the manner in which multicast messages are transmitted according to the prior art is shown. In FIG. 1 a plurality of WTRUs <b>2</b>, <b>4</b>, <b>5</b> are identified, using unique destination identifiers, for receipt of the same message, message <b>1</b>. In the prior art, a separate instance of the message <b>1</b> is provided for each WTRU (see WTRU <b>2</b> and pointer <b>6</b>, WTRU <b>4</b> and pointer <b>8</b>, and WTRU <b>5</b> and pointer <b>9</b>). Consequently, in FIG. 1, there is a one-to-one correspondence between messages and pointers.

P-0018[0018] According to the present invention, however, destination identifiers are coordinated so that only a single instance of a message is used where the same message is being sent to more than one destination identifier (i.e. to more than one WTRU(s), depending on whether the destination identifier is associated with a single WTRU or a plurality of WTRUs).

P-0019[0019] Referring now to FIG. 2, a mobile network <b>11</b> is shown. The mobile network <b>11</b> includes multiple base stations <b>12</b>, <b>13</b> which are responsive to a radio network controller (RNC) <b>14</b>, through one or more Node Bs <b>15</b>. A plurality of WTRUs <b>21</b>-<b>24</b> receive messages transmitted from the network. The base stations <b>12</b>, <b>13</b> transmit and receive signals via antennas <b>27</b>. The WTRUs <b>21</b>-<b>24</b> have receivers or transceivers which receive the signals from the base stations <b>12</b>, <b>13</b> (e.g., via antenna <b>28</b> of WTRU <b>21</b>).

P-0020[0020] The WTRUs <b>21</b>-<b>24</b> can be any of a number of devices supported by the system, such as a cell phone, pager, Blackberry™ device, or a computer with a modem connection. The base stations <b>12</b>, <b>13</b> are controlled by RNC <b>14</b>, which performs various network supervisory and communications functions. The base stations <b>12</b>, <b>13</b> provide transmit functions and signals that are transmitted to the WTRUs <b>21</b>-<b>24</b> within a respective cell or transmission area. A receive function is provided by each WTRU's RF stage in order to receive signals transmitted by the base stations <b>12</b>, <b>13</b>. In the case of two-way devices, each WTRU has both transmit and receive functions, permitting the WTRUs <b>21</b>-<b>24</b> to transmit data in an uplink and receive data in a downlink.

P-0021[0021] Where the network detects a single message identified for delivery to a plurality of WTRUs, say, for example, WTRUs <b>21</b> and <b>22</b>, the network will refrain from transmitting a plurality of instances of the same message. Instead, WTRUs <b>21</b> and <b>22</b> will be provided with message pointers that point to the same message. Each message pointer specifies a particular physical channel and time on/at which the message will be available.

P-0022[0022] The network may detect such occurrences by evaluating a recipient list of a particular message and determining whether there are multiple WTRUs identified for receipt of a single message. WTRUs identified as being identified for receipt of a single message may be tracked using a message address status. The message address status may be WTRU specific and indicates whether a particular WTRU belongs to a group of WTRUs identified for receipt of the same message. Where there are multiple WTRUs (<b>21</b> and <b>22</b>) identified for receipt of the same message, a single instance of the message is transmitted to all of the receiving WTRUs. Other methods of determining and identifying which WTRUs are identified for receipt of the same message and are thus candidates for reduced message instances, are within the scope of the invention and may be implemented as desired. Examples of such methods are described below.

P-0023[0023]FIG. 3 is a diagram of an ordered frame having a timing sequence <b>40</b> showing a single instance of a message, message M, being transmitted to a plurality of destination identifiers <b>42</b>, <b>44</b>, and <b>46</b>. The destination identifiers <b>42</b>, <b>44</b>, and <b>46</b> may each be associated with one or more WTRUs. In this case, message “M” has been identified for delivery to the WTRU(s) associated with destination identifiers <b>42</b>, <b>44</b>, and <b>46</b>. That is, rather than providing multiple instances of message M, a single instance is provided thereby optimizing system resources.

P-0024[0024] There is a general restriction when implementing this approach that the message must occur in a fashion such that all of the WTRUs that are receiving the message will be able to receive the message during its transmission. By way of example, the message transmission must be later than the last destination identifier time of transmission, and with sufficient time delay for every WTRU to prepare for the reception of the message.

P-0025[0025] It is important to note that the use of a pointer to a specific message may occur with any number of destination identifiers, and there may be intervening messages going to other WTRUs, as desired. Furthermore, as mentioned, one or more of the destination identifiers may actually be a group identifier of a number of WTRUs in a manner known to those skilled in the art of wireless technology.

P-0026[0026] The determination of when it is feasible to use the same message multiple times according to the present invention may be refined and adapted, as desired. That is, the determination may be implemented in a variety of embodiments.

P-0027[0027] By way of example, in a first embodiment, the source of the messages can be programmed to associate multiple receiving WTRUs with the same message. Using an email message having multiple recipients as an example, when the wireless network receives such a message it compares the recipient list against the coverage areas it has for them. Because of different locations or network affiliations it may be necessary to split the message and recipients into distinct transmissions. However if two or more of the receiving WTRUs are capable of receiving the same identification transmission and subsequently the same message transmission, then the solution of the present invention may be utilized.

P-0028[0028] In a second embodiment, where messages and data concerning receiving WTRUs enter a wireless network individually, many types of messages can tolerate some delay in delivery without adverse effects. In this case, the system compares messages over some fraction of these allowable delay times for duplications. This can often be done with minimal calculations through such techniques as hashing functions. When duplications are detected, a check is done to determine if any of the duplicated messages may be transmitted in a single transmission. If so, pointers that point to a single instance of a duplicated message is provided for the WTRUs identified for receipt of the duplicated message.

P-0029[0029] In a third embodiment, a wireless system may include an entity for monitoring transmissions to WTRUs. The entity establishes a likelihood factor concerning whether certain groups of WTRUs receive transmissions of the same messages. The reception of a message for one of these WTRUs triggers a delay and search for duplications of the message for other devices before transmission thereof. If duplications are detected, a single instance of the message is transmitted. Otherwise, separate instances of the message are transmitted to each of the receiving WTRUs.

P-0030[0030] In a fourth embodiment, a wireless system is preprogrammed to watch for specific device identifier groups and checks for duplication of messages to the individuals within these groups. If duplications are detected, a single instance of the message is transmitted. Otherwise, separate instances of the message are transmitted to each of the receiving WTRUs.

P-0031[0031] To implement the present invention in 3rd generation (3GPP) cellular networks, the destination identifiers and pointers identified in FIG. 3 are signaled on the broadcast common control channel (BCCH) or an equivalent logical control channel broadcast to all users of the cell. The BCCH or equivalent logical control channel is mapped to a broadcast transport channel (BCH) or an equivalent broadcast transport channel that is applied to the primary common control physical channel (PCCPCH). Alternatively, the BCCH or an equivalent logical control channel can be mapped to a forward access channel (FACH) that is applied to the secondary common control physical channel (SCCPCH).

P-0032[0032] In FIG. 3, a WTRU must check the entire timing sequence <b>40</b> to determine whether there is a message for them. To provide more efficient processing and reduced battery consumption in a WTRU, it is necessary to provide deterministic scheduling of the destination identifiers and pointers. Furthermore, it is necessary to signal logically separate information (i.e. the destination identifiers and pointers) independently since the need to acquire the information and the periodicity of signaling will be unique to the signaling information being signaled. Therefore, in another embodiment of the present invention, the destination identifiers and pointers are maintained in unique System Information Blocks (SIB). In this embodiment, therefore, the destination identifiers and pointers are associated with particular SIBs thereby allowing WTRU(s) to simply determine which individual SIB they should read in order to receive a message. That is, the list of destination identifiers and pointers can be relatively large. To avoid having a WTRU check each destination identifier and pointer contained within a timing sequence (such as timing sequence <b>40</b>), the SIB information can be segmented into multiple independent transmissions. Alternatively, it is also possible to separate different classifications of destination identifiers and pointers into multiple SIBs.

P-0033[0033] WTRUs may determine which SIB to read from a master information block (MIB) that identifies the scheduling of individual SIBs. That is, in this embodiment, instead of a WTRU checking all of the destination identifiers and pointers contained within a particular timing sequence (such as timing sequence <b>40</b>), the WTRU may simply check the MIB to quickly determine the appropriate destination identifier and pointer (which are contained in the SIB). The destination identifiers and pointers are therefore associated with a particular SIB. Users may then only acquire SIBs for which services these users are associated with.

P-0034[0034] To illustrate this embodiment, reference is made to FIG. 4. In FIG. 4, a MIB <b>502</b> including pointers <b>504</b>, <b>506</b>, and <b>508</b> is shown. It should be noted that the MIB may be unique for each cell. Therefore, each time a WTRU enters a cell, they will read the MIB. By reading the MIB <b>502</b> the WTRU is informed of where to find their SIB. The SIB informs the WTRU at which time interval the WTRU's destination identifier and pointer will be presented. It should also be noted that the destination identifier and pointer may be updated periodically. For example, in the case of stock quotes, a new message may be transmitted every 10 minutes. In that case, the WTRU will read the SIB every 10 minutes to receive the updated information, but does not have to read the MIB. This is because the MIB will not change unless the actual scheduling of the destination identifiers and pointers changes.

P-0035[0035] For example, still referring to FIG. 4, the MIB <b>502</b> includes pointers <b>504</b>, <b>506</b>, and <b>508</b> which point to SIB1 SIB2, and SIBN, respectively. A WTRU subscribing to service A reads the MIB, and is directed to SIB1 <b>510</b>. From reading SIB1 <b>510</b>, the WTRU reads the destination identifiers and pointers for service A <b>512</b>. The WTRU may then retrieve messages for service A. In this embodiment, any number of WTRUs may be associated with the destination identifiers for service A (i.e. all of the users subscribing to service A). Therefore all of the WTRUs that subscribe to service A, by reading the MIB and the SIB, are directed to a single instance of whatever message is being transmitted as part of service A. WTRUs associated with services B and X may similarly be directed to single instances of messages transmitted pursuant to those services.

P-0036[0036] The embodiment discussed above and shown in FIG. 4 may be varied so that the actual message is included in the SIB, as shown in FIG. 5. In FIG. 5, a WTRU reads the MIB as before, but here an extra step is eliminated because when the WTRU obtains its SIB it has an actual message. This also enables a single instance of the message to be transmitted for multiple WTRUs. That is, each WTRU reads MIB <b>601</b> and is directed to SIB1 <b>604</b> which includes a single instance of the message <b>602</b> currently being transmitted for service A.

P-0037[0037] It should be noted that it is possible to provide multiple levels of pointers and messages. Thus, it is possible to include a generic message pointer, such as a pointer to a message indicating availability of a more specific type of message. The user can then, either by preconfiguration or by selection at the time of receipt of the generic message, choose to receive the specific type message. The selection can be made to inform the network that the WTRU will receive the message, or the selection can be passive, allowing the WTRU to respond to the more specific message. By way of example, a user entering a commercial space may be offered commercial information such that the user may elect to receive the commercial information.

P-0038[0038]FIG. 6 is a flow chart illustrating method steps implemented by a message arrival analysis routine in accordance with a preferred embodiment of the present invention. When a message arrives, a determination is made as to whether the message is a duplicate of one for a pending recipient list (step <b>305</b>).

P-0039[0039] If the determination of step <b>305</b> yields a positive result, the WTRU(s) are added to the recipient list for the message (step <b>310</b>). In step <b>315</b>, a determination is made as to whether the maximum hold time for this instance is less than that presently set for the recipient list. If it is, the hold time is adjusted to an appropriate value (step <b>320</b>).

P-0040[0040] If the determination of step <b>305</b> yields a negative result, a determination is made as to whether the message can be delayed to search for other recipients (step <b>325</b>). If the message can not be delayed to search for other recipients, a determination is made as to whether the message is being sent to more than one recipient (step <b>330</b>). If the message is not being sent to more than one recipient, the message is scheduled for normal delivery (step <b>335</b>). If the message is being sent to more than one recipient, or it is determined that the message can be delayed to search for other recipients, an entry is created in the recipient list queue, one or more WTRUs are added, and the hold time is set to an appropriate value (step <b>340</b>).

P-0041[0041]FIG. 7 is a flow chart illustrating method steps for periodically checking to see if there is a recipient list that has been in a multicast queue past a predetermined hold time in accordance with a preferred embodiment of the present invention. When it is determined that a recipient list remains in the multicast queue past its hold time (step <b>405</b>), the WTRUs on the recipient list are segregated into groups in the same data delivery coverage areas (step <b>410</b>). A determination is then made as to whether there is another group to send (step <b>415</b>). If there is another group to send, the transmission of WTRU identifiers, message pointer and one instance of the message is scheduled (step <b>420</b>). If there is not another group to send, the recipient list is deleted (step <b>425</b>).

P-0042[0042] While the present invention has been described in terms of the preferred embodiment, other variations which are within the scope of the invention as outlined in the claims below will be apparent to those skilled in the art.