DATA RETRANSMISSION METHOD

Abstract: A method and system for large data transfer between a sender and a receiver. The sender transmits to the receiver a plurality of data packets in sequence. The time elapsed for each of the plurality of data packets after transmission of said each of the plurality of data packets is determined. The receiver transmits a message from the receiver to the sender notifying the sender that an identified one of the plurality of the data packets is missing. The sender retransmits to the receiver the identified one of the plurality of data packets only when the elapsed time determined for the identified one of the plurality of the data packets is greater than a predetermined time interval.

Description: DATA RETRANSMISSION METHOD BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to data transmission m a wireless communication network and, more particularly, to a method and a system for transmitting data between a mobile station and a server m an efficient and reliable manner. 2. Description of the Related Art The Wireless Application Protocol (WAP) has been developed to address the needs of the mobile stations as these devices have severe physical , memory and processing constraints. WAP is applicable to a number of different systems including GSM-900, GSM-1800, GSM-1900, CDMA IS-95, TDMA IS-136, wide-band IS-95 and third generation systems such as IMT-2000, UMTS ,-md W- CDMA. Pursuant to WAP, there are three classes of transactions: Class 0 for unreliable one way requests, Class 1 for reliable one-way requests, and Class 2 for reliable two-way request -response transactions. A transaction is defined as a unit of interaction between an "initiator" (e.g., a sender or a receiver) and a "responder" (e.g., a sender or a receiver) . A transaction begins with an invoke message generated by the sender. In class 2 transactions, the receiver replies with one result message that implicitly acknowledges t-he invoke message. If the receiver ta es longer tnan a specified time interval to service the invoke message, the receiver may reply with a "hold on" acknowledgement message before transmitting the result message so as to avoid the retransmission of the invoke message. The transaction ends when the sender receives the acknowledgement . If the length of a message exceeds the maximum size specified by a bearer (e.g., a telephone company), then before the message is sent, it is segmented into an ordered sequence of data packets. Each data packet has a packet sequence number (PSN) assigned thereto. Thus, for example, the first segmented data packet is assigned a packet sequence number of zero, the second data packet is assigned a packet sequence number of one, the third data packet is assigned a packet sequence number of two, and so on. The data packets are transmitted individually or m groups, and then re-assembled by the receiver upon receipt . The maximum number of packets a message can be segmented is about 256 packets, each packet having a maximum size of 1 to 2 Kbytes. Thus, the maximum size of a message is typically less than 0.5 Mbytes . In the case where the data packets are segmented into groups, the sender does not send any new packets belonging to the same transaction until receipt of the previous packet groups has been acknowledged. In other words, packet groups are sent according to a stop- and-wait protocol . Typically, the sender determines the number of packets m each packet group and transmits the packets of a packet group m one batch. The last data packet of each packet group has a Group Trailer (GTR) flag set and is often referred to as the GTR packet. The last data packet of the last packet group of the entire message has the Transmission Trailer (TTR) flag set and is also referred to as the TTR packet. The receiver stores all packets received and upon receipt of the GTR packet, the receiver checks whether it has received all packets belonging to that particular packet group. If it has received all of the packets m that group, the receiver returns an acknowledgement message containing the packet sequence number of that GTR packet. If, however, the GTR or TTR packet is received and one or more packets of the packet group are missing, the receiver waits for a period of time, e.g., y 2 the median round-trip time (RTT) , before transmitting a negative acknowledgement (NACK) message containing the packet sequence numbers of the missing packets of that particular packet group. If the sender does not receive an acknowledgement within a specified time interval after transmission of a packet group, it retransmits only the GTR or TTR packet of that packet group to the receiver. Problems arise, however, as one or more of the acknowledgement or negative acknowledgement messages are lost during transmission due to, for example, handover errors or congestion m the wireless communication network, thereby resulting m the retransmission of data packets that the receiver has already received. SUMMARY OF THE INVENTION An object of the present invention is to provide a more robust method and system of transmission of data. According to one aspect of the invention, a receiver transmits a negative acknowledgement message to a sender listing all previously missing data packets of a data message. The receiver implicitly acknowledges received data packets by not listing them m the negative acknowledgement message. According to another aspect of the invention, the sender retransmits a data packet only if the time elapsed after the original transmission of that data packet is greater than a predetermined time period. In one embodiment, the sender transmits to the receiver a plurality of data packets m sequence. The time elapsed for each of the plurality of data packets after transmission of said each of the plurality of data packets is determined. The receiver transmits a message from the receiver to the sender notifying the sender that an identified one of the plurality of the data packets is missing. The sender retransmits to the receiver the identified one of the plurality of data packets only when the elapsed time determined for the identified one of the plurality of the data packets is greater than a predetermined time interval. Other objects and features of the present invention will become apparent from the following detailed description considered m conjunction with the accompanying drawings. It is to be understood, however, that the drawings are designed solely for purposes of illustration and not as a definition of the limits of the invention, for which reference should be made to the appended claims. It should be further understood that the drawings are not necessarily drawn to scale and that, unless otherwise indicated, they are merely intended to conceptually illustrate the structures and procedures described herein. BRIEF DESCRIPTION OF THE DRAWINGS In the drawings, wherein like reference characters denote similar elements: Fig. 1 is a block diagram of a data transmission system configured m accordance with an embodiment of the present invention; Fig. 2 is a segmented data message transmitted m the system of Fig. 1; Fig. 3 is a message sequence diagram m accordance with one embodiment of the inventive method; and Fig. 4 is a message sequence diagram m accordance with another embodiment of the inventive method. DETAILED DESCRIPTION OF THE PRESENTLY PREFERRED EMBODIMENTS Finnish Patent Application No. 999470, filed on November 17, 1999 and assigned to the assignee hereof, is incorporated herein by reference. That application discloses a new class of data transmission for the WAP standard, m particular, for transmission of a data message of an arbitrary length. Fig. 1 diagrammatically illustrates an exemplary data transmission system 10 comprising a mobile station 12 (e.g., a cellular phone) m wireless communication with a gateway 14, through an air link 16 (that includes, for example, a base station and a switching control point) . The gateway 14 is connected to a server 18 through a wide area network such as, for example, the Internet or Intranet. Data is transmitted to and from the mobile station 12 m accordance with the inventive method described below. Fig. 2 diagrammatically illustrates a segmented data message of a data stream. The data message comprises a plurality of data packet groups. Each group comprises one or more data packets 20 with no flag sets and a data packet 22 with a GTR flag set. The GTR flag set indicates the last data packet of a data packet group. The last data packet 24 of the entire data message includes a TTR flag set. Each data packet 20 of a data message is associated with a unique identification number, e.g., a packet sequence number (PSN) so that a receiver (e.g., mobile station 12) can identify a missing data packet of the data message on the basis of the identification numbers. Preferably, the data packets are numbered consecutively (e.g., 0, 1, 2, 3 ...) . In one embodiment, a sender (e.g. gateway 14 or server 18) transmits to the receiver the data packets 20 sequentially m accordance with the PSNs so that a data packet 20 with a lower PSN is transmitted prior to one with a higher PSN (e.g., a data packet with PSN=2 is transmitted before a data packet with PSN=3) . If the receiver determines that a data packet 20 is missing (e.g., it has received data packet with PSN=3 but not PSN=1) , it transmits to the sender a negative acknowledgement (NACK) message listing the missing packet (e.g., PSN=1) . Preferably, the NACK message lists not only the missing packet (s) of the most current data packet group but also the missing packet (s) of all previous data packet groups. Thus, if a data packet with PSN=3 is missing from packet group 1 (and not yet received) and data packet with PSN=25 is missing from packet group 5, the NACK message will list both missing data packets (PSN=3 and PSN=25) . This is particularly advantageous because even if the previous NACK message is lost, the sender will still be notified of the missing data packet (s) of previously sent packet groups. It is contemplated that the NACK message may be sent before or after the receiver receives a GTR data packet of each data packet group. After receiving a NACK message from the receiver, the sender checks the time elapsed since the transmission of each missing data packet listed in the NACK message. If the elapsed time for a missing data packet is less than a predetermined time interval (e.g., about one round trip time (RTT) for a data packet to travel between the sender and the receiver) , the sender does not retransmit the requested (missing) data packet. On the other hand, if the elapsed time for the missing data packet is greater than the predetermined time interval, then the sender retransmits the missing data packet . Upon receipt of all data packets in a group, the receiver transmits an acknowledgement ^ CKl message to the sender acknowledging receipt of all data packets for a group and then begins assembling the received data packets so as to reconstruct the data message. Similar to the transmission of NACK messages, the receiver may transmit an ACK message after receipt of the GTR data packet of a group. The receiver may also transmit an ACK message acknowledging receipt of all data packets of a data message after receipt of the TTR data packet. Alternatively, the receiver may transmit a NACK message listing no missing data packets for a particular group to therebv implicitly acknowledge receipt of all data packets m that particular group. In a particularly preferred embodiment, a NACK message lists not only the missing data packets, but also the highest packet sequence number of tne data pacKets received by the receiver. Using such a NACK message, the receiver can thus implicitly acknowledge receipt of all data packets with lower PSNs (except for the listed missing packets) . An example illustrating this NACK message is as follows. A sender transmits two groups of data packets: packets with PSN= N, N+l, N+2 (GTR ; and packets with PSN=N+3 , N+4 , N+5(GTR). The data packets wi h PSN=N+2 and N+5 include the GTR flag sets and are thus the last data packets m their respective groups. The data packets with PSN=N and N+l are lost during transmission. The receiver then transmits a NACK message (NACK_1) listing data packets with PSN=N and N+l as missing and data packet with PSN=N+2 as the last data packet (i.e., with the highest PSN) received by the receiver. NACK_1 , however, is also lost during transmission. Meanwhile, the receiver continues to receive data packets of the next packet group: data packets with PSN=N+3, N+4 , and N+5. After determining data packets with PSN=N and N+l are still missing, the receiver transmits a second NACK message (NACK_2 ) listing the last data packet received (e.g., data packet with PSN=N+5) and the still missing data packets (data packets with PSN=N and N+l) . The sender receives NACK_2 and recognizes that the receiver has received all data packets m the two groups of data packets, except data packets with PSN=N and N+l. The sender thereafter resends the missing data packets (PSN=N and N+l) . It is contemplated that this NACK message may be used m combination with an acknowledgement message to further enhance reliability of communication between the sender and the receiver. Fig. 3 illustrates the steps of one embodiment of the inventive method. A receiver transmits a data request to the air link 16, which m turn transmits the request to a sender. The sender receives the data request and transmits to the air link 16 data packets 20 with PSN=N, N+l, and N+2. The air link then transmits only data packets with PSN=N+1 and N+2 and loses the data packet 20 with PSN=N. The receiver determines that data packet with PSN=N is missing and transmits to the air link 16 a NACK message (NACK_1) listing the data packet with PSN=N . But the NACK message is also lost and the air link 16 fails to forward the NACK message to the sender. The sender, still responding to the original data request, sends data packets 20 with PSN=N+3 and N+4 of another packet group. The air link 16 transmits to the receiver the data packets with PSN=N+3 and N+4. The receiver determines again that the data packet PSN=N is missing and sends another NACK message (NACK_2) listing the missing data packet to the air link 16, which successfully forwards the NACK_2 message to the sender. In response to NACK_2 , the sender transmits the missing data packet with PSN=N to the receiver through the air link 16. Fig. 4 illustrates another embodiment of the inventive method. The receiver transmits a request for data to the air link 16, which m turn transmits the request to the sender. The sende: then sends the data packets with PSN=N, N+l to the air link 16. The air link loses data packet with PSN=N and transfers only data packet with PSN=N+1 to the receiver. The receiver transmits to the air link 16 a negative acknow edgement message (NACK_1) listing data packet with PSN=N. The sender continues to send data packet with PSN=N+2 to the air link 16, which successfully transmits the data packet to the receiver. The receiver determines (before or after receipt of a GTR packet) data packet with PSN=N is missing and thereafter transmits another negative acknowledge message (NACK_2) . However, the air link finally transmits NACK_1 to the sender, which responds by sending the data packet with PSN=N to the air link 16. The air link 16 transfers the data packet with PSN=N to the receiver. After the sender transmits the data packet (PSN=N) within a time interval less than one RTT (i.e., the predetermined time interval) , the sender receives NACK_2 requesting the same data packet (i.e , PSN=N) . Since NACK_2 was received within a time interval less than one RTT, the sender ignores NACK_2 and refuses to send the requested data packet. Thus, while there have shown and described and pointed out fundamental novel features of the invention as applied to a preferred embodiment thereof, it will be understood that various omissions and substitutions and changes m the form and details of the devices illustrated, and m their operation, may be made by those skilled m the art without departing from the spirit of the invention. For example, it is expressly intended that all combinations of those elements and/or method steps which perform substantially the same function m substantially the same way to achieve the same results are within the scope of the invention. Moreover, it should be recognized that structures and/or elements and/or method steps shown and/or described m connection with any disclosed form or embodiment of the invention may be incorporated m any other disclosed or described or suggested form or embodiment as a general matter of design choice. It is the intention, therefore, to be limited only as indicated by the scope of the claims appended hereto.

Claims: CLAIMS What is claimed is: 1. A method of transmitting data between a sender and a receiver, comprising m sequence the steps of: (a) transmitting a plurality of data packets m sequence from the sender to the receiver m response to the request; (b) determining time elapsed for each of the plurality of data packets after transmission of said each of the plurality of data packets; (c) determining by the receiver whether any of the plurality of data packets is missing; (d) transmitting a message from the receiver to the sender notifying the sender that an identified one of the plurality of the data packets is missing when the receiver has determined at least one of the plurality of data packets is missing; and (e) retransmitting from the sender to the receiver the identified one of the plurality of data packets only when the elapsed time determined for the identified one of the plurality of the data packets is greater than a predetermined time interval . 2. The method of claim 1, wherein the predetermined time interval is about one round trip time for the identified one of the plurality of data packets to travel between the sender and the receiver. 3. The method of claim 1, wherein each of the plurality of data packets of a data message is uniquely identified by a packet sequence number. 4. The method of claim 3, wherein the packet sequence numbers are arranged m consecutive order. 5. The method of claim 1, wherein the data packets are arranged m groups, each group containing at least one data packet . 6. The method of claim 5, wherein the data packets are transmitted m groups. 7. The method of claim 6, wherein each group includes a data packet with a GTR flag set for indicating the last data packet of a group. 8. The method of claim 7, wherein m step (d) the sender is notified of all missing data packets m all previously sent groups. 9. The method of claim 1, wherein step (d) further comprises the step of notifying the sender of the last data packet received by the receiver. 10. The method of claim 7, wherein step (d) further comprises the step of notifying the sender of the highest packet sequence number of the last data packet received by the receiver. 11. A system of transmitting data between a sender and a receiver, comprising: (a) means for transmitting a plurality of data packets in sequence from the sender to the receiver m response to the request; (b) means for determining time elapsed for each of the plurality of data packets after transmission of said each of the plurality of data packets; (c) means for determining by the receiver whether any of the plurality of data packets is missing; (d) means for transmitting a message from the receiver to the sender notifying the sender that an identified one of the plurality of the data packets is missing when the receiver has determined at least one of the plurality of data packets is missing; and (e) means for retransmitting from the sender to the receiver the identified one of the plurality of data packets only when the elapsed time determined for the identified one of the plurality of the data packets is greater than a predetermined time interval . 12. The system of claim 11, wherein the sender one of gateway and a server. 13. The system of claim 11, wherein the receiver is a mobile station. 14. The system of claim 13, wherein said mobile station is a mobile phone.

Inventors: GERENDAI MAGDOLNA, SZABO TAMAS, TOTH MIHALY, GERENDAI, MAGDOLNA, SZABO, TAMAS, TOTH, MIHALY
Applicants: NOKIA CORP, NOKIA INC, NOKIA CORPORATION, NOKIA INC.
Application year: 2000
Main classification: H04L1
IPC codes: H04L1