A METHOD OF CONTROLLING THE OPERATION OF A PACKET SWITCHED CDMA TELECOMMUNICATION NETWORK

Abstract: The invention relates to a method of controlling the operation of a packet switched CDMA telecommunication network, wherein N network users are connected to the network by respective terminals, and the terminal of each user is assigned an orthogonal receiver code. To improve the properties of the packet network, the network terminal wanting to transmit senses the channel forming the transmission path for the presence of the receiver code of the other communicating party, i.e. the receiving terminal, in signals transmitted by the other terminals, said receiving terminal being the terminal to which the sensing terminal wants to transmit data in packet format. If the receiver code is not detected in the channel, said terminal wanting to transmit initiates the transmission of packet-format data encoded by said receiver code, whereas if the receiver code is detected in the channel, said terminal wanting to transmit remains waiting so as to repeat the above-described sensing algorithm after a period of time.

Description: A method of controlling the operation of a packet switched CDMA telecommunication network The invention relates to a method of con- trolling the operation of a packet switched CDMA telecommunication network, wherein N network users are connected to the network by a respective ter¬ minal, and each terminal communicates by means of a transmitter and a receiver with a receiver and a transmitter of another terminal via a CDMA channel forming the transmission path, and wherein a substan¬ tially orthogonal receiver code is assigned to the terminal of each user, which code is used by the other terminals of the network for addressing and encoding packets to the particular terminal. In a packet switched network or a packet net¬ work, data is addressed and provided with control information and then transmitted in packets of specified format, the data transmission line being assigned to the transmission of a single data packet at a time, whereafter the transmission channel is assigned to other transmission functions. Packet switched telecommunication networks are used widely in computer communications, digital tele- phone systems and mobile communication networks. As compared with the previous circuit switched network, the packet switched network enables a more efficient utilization of the available frequency band and other telecommunication network resources. The packet switched network is particularly applicable in burst transmission in which the data to be transmitted con¬ sists of short data periods and long idle periods during which no data is transmitted between the com¬ municating parties. In such operation several slight- ly loaded transmission lines are replaced by a single transmission line which is shared by a number of dif¬ ferent users, and so the users of the network trans¬ mit data via a common transmission line. A packet network employing code division multiple access (CDMA) provides each user with a code, and these codes orthogonal with respect to each other are used to encode data packets to be trans¬ mitted. In the CDMA packet network all users share the same available frequency band. It is important in which way the used codes are associated with each user and in which way they are assigned to the dif¬ ferent users. These two functions are usually per¬ formed in accordance with a special spreading code protocol. CDMA packet networks employ spreading code protocols of different kinds, such as the common code (C) protocol, the receiver-based (R) code protocol, the transmitter-based (T) code protocol, the common transmitter-based (C-T) code protocol and the receiver- ransmitter based (R-T) code protocol. The naming of the spreading code protocol depends on the assignment of the code, that is, on the function with which the code is associated. In the R code protocol, for instance, the network terminal of each user is assigned a code which the other network users use when encoding and transmitting data packets to the particular user, that is, to the receiver in the same networ . However, when using a conventional spreading code protocol, an adequate performance is not achieved especially as far as the throughput is con¬ cerned. The Applicant has observed that none of the above-mentioned conventional spreading code protocols provides a throughput efficiency higher than 0.36. As the traffic load of the network increases, the net- work is more probable to get into a backlog state in which the throughput is extremely low and long delays occur in the network. Thus the present-day conven¬ tional spreading code protocols do not provide suf¬ ficiently good results, which is due to the fact that the packet transmissions are started at random, and so packet collisions are inevitable with increasing traffic load of the network. To eliminate the above-mentioned problems, it is previously known to use a channel load sensing protocol intended especially for a broadband CDMA packet network employing the R code protocol. How¬ ever, the codes used in the above-mentioned prior art method and in protocols used in other CDMA networks are not always fully orthogonal with respect to each other, and so the cross-correlation between two codes may also deviate from zero. The probability and level of cross-correlation increase with the number of codes of different users in the channel. In the above-mentioned prior art channel load sensing method, the level of cross-correlation is monitored on the receiver side, thus obtaining a rough estimate of the number of users in the network at any given time. If the level of cross-correlation exceeds a predetermined value, i.e. a CDMA threshold, the transmitter remains waiting for a reduction in the level of cross-correlation. The channel load sensing protocol cannot, however, determine which receiver and/or transmitter is busy at a given time, but it only determines the number of active users. The channel load sensing protocol also operates poorly when the level of cross-correlation is less than the CDMA threshold value, whereas the user, that is, the terminal to which the transmitter wants to transmit a packet, is busy, and so collisions of packets in- evitably result after transmission. In order words, the prior art protocol described above is "blind". Known methods also include the Carrier Sense Multiple Access (CSMA) protocol, i.e. a contention bus, the purpose of which is to prevent random trans- mission of packets by sensing the bus for the same carrier frequency before a new packet is transmitted. Packet transmission is initiated if the same carrier frequency is not detected in the bus. The CSMA proto¬ col reduces packet collisions but it is applicable to narrow band packet networks only. The CSMA protocol is not either in other respects well suited for use in conjunction with the CDMA network, because the simultaneous transmission of several packets, which is possible in the CDMA network, cannot be detected on the same carrier frequency in accordance with the CSMA protocol. A further known protocol is the Busy Tone Multiple Access (BTMA), in which each busy receiver in the network at a given time indicates its busy state by transmitting a busy tone signal in a separ¬ ate busy-tone channel. The BTMA protocol is applicable only to narrow band packet networks. An object of the present invention is to provide a method of controlling the operation of a packet switched CDMA network, which method avoids the problems and disadvantages associated with the prior art. This object is achieved by a method according to the invention, which is characterized in that the network terminal wanting to transmit senses the chan- nel forming the transmission path for the presence of the receiver code of the other communicating party, i.e. the receiving terminal, in signals transmitted by the other terminals, said receiving terminal being the terminal to which the sensing terminal wants to transmit data in packet format, and that if the receiver code is not detected in the channel, said terminal wanting to transmit initiates the trans¬ mission of packet-format data encoded by said re¬ ceiver code to the receiver of the receiving terminal, whereas if the receiver code is detected in the channel, said terminal wanting to transmit re¬ mains waiting so as to repeat the above-described sensing algorithm after a period of time. The period of time is preferably random. The method is based on the idea that the method utilizes a protocol identifying the code of the receiver by sensing the channel, and so it is possible to determine which receiver is busy or is not busy at any given time. The method according to the invention provides many advantages, such as a significant improvement in the throughput to a value which is considerably in excess of the throughput obtained by the best conventional spreading code (R-T spreading code). Delays occurring in the CDMA network are also shortened considerably as collisions between packets in the transmission channel are considerably less frequent than previously. There is also a significant decrease in the number of channel backlogs and the stability properties of the network are improved. The method according to the invention is also relatively easy to apply in a CDMA network, and it can be realized with existing equipment with slight mod¬ ifications and additions. In the following the invention will be de¬ scribed in greater detail with reference to the attached drawings, in which Figure 1 is a graphic representation of the throughput as a function of normalized channel load; Figure 2 is a graphic representation of channel backlogs as a function of normalized channel load; Figure 3 is a graphic representation of channel delays as a function of normalized channel load; Figure 4 is a graphic representation of the state occupancy probability as a function of normal¬ ized channel load; Figure 5 is a flow chart illustrating the method according to the invention; Figure 6 is a simplified block diagram of a packet switched network, and Figure 7 is a graphic representation of cor¬ relation. Figure 6 shows a simplified block diagram of a packet network, comprising a pair of two users U^ and U- j communicating via a channel 1. Figure 6 shows a packet network comprising merely two users U- j _ and U2 and their terminals TER^ and ER2 interconnected by the CDMA channel 1, that is, the number N of users is 2. In practice, the packet network comprises more users, that is, N dif¬ ferent users, which are connected to the packet net¬ work by respective terminals TER 1→N and transmit data in packets at a rate A packets/s. The same channel 1 can also be used by all the other users in the net- work. The terminal TER^ comprises a transmitter T^ and a receiver R^ with a correlator C^, where i is in the range l→N. The other communicating party, that is, the terminal TER^ comprises a transmitter T^ and a receiver R^ with a correlator CJ, where j is in the range l→N so that i is different from j. Each terminal TER 1→N in the network and thus each user U 1→N is provided with a specific receiver sensing code r 1→N , so that the user U if for instance, has the receiver sensing code r.^ and the user U^ has the receiver sensing code r.= . If one wants to trans- mit a packet message from the transmitter T i of the terminal TER^, the packet is encoded by means of the receiver sensing code r^ of the receiver R of the other communicating party, that is, the terminal According to the invention, if the user U^, for instance, wants to transmit data in packet format via the transmitter T^ of the terminal TER i to the user Uj , i.e. to the receiver R^ of the terminal TER- j , the channel 1 acting as the transmission path is sensed so as to see if the receiver sensing code r • of the other communicating party TER- is already present in the channel 1, because it may be present in the chan¬ nel 1, if another transmitter is already transmitting packet-format data encoded with the sensing code r η - to the receiver R ■ of the terminal TER^ . If the ter¬ minal TER j _ detects the receiver sensing code r^ of the other communicating party ER^ in the channel 1 forming the transmission path, the transmitter T^ of the terminal TER^ does not initiate the transmission of the packet, but remains waiting, and repeats the sensing procedure after a random delay. If the ter¬ minal TER^ now detects no sensing code r^ in the channel 1, the transmitter Ti of the terminal TER^ initiates the transmission to the receiver R_ j of the terminal TER-: via the channel 1 forming the trans¬ mission path. In practice, the absence of the re¬ ceiver sensing code r^ in the transmission path 1 means that the other transmitter, which earlier transmitted to the receiver R • of the terminal TER- j , has terminated its transmission. If the terminal TER i detects at once that the receiver sensing code r_τ of the receiver R^ of the other communicating party, that is, the terminal TER • is not present in the channel 1, that is, the transmission path, it initiates its transmission immediately. Duplexers D forward the packets to the CDMA channel 1 and away from the channel 1, and controllers CTR control the operation of the terminals. As shown in Figure 5, packets to be transmitted arrive at the transmitter, whereafter the channel is sensed to see if the code of the receiver to which the transmitter wants to transmit the packet is already busy or free. If the code is free, that is, it is not present in the channel, the packet/packets is/are transmitted to the transmission channel and further to the receiver of the terminal of the other communicating party. If the code is busy, one waits for a random period of time, whereafter the sensing procedure is repeated. The basic idea of the invention can thus be realized in such a way that N network users are con¬ nected to the network by a respective terminal TER^, TER- j , i, j = l→N, and each terminal TER^ communicates by means of a transmitter T j _, i = 1 → N and a re¬ ceiver R^, i = l→N with a receiver R^ and a trans¬ mitter T.J of another terminal TER- j , j = l→N via a CDMA channel 1 forming the transmission path, and wherein a receiver code r^, r-, i, j = 1 → N is assigned to the terminal TER.^, TER- j of each user, which code is used by the other terminals of the net¬ work for addressing and encoding packets to the par¬ ticular terminal. According to the invention, the network terminal TER^, i = l→N wanting to transmit senses the channel 1 forming the transmission path for the presence of the receiver code r^ of the other communicating party, i.e. the receiving terminal TER•, in signals S^ transmitted by the other terminals, said receiving terminal TER.- being the terminal to which the sensing terminal TER^ wants to transmit data in packet format, and if the receiver code r.: is not detected in the channel, said terminal TER i wanting to transmit initiates the transmission of packet-format data encoded by said receiver code ΓJ to the receiver R^ of the receiving terminal TER_ j , whereas if the receiver code r_ j is detected in the channel, said terminal TER i wanting to transmit re¬ mains waiting so as to repeat the above-described sensing algorithm after a period of time. The waiting time of the terminal is preferably random. In a preferred embodiment of the method according to the invention, the sensing of the re¬ ceiver code r. j can be carried out by applying a signal S^ derived from the channel 1 and comprising different codes r ι__ jsj "to be transmitted in the chan¬ nel, if there is any traffic in the channel, to a correlator C^ included in the receiver RJ of the transmitting terminal TER^ The receiver sensing signal r^ of the receiver R_ j of the terminal TER^ is applied to another input in the correlator C^ of the receiver R j _. If the signal applied from the channel 1 to the correlator C^ contains the code r^, an auto¬ correlation peak considerably higher than the cross- correlation between the different codes can be detected in an output C^out of the correlator. This peak is due to the auto-correlation between two identical codes r^ . In the graphic representation of Figure 7, the low curve portions represent the cross- correlation between codes substantially orthogonal with respect to each other, and the high peak re¬ presents the auto-correlation of the code r^ with itself. On the basis of the occurrence of auto-cor¬ relation it is easy to monitor the presence of a certain code in the channel acting as the trans- mission path, and so it can be determined if the receiver R_ j , to which the transmitter R i wants to transmit data in packet format, is busy with some other transmitter. If the level of auto-correlation in the output of the correlator C^ is not sufficient¬ ly high, that is, does not exceed a threshold value K, the transmitter T j _ of the terminal TER^ knows that the receiver R.: is not busy, and therefore the trans¬ mitter ^ can transmit the data packets waiting for transmission. In the preferred embodiment of the invention, the channel 1 forming the transmission path is thus sensed for the presence of the receiver code r^ by applying a signal S iA derived from the channel 1 and comprising receiver codes r present in the signals transmitted by the other terminals, to the correlator C^ included in the receiver R^ of the sensing ter¬ minal, that is, the terminal TER.^ wanting to trans¬ mit, in addition to which an identifying receiver code r. j of the other communicating party, that is, the receiving terminal T. j is also applied to the cor¬ relator C^ as a reference, whereafter the correlation between the two above-mentioned parameters applied to the correlator C^ is measured in an output C^out of the correlator C _ . It is to be mentioned that each terminal is able to generate all the identifying re¬ ceiver codes r of the other terminals as a reference one at a time, or these receiver codes can be applied to it e.g. from the controller CTR. If the level of auto-correlation, i.e. correla¬ tion between the receiver code r• already present in the signal S^ measured from the channel 1, i.e. the receiver code r., sensed from the channel 1, and the same receiver code r^ applied to the correlator as a reference, in the output C i out of the correlator C^ 12 clearly higher than that obtained by the conventional R-T or R spreading code protocols represented by the two lowest curves in Figure 1. In Figure 1, the maximum throughput to be obtained by the R-T spread- ing code is only 0.36, which is significantly lower than the value 0.506 obtained by the method according to the invention. The maximum throughput 0.506 is obtained when A /u is 2. The curve portion on the left side of the point where A /u = 2 represents the stable range of the network and the curve portion on its right side represents the unstable range of the network. As appears from Figure 1, the stable range of the network is widest in the case of the uppermost curve, that is, in the method employing the R code sensing according to the invention. The higher stab¬ ility enables each network user to use a higher packet transmission rate A . Figure 2 is a graphic representation of channel backlogs K(N, r) occurring in the method according to the invention (R code sensing protocol) as a function of the packet traffic load r of the channel as com¬ pared with backlogs occurring when using the conven¬ tional spreading code protocols (R, R-T). The term backlog means the average number of users in blocked state. The lowest curve represents the number of backlogs occurring when using the method according to the invention, that is, the R code sensing protocol. As appears from Figure 2, the number of backlogs is clearly lower in the method according to the inven- tion as compared with the conventional spreading code protocols. The uppermost curve in Figure 2 represents the number of backlogs occurring when using the R spreading code protocol, and the middle curve re¬ presents the number of backlogs occurring when using the R-T spreading code protocol. As the channel load 11 exceeds the predetermined threshold value K, the transmitter TJ of the sensing terminal, that is, the terminal ER^ wanting to transmit, remains waiting and does not yet start the transmission of the packet to the receiver R^ of the receiving terminal TER^ . If the level of auto-correlation is less than the pre¬ determined threshold value K, the transmission of the packet can be initiated. A limiter i.e. a maximum chooser E determines whether the output C ± out of the correlator C ± exceeds the predetermined threshold value K. Correspondingly, in the terminal TER.;, another limiter i.e. maximum chooser E determines whether the output C j out of the correlator Cj exceeds the predetermined threshold value K. The graphic representations of Figures 1, 2, 3, and 4 illustrate the performance to be obtained by the method according to the invention as compared with a performance obtained by conventional spreading codes. In Figures 1-4, the horizontal axis represents a normalized channel load r; the scale has been obtained by dividing the transmission rate Λ of the packets by the reciprocal u of one time unit. All Figures 1-4 illustrate a network comprising 8 users, that is, N = 8 and 1/u = 1.0 ms. Figure 1 shows a graphic representation of the throughputs per pair S(N, r) to be obtained by the method according to the invention (R code sensing protocol) as a function of the packet traffic load r of the channel as compared with the throughout efficiencies obtained by conventional spreading codes (R, R-T). In Figure 1, the highest curve represents the throughput obtained by the method according to the invention, i.e. the receiver (R) code sensing protocol. The maximum throughput is 0.506, which is increases, the number of backlogs with the method according to the invention is only one half of that obtained with the prior art methods, as is apparent from Figure 2. Figure 3 is a graphic representation of channel delays D(N, r) as a function of the packet traffic load r of the channel. In Figure 3, the delay occurring when using the method according to the in¬ vention, that is, the R code sensing protocol, is re- presented by the lowest curve. As is to be seen from Figure 3, delays in the network employing the method according to the invention are only one fourth of those occurring with the conventional R and R-T pro¬ tocols when the channel traffic increases. The method according to the invention also provides a higher probability of state occupancy p, that is, a higher pairing-up probability between two terminals, as shown in Figure 4. In Figure 4, the performance to be obtained by the method according to the invention is represented by the uppermost curve. Even though the invention has been described above with reference to the examples of the attached drawings, it is obvious that the invention is not restricted to them, but it can be modified in many ways within the inventive idea disclosed in the attached claims.

Claims: Claims : 1. A method of controlling the operation of a packet switched CDMA telecommunication network, wherein N network users (U. j _ j ) are connected to the network by a respective terminal (TER. j _, TER j , i, j = l→N), and each terminal (TER.^) communicates by means of a transmitter (T^, i = 1 → N) and a receiver (R^, i = l→N) with a receiver (R- j ) and a transmitter (T- j ) of another terminal (TER-, j = l→N) via a CDMA chan¬ nel (1) forming the transmission path, and wherein a substantially orthogonal receiver code (r^, r-, i, j = l→N) is assigned to the terminal (TER i TER- j ) of each user, which code is used by the other terminals of the network for addressing and encoding packets to the particular terminal, c h a r a c t e r i z e d in that the network terminal (TER^, i = l→N) wanting to transmit senses the channel (1) forming the trans- mission path for the presence of the receiver code (r- j ) of the other communicating party, i.e. the re¬ ceiving terminal (TER- j ), in signals (S^) transmitted by the other terminals, said receiving terminal (TER- j ) being the terminal to which the sensing terminal (TER j _) wants to transmit data in packet format, and that - if the receiver code ( r-t ) is not detected in the channel, said terminal (TER i ) wanting to transmit initiates the transmission of packet-format data en- coded by said receiver code (r^) to the receiver (R- j ) of the receiving terminal (TER• ), whereas - if the receiver code (r_ j ) is detected in the channel, said terminal (TER^) wanting to transmit remains waiting so as to repeat the above-described sensing algorithm after a period of time. 2. A method according to claim 1, c h a r a c ¬ t e r i z e d in that - the sensing of the channel (1) forming the transmission path for the presence of the receiver code (r. j ) is carried out by applying a signal (S^) derived from the channel (1) and containing receiver codes (r) occurring in signals transmitted by the other terminals, to a correlator (C^_) included in the receiver (R^) of the sensing terminal, i.e. the ter- minal (TER^) wanting to transmit, in addition to which the identifying code ( r - j ) of the other com¬ municating party, i.e. the receiving terminal (TER..) is applied to the correlator ( ^_) as a reference, and then correlation between the two above-mentioned parameters applied to the correlator (C^) is measured in an output (C-^out) of the correlator (C.^). 3. A method according to claim 2, c h a r a c ¬ t e r i z e d in that - if the level of auto-correlation, that is, correlation between the receiver code (r- j ) already present in the signal (S^) derived from the channel, that is, sensed from the channel (1), and the same receiver code (r- j ) applied to the correlator as a reference, in the output (C^out) of the correlator (C^) exceeds a predetermined threshold value (K), the transmitter (T^) of the sensing terminal, i.e. the terminal (TER^ ^ ) wanting to transmit remains waiting and does not yet initiate the transmission of the packet to the receiver (R- j ) of the receiving terminal (TER-)/ whereas - if the level of auto-correlation is less than the predetermined threshold value (K), the trans¬ mission of the packet is initiated immediately.

Inventors: CHEN XIAO HUA, OKSMAN JUHANI, CHEN, XIAO, HUA, OKSMAN, JUHANI
Applicants: NOKIA MOBILE PHONES LTD, NOKIA MOBILE PHONES LTD.
Application year: 1992
Main classification: H04L12
IPC codes: H04J13, H04L12