This is a national stage of PCT application No. PCT/EP01/03913, filed on Apr. 5, 2001. Priority is claimed on that application.
The present invention relates to the field of Radio Resource Management (RRM) for Code Division Multiple Access (CDMA) with special focus on packet services.
In current packet data communication systems Soft HandOver (SHO) is used for downlink packet services, and packet scheduling is done periodically. However, studies have shown that SHO is not always beneficial for packet services.
From the interference point of view it is not desirable to have SHO in the downlink. For instance, it is very rare that the average propagation loss coming from multiple Base Stations (BSs) are the same, resulting into poor multipath combining at the RAKE receiver.
Moreover, packet transmissions are shorter compared to circuit-switched calls, and seamless connection is also not mandatory. Oftentimes, a packet Mobile Station (MS) is in the DTX (Discontinuous Transmission) mode, and performing unnecessary SHO updates during DTX does not contribute to the system performance.
Hence, using SHO for downlink packet services does not necessarily improve the system capacity but rather introduces a large amount of signaling.
It is therefore an object of the present invention to improve packet scheduling for a packet Mobile Station.
According to one aspect of the present invention, this object is achieved by a method of determining an allocation period for packet data in a communication system. The method comprises the step of collecting measurements from mobile stations. A maximum allocation period for at least one possible base station for transmitting data packets to the mobile station is determined on the basis of the collected measurements, and a base station out of the possible base stations is determined on the basis of the at least one determined maximum allocation period. Then, the determined base station and a corresponding allocation period are selected.
According to another aspect of the present invention, the above-mentioned object is achieved by a control device for determining an allocation period for packet data in a communication system. The control device comprises a control entity which is adapted to collect measurements from mobile stations and to determine, on the basis of the collected measurements, a maximum allocation period for at least one possible base station for transmitting data packets to the mobile station. The control entity determines a base station out of the possible base stations on the basis of the at least one determined maximum allocation period. Moreover, the control entity comprises a scheduling entity which selects the determined base station and a corresponding allocation period.
According to the present invention, Hard HandOver (HHO) with adaptive allocation periods is used. Accordingly, there is no more SHO in the downlink. This is a clear advantage since SHO decreases the system complexity and even capacity. According to simulations conducted by the inventors, downlink SHO requires more BS power. A remarkable decrease of signaling inside the Radio Access Network (RAN) and in the air-interface is achieved.
According to the present invention, the packet allocation period can be adaptively determined, and may be made shorter near cell boarders.
In the following the present invention will be described by way of a preferred embodiment thereof with reference to the accompanying drawings.
The idea of the present invention is to determine a maximum packet allocation period (i.e. transmission times) for at least one possible base station, during which packet sending can be done without handover. In other words, during the maximum packet allocation period of a cell, the probability is small that the cell becomes inappropriate within a transmission which takes place in the cell which was the appropriate one when the packet transmission started.
In order to improve packet scheduling, a Packet Scheduler (PS) should be able to separate or at least identify the Mobile Stations (MSs) that are in a handover area, i.e. near cell boarders. This information may be extracted by a Radio Network Controller (RNC) in a Radio Access Network (RAN) to which the MSs attach, on the basis of an active Base Station (BS) update rate or from Energy per Chip to Interference Ratio (Ec/Io) values. The PS may be located in the RNC or may be located in a Base Transceiver Station (BTS).
As shown in
As can be understood from the foregoing, Hard HandOver (HHO) with adaptive allocation periods is used. The principle behind the idea of solely using HHO is due to the fact that packet transmission calls are shorter than circuit-switched calls. According to the above-described algorithm, during the transmission of a packet, a packet MS does not perform any handover update. At first, the BS is selected and then the PS allocates certain capacity.
In the following it will be described how the RNC determines the maximum allocation period for the MS.
An allocation period has to be set every time a new BS is chosen. An allocation period is also set when the previous allocation period ends. It may not be necessary to make handover after the allocation period has expired, but a new allocation period has to be estimated (if there is still data to transmit). This allocation period depends on the amount of change in the radio channel, which on its turn depends on the slow fading and the path loss change. The change due to path loss is small compared to the change in shadow or slow fading, so the change in path loss can be ignored.
For example, 3 and 50 km/h MS speeds are taken and the average change in the slow fading with respect to time is measured. From the slow fading formula, the correlation as a function of distance traveled by the MS is expressed as
ƒs(t)=ƒs(t−1)Rc+X(t)√{square root over (1−Rc1)}
where Rc is the correlation coefficient and X(t) is a normally distributed random number. The random generator of X(t) takes into account the wanted mean and standard deviation of the fading process. Rc is calculated as
Rc=exp(−dx/dcorr ln(1/ρc))
where dx is the distance interval between samples, dcorr is the de-correlation distance and ρc is the corresponding correlation coefficient at dcorr. Thus, for 3 and 50 km/h, and 50 m dcorr andρc=0.5, the quantity sqrt(1−Rc2) is plotted in
As it is illustrated in
Since the handover area is quite large (i.e. 40 percent of users or MSs are potentially candidates for handover in a macro cell environment), it is important that the handover is considered in the packet scheduling. As identified above, the slow fading limits the transmission period. In order to avoid interference in the case of “active set” (i.e. BS) changes, the slow fading should be considered in the packet scheduling.
As a general rule, the maximum capacity allocation period determined by the PS for a packet terminal or MS should be smaller than the average active BS update if HHO is used. This will ensure that within the packet transmission period, there are no large changes in the slow fading.
In a typical WWW model, the average buffer size in one packet call is roughly 12 kbytes. At 32 kbps, this requires an average of 3 seconds of transmission. As the packet size has large variance, it is not uncommon to have 10 seconds of transmission period. This can either be segmented into smaller transmissions in different allocation periods, or be transmitted in a high bit rate bearer. Then the expected transmission period will be much less (i.e. <3 seconds). With respect to
The best way to obtain the maximum allocation period is by setting some confidence such that within the defined period, there is a low probability of handover. This can be represented by
The small maximum allocation periods do not have to be as small as shown in
In order to determine the maximum allocation period in the RNC, it is needed to generate a plot like that of
While the invention has been described with reference to a preferred embodiment, the description is illustrative of the invention and is not to be construed as limiting the invention. Various modifications and applications may occur to those skilled in the art without departing from the true spirit and scope of the invention as defined by the appended claims.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/EP01/03913 | 4/5/2001 | WO | 00 | 12/11/2002 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO02/082847 | 10/17/2002 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
5771461 | Love et al. | Jun 1998 | A |
5978365 | Yi | Nov 1999 | A |
6094427 | Yi | Jul 2000 | A |
6216004 | Tiedemann et al. | Apr 2001 | B1 |
6275703 | Kalev | Aug 2001 | B1 |
6307849 | Tiedemann, Jr. | Oct 2001 | B1 |
6324401 | De Hoz Garcia-Bellido et al. | Nov 2001 | B1 |
6469996 | Dupuy | Oct 2002 | B1 |
6526028 | Kondo | Feb 2003 | B1 |
6603971 | Mohebbi | Aug 2003 | B1 |
6628632 | Dolan | Sep 2003 | B1 |
6782035 | Nakamura et al. | Aug 2004 | B1 |
6834044 | Sugirtharaj et al. | Dec 2004 | B2 |
6845238 | Muller | Jan 2005 | B1 |
6907243 | Patel | Jun 2005 | B1 |
6928120 | Zhang | Aug 2005 | B1 |
6944143 | Bayley et al. | Sep 2005 | B1 |
7009953 | Tiedemann, Jr. | Mar 2006 | B2 |
7123916 | Hunzinger | Oct 2006 | B2 |
20010023191 | Endo | Sep 2001 | A1 |
20010038674 | Trans | Nov 2001 | A1 |
20020137518 | Achour | Sep 2002 | A1 |
20030036409 | Sato et al. | Feb 2003 | A1 |
20030142647 | Agrawal et al. | Jul 2003 | A1 |
Number | Date | Country |
---|---|---|
745205 | Dec 1998 | AU |
0884 864 | Dec 1998 | EP |
2000-224231 | Aug 2000 | JP |
2001-78246 | Mar 2001 | JP |
Number | Date | Country | |
---|---|---|---|
20040038686 A1 | Feb 2004 | US |