WO2002023791A2 - Retransmission for broadcast information - Google Patents
Retransmission for broadcast information Download PDFInfo
- Publication number
- WO2002023791A2 WO2002023791A2 PCT/EP2001/010126 EP0110126W WO0223791A2 WO 2002023791 A2 WO2002023791 A2 WO 2002023791A2 EP 0110126 W EP0110126 W EP 0110126W WO 0223791 A2 WO0223791 A2 WO 0223791A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- return
- broadcast
- receiving units
- unit
- scheme
- Prior art date
Links
- 239000002131 composite material Substances 0.000 claims abstract description 22
- 238000000034 method Methods 0.000 claims description 44
- 239000000872 buffer Substances 0.000 claims description 25
- 230000007480 spreading Effects 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 description 34
- 238000004891 communication Methods 0.000 description 16
- 230000008569 process Effects 0.000 description 8
- 230000001186 cumulative effect Effects 0.000 description 7
- 238000001228 spectrum Methods 0.000 description 5
- 230000009471 action Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000000926 separation method Methods 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000012552 review Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1809—Selective-repeat protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
- H04L1/1614—Details of the supervisory signal using bitmaps
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1806—Go-back-N protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1858—Transmission or retransmission of more than one copy of acknowledgement message
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/1874—Buffer management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L2001/0092—Error control systems characterised by the topology of the transmission link
- H04L2001/0093—Point-to-multipoint
Definitions
- the present invention relates to data communication systems.
- the invention relates to a method and system for reliable data transmission in radio broadcast systems .
- the aforementioned radio communications are based on peer communications and ad-hoc networking. This means that the system is not based on a hierarchical scheme with a fixed infrastructure of base stations and portable terminals that communicate with the base stations via radio signals.
- peer communications all units have identical access rights to the network. There is no centralized control that can, for example, take care of resource or connection management, or provide other support services.
- ad-hoc networks any unit can establish a connection to any other unit in range.
- Ad-hoc networks are usually based on peer-to- peer communications. To support the cable replacement scenarios as mentioned above, the data traffic over the radio interface should be very flexible. The interface must support both symmetric and asymmetric (in arbitrary direction) data traffic flows.
- BLUETOOTHTM provides a communications link having a very flexible slot structure without any multi-slot frames or the like.
- the time axis in a BLUETOOTHTM communications link is divided into slots. The various units within communication range are free to allocate the slots for transmission or reception.
- Radio communication systems for personal usage differ from radio systems like the public mobile phone network in that the former have to operate in an unlicensed band and have to deal with uncontrolled interference.
- a suitable band is the Industrial, Scientific and Medical (ISM) band at 2.45 GHz, which is globally available.
- ISM Industrial, Scientific and Medical
- the band provides 83.5 MHz of radio spectrum. Since independent radio connections will share the same spectrum, mutual interference cannot be prevented.
- communication systems apply retransmission schemes to retransmit data segments that have been received incorrectly by the receiving unit.
- ARQ automatic retransmission query
- the stop-and-wait scheme the next segment is only transmitted if the previous segment has been acknowledged.
- the go-back-N scheme N segments can be sent before the first segment is checked to ensure correct reception. If not, all N segments are retransmitted irrespective of whether they were correctly received or not.
- the selective-repeat ARQ scheme only the segment that failed is retransmitted and the receiver can request specific segments to be retransmitted. For practical reasons, the selective-repeat scheme is usually combined with a go-back-N scheme.
- the go-back-N and selective-repeat schemes can be optimized if the round-trip delay over the link is known.
- the delay is relatively constant and can be determined.
- the delay is not known and can even vary. If the radio system can transmit packets with variable length arbitrarily in the forward and backward directions, the delay can vary considerably from packet to packet. Therefore, system delay cannot be used as a parameter for the optimization of the retransmission scheme.
- a commercial radio concept calls for an efficient air protocol that requires minimum use of the radio spectrum. In particular, retransmission of segments that have already been received correctly should be prevented.
- U.S. Provisional Application No. 60/180,095 entitled "Method and apparatus for retransmission,” by J.C. Haartsen a flexible retransmission protocol based on selective-repeat ARQ is presented which takes into account the buffer size at the receiving unit. This provisional application is hereby incorporated by reference herein in its entirety.
- Broadcast systems are usually associated with familiar applications like TV broadcasting and AM/FM radio broadcasting. However, broadcast functionality can also occur on a smaller scale.
- One application is to provide for wireless audio and video in and around the home.
- Another application is information sharing between multiple laptop users in a meeting room.
- Each laptop can be equipped with an inexpensive radio interface to communicate with other laptops (or other devices like cell phones, personal digital assistants (PDAs) , and the like) .
- PDAs personal digital assistants
- a retransmission scheme can be used to provide this robustness. With an automatic retransmission scheme, the reception of each bit of information is confirmed by each receiving unit .
- a problem with ARQ protocols presented in the past is that they are intended for point-to-point applications.
- a single receiving unit informs the transmitting unit whether the transmitted data was received correctly or not. If the same information has to be transmitted to multiple receiving units, as in a broadcast application, a problem arises with the acknowledgment messages.
- the broadcast unit can of course establish multiple links, one link to each receiving unit, transmit the same data on the multiple links and carry out a retransmission protocol on each link separately. Transmitting the same information to each receiving unit separately and carrying out an ARQ scheme to each receiving unit separately is a possibility, but not an attractive one. Since all receiving units receive the same information, valuable resources in the sense of bandwidth and radio spectrum are wasted. In a broadcast situation, the transmitted data is only sent once and received by all receiving units simultaneously. To guarantee data integrity to all receiving units, each receiving unit should send a return message. Current ARQ protocols do not support this multi-acknowledgment feature.
- the terms message, packet, and segment will be used to describe various aspects of the transmission from a broadcast unit.
- the message is the largest unit transmitted and is typically fragmented into several segments which are contained in packets.
- packets and segments are implicitly referenced.
- One purpose of fragmenting the transmission is to facilitate both error correction/detection and data retransmission.
- the current invention overcomes the prior art limitations by providing an automatic retransmission protocol between one broadcast unit and a plurality of receiving units and using a broadcast ARQ protocol in the broadcast unit and receiving units.
- the broadcast unit transmits a broadcast message (using at least one packet) simultaneously to the plurality of receiving units .
- the broadcast unit receives the return messages from the plurality of receiving units and forms a composite acknowledgment from the return messages. Then, the broadcast unit retransmits at least a portion of the packet, that is not acknowledged by the composite acknowledgment, simultaneously to all of the receiving units .
- Fig. 1 shows a slotted time-division-duplex communication channel
- Fig. 2 shows a system configuration of a broadcast application
- Fig. 3 shows an example of return-slot allocation for fixed-sized packets of the invention
- Fig. 4 shows an example of return-slot allocation for variable-sized packets of the invention
- Fig. 5 shows an example of return-time allocation if no slotting is assumed
- Fig. 6 shows an illustration of a broadcast retransmission scheme combined with the stop-and-wait ARQ protocol of the invention
- Fig. 7 shows an illustration of a broadcast retransmission scheme combined with the go-back-N ARQ protocol of the invention
- Fig. 8 shows an illustration of a broadcast retransmission scheme combined with the selective-repeat ARQ protocol of the invention
- Fig. 9a shows an illustration of a broadcast retransmission scheme combined with an alternative selective-repeat ARQ protocol of the invention
- Fig. 9b shows an illustration RX buffer contents of the alternative selective-repeat ARQ protocol presented in Fig. 9a; and Fig. 10 shows a flowchart illustrating a broadcast ARQ method of the invention.
- any such form of embodiment may be referred to herein as "logic configured to” perform a described action, or alternatively as “logic that” performs a described action.
- the invention provides an automatic retransmission protocol between one broadcast unit and a plurality of receiving units.
- the broadcast unit transmits a message containing information, which may consist of multiple packets and segments.
- Each receiving unit is assigned a return window.
- the return window position is related to the end of the transmitted information packet or some other reference. Thereby, each receiving unit can return acknowledgment of the packet.
- Different receiving units use different return windows so that the return messages are received by the broadcast unit unambiguously (i.e., the broadcast unit knows which receiving unit sent which return message) .
- the allocation of the return windows takes place when the broadcast link is established. Additional receiving units can optionally be added to an existing broadcast channel by simply assigning the new receiving unit a return window not yet used.
- the receiving units each return their respective return message consecutively in time or in some other unambiguous manner, such as by assigning a different channel to each receiving unit .
- channels can be defined by any number of strategies including, but not limited to, Frequency Division Multiple Access (FDMA) , Time Division Multiple Access (TDMA) , and Code Division Multiple Access (CDMA) .
- FDMA Frequency Division Multiple Access
- TDMA Time Division Multiple Access
- CDMA Code Division Multiple Access
- the scheme of multiple receiving units can be combined with the different basic ARQ schemes.
- the herein-described broadcast ARQ protocol differs for the different basic ARQ schemes in the way the return information is combined.
- For the stop-and-wait ARQ scheme a packet is retransmitted when at least one receiving unit has not acknowledged the reception. Retransmission can be overruled if the life time of the packet has expired, or the considered receiving unit has a lower quality of service.
- the go-back-N ARQ protocol the lowest cumulative acknowledge is used to decide which sequence of segments to retransmit .
- all retransmit requests are collected, identical requests from different receiving units are treated as one request, and for each request, a retransmission is carried out .
- all of the specific ARQ schemes share the common features of a composite acknowledgment formed from the individual acknowledgments of the various receiving units.
- the broadcasting unit creates the composite acknowledgment from the individual acknowledgments. Then, the broadcasting unit forms its retransmission response based on the composite acknowledgment as required by the particular ARQ scheme.
- time-slotted channel 104 time is divided into equally sized time slots 100, as shown in Fig. ' l.
- Time line 106 shows a transmission pattern from unit A
- time line 108 shows a transmission pattern from Unit B.
- Unit A transmits information in blocks 120, 122, 124, and 126.
- Unit B transmits information in blocks 130, 132, 134 and 136.
- Time slots 100 are generally applied in digital radio systems since they provide support for low-power modes and simplify synchronization procedures.
- the radio transmissions sent over the air interface may cover multiple time slots. However, the transmission must always start at the time slot boundary. For example block 120 starts at time slot boundary 110 and continues to transmit over more than two time slots .
- Fig. 2 is a block diagram of an embodiment of a radio broadcast system configuration.
- One broadcast unit A broadcasts the information 55 to a number of other units B, C, and D.
- Units A to D can, for example, be laptops where the user of laptop A wants to send a document to the users of laptops B, C, and D.
- Each return link 65, 75, and 85 is to provide the broadcast unit with return messages .
- each segment is equipped with parity bits (e.g., Cyclic Redundancy Check) to enable the receiving unit to check for errors .
- parity bits e.g., Cyclic Redundancy Check
- the broadcast unit A has a transceiver that transmits broadcast packets simultaneously to the receiving units B, C, and D and receives return messages from the receiving units B, C, and D.
- the broadcast unit A also contains logic configured to implement an ARQ scheme, logic configured to assign return windows to corresponding receiving units B, C, and D, logic configured to form a composite acknowledgment from the return messages and logic configured to retransmit at least a portion of the packet, that is not acknowledged by the composite acknowledgment .
- the receiving units B, C, and D each have a transceiver that receives the packets and transmits return messages during the return window to the broadcast unit A. Additionally, the receiving units B, C, and D each have logic configured to implement the ARQ scheme and logic configured to accept a return window assignment from the plurality of return windows assigned by broadcast unit A. Preferably each of the receiving units B, C, and D also has a circuit that places the receiving unit in a low power mode and a RX buffer. Both items are not shown in Fig. 2, but are well known in the art .
- a broadcast ARQ protocol with multiple receiving units is shown wherein the broadcast message is sent in fixed-sized packets (covering a fixed number of slots) .
- unit A is the broadcasting unit and units B, C, and D are the receiving units.
- all units A, B, C, and D transmit and receive data.
- Each receiving unit B, C, and D is allocated a return window in which it can place its return message 321, 322, and 323, respectively, based on the results of the error checking.
- all receiving units B, C, D are informed not only of their own return window, but also of the return windows of the other receiving units. For example, unit B is informed of its return window in time slot 4.
- unit B is informed of the return windows for units C and D, respectively. In this way, unit B can save additional power consumption by not listening to the return windows reserved for the return messages 322, 323 for the other receiving units.
- the broadcast packet 320 is sent in a frame 310 of nine time slots 0-8.
- the frame 310 consists of a broadcast packet that covers four broadcast time slots 0-3, three return windows in time slots 4-6, respectively, and two empty time slots 7 and 8.
- receiving units B, C, and D are allocated return windows as time slots 4, 5 and 6, respectively, in order to return their return messages.
- the broadcast packets 320, 330, 340, 350, and 360 require a data rate consistent with four out of nine time slots.
- the empty time slots may be used to increase the broadcast rate, or to add two more receiving units that can use the remaining time slots 7, 8 as return windows.
- broadcast packets 330, 340, 350, and 360 have corresponding return messages 331-333, 341-343, 351-353, and 361-363, from receiving units B, C, and D, respectively.
- the broadcast packet size is not constant. This can be the case, for example, if the broadcast packet is data or compressed video. In this scenario, there are no fixed-sized frames, and therefore no fixed allocation of return windows in fixed time slots. Instead, the return window allocation depends on the end of the broadcast packet 410, 420, 430, 440, 450.
- the offset can have an arbitrary integer value greater than or equal to zero.
- the offset may provide a dead zone (overhead) which may be required in the system for processing time (i.e. to switch from transmit to receive or vice versa) . In Fig. 4, the offset is zero.
- the location of the return windows is related to the end of the broadcast packet and therefore varies as the broadcast packet length varies. If no slotting is used, the same relative positioning concept can be used (for fixed or variable sized broadcast packets) .
- the broadcast packet 410 is transmitted from unit A. Subsequently, return messages 411, 412 and 413 are sent by receiving units B, C and D respectively. The process is repeated wherein broadcast packets 420, 430, 440, and 450 have corresponding return messages 421-423, 431-433, 441-443, and 451-453, from receiving units B, C, and D, respectively. In each case the return messages begin in the time slot immediately after the end of the broadcast packet, because the offset is zero for this example. In Fig. 5, a system is shown with no fixed time slot.
- unit B is allowed to transmit its return message 511 in a return window defined by the interval between tO+offset and tO+offset+T_return .
- the offset is an arbitrary delay between the end of the broadcast packet 510 and the start of first return window 515, and T_return is the time allocated for each return window to transmit an return message 511 (e.g. acknowledging successful receipt of the packet) .
- Unit C is allowed to return a return message 512 in the return window starting at time 516 defined by the interval between tO+offset+T_return and tO+offset+2*T_return .
- unit D is allowed to return a return message 513 in the return window starting at time 517 defined by the interval between tO+offset+2*T_return and t0+offset+3*T_return .
- broadcast packet 520 has corresponding return messages 521, 522 and 523, transmitted from receiving units B, C, and D, respectively.
- the return messages begin after a time delay after the end of the broadcast packet, because the offset is not zero for this example.
- the return messages 511-513 and 521-523 are transmitted during their respective return windows, but do not necessarily occupy the entire return window.
- the applied scheme of multiple return windows for ACK (acknowledgment) or NAK (negative acknowledgment) messages can be applied to the various basic ARQ schemes.
- ACK acknowledgenowledgment
- NAK negative acknowledgment
- the embodiment shown is a broadcast stop-and-wait ARQ scheme.
- the broadcast unit A keeps repeating its packet until all the receiving units B, C, and D have at least once confirmed the reception of this segment .
- a receiving unit may or may not confirm the retransmission (s) , but this has no impact on the procedure.
- broadcast packet 610 contains payload X and is transmitted by broadcast unit A.
- Receiving units B, C, and D all transmit return messages 611, 612, and 613, respectively, acknowledging (ACK) successful receipt of payload X.
- ACK acknowledging
- a composite acknowledgment formed from the individual receiving units return messages would indicate no retransmission is necessary.
- broadcast packet 620 containing payload Y is transmitted by broadcast unit A.
- Receiving units B and D transmit return messages 621 and 623 acknowledging (ACK) successful receipt of payload Y by units B and D.
- receiving unit C transmits a return message 622 containing a negative acknowledge (NAK) indicating payload Y was not successfully received.
- NAK negative acknowledge
- Broadcast unit A then retransmits payload Y in broadcast packet 630.
- Receiving units C and D transmit return messages 632 and 633 acknowledging (ACK) successful receipt of payload Y by units C and D.
- this time receiving unit B transmits return message 631 containing a negative acknowledge (NAK) indicating payload Y was not successfully received.
- NAK negative acknowledge
- the composite acknowledgment formed from this set of return messages would indicate no retransmission is necessary, since all receiving units B, C, and D have at least once ACKed receiving payload Y correctly. Therefore broadcast unit A continues with broadcast packet 640 containing payload Z. Subsequently, receiving units B, C, and D all transmit return messages 641, 642, 643 respectively, acknowledging (ACK) successful receipt of payload Z .
- a broadcast ARQ protocol is shown for a go-back-N ARQ scheme with N equal to five.
- the broadcast packets 710, 720, 730, 740 from broadcast unit A are each fragmented into segments and each segment is numbered sequentially (e.g. 0, 1, 2, ...) .
- the receiving unit return message returns the number of the highest numbered segment that was correctly received in sequence.
- the broadcast unit A collects the acknowledgment information from each receiving unit and generates a composite acknowledgment that contains the lowest number contained in the return messages and starts to retransmit segments based on that number.
- the first transmission of broadcast packet 710 contains segments 0, 1, 2, 3, and 4.
- Receiving units B and D have received segments in sequence up to number 3 and thus return messages 711 and 713 acknowledges segment 3. However receiving unit C only received in sequence segments up to number 2. Therefore, receiving unit C transmits return message 712 acknowledging segment 2.
- the broadcast unit A takes the lowest cumulative segment number, namely 2 from receiving unit C, and transmits segments in sequence, beginning with segment 3. After the second transmission 720 of segments 3,4,5,6,7, receiving units B, C, and D transmit return messages 721, 722, and 723 acknowledging sequential receipt of segments. up to segments 7, 4, and 6 respectively.
- the broadcast unit A takes the lowest cumulative segment number, 4 from receiving unit C, and transmits segments in sequence, beginning with segment 5.
- the broadcast unit A takes the lowest cumulative segment number, 8 from receiving unit D, and transmits segments 9 and higher in sequence .
- the fourth transmission 740 containing segments 9, 10, 11, 12, 13 receiving units B, C, and D transmit return messages 741, 742, and 743 acknowledging sequential receipt of segments up to segments 9, 9, and 9 respectively.
- the process continues by broadcast unit A creating a composite acknowledgment that contains the lowest cumulative segment number and retransmitting the next and higher segments. If one of the receiving units does not update the cumulative segment number by a return message, its last received cumulative segment number is preferably used.
- a broadcast ARQ protocol is shown for a general selective-repeat ARQ scheme with a transmit frame of ten segments.
- Each broadcast packet 810, 820, 830 from broadcast unit A contains ten segments and each segment is numbered sequentially (e.g., 0-9) .
- receiving units B, C, and D request particular segments to be retransmitted via return messages 811, 812, and 813, respectively.
- unit B's retransmission request includes an identification of segment 3. Therefore, segment 3 will be among those that are retransmitted.
- multiple requests for the same segment are treated as one request.
- segment 4 is treated as one request .
- Segment 4 will therefore be retransmitted only once.
- the broadcast unit A retransmits segments 3 and 4 and the next sequence of segments beyond the first transmission 810, up to a total of ten segments.
- the second transmission, packet 820 contains ten segments, specifically, segments 3, 4 and 10-17.
- unit B requests segment 10, whereas both units C and D request segment 12.
- Segments 10 and 12 are retransmitted in the third transmission, packet 830.
- the next sequential data segments fill in the remainder of the ten segment transmission. Specifically, since segment 17 was the last segment to be transmitted in the second transmission, segments 18-25 fill in the remainder of the ten segment broadcast packet .
- the modified ARQ protocol (hereafter REQ-BMS ARQ) presented in "Method and apparatus for retransmission," by J.C. Haartsen, U.S. Provisional Application No. 60/180,095 is applied to the broadcasting ARQ protocol .
- the REQ-BMS ARQ method presented in the referenced disclosure operates as a function of the RX buffer size of the receiving unit.
- the broadcasting unit A should only send that amount of new segments that the receiving unit RX buffer can contain.
- the receiving units B, C, and D indicate with a request acknowledgment REQ_ACK which segments have been received in order, and also indicates with a bit map BMS, which segments after the REQ_ACK have failed.
- REQ-BMS ARQ the modified ARQ protocol
- the receiving units transmit REQ_ACKs which indicate that all segments with a sequence number lower than that indicated in the REQ_ACK have succeeded. Consequently, the segment indicated in the REQ_ACK has failed.
- the receiving unit can indicate whether segments REQ_ACK+1, REQ_ACK+2 and REQ__ACK+3 were correctly received or not.
- the different receiving units may have different RX buffers sizes. It is preferred that the modified ARQ scheme be based on the size of the shortest RX buffer among the receiving units.
- the receiving units can indicate the failure or successful receipt of individual segments with REQ_ACK and BMS.
- the broadcast unit combines all of this information and identifies which segment or segments require (s) retransmission. Multiple requests from several receiving units for retransmission of the same segment will result in only one retransmission of this segment.
- the different receiving units may have different RX buffers sizes. It is preferred that the REQ-BMS ARQ scheme be based on the size of the shortest RX buffer among the receiving units.
- receiving units B, C, and D have RX buffers 902, 904, and 906 having sizes of eight, seven, and seven segments, respectively.
- the minimum RX buffer size of seven segments is used as the maximum ARQ window in this broadcast ARQ protocol .
- the first transmission of broadcast packet 910 contains seven segments, namely segments 0-6.
- a similar analysis can be given for receiving units C and D.
- the buffer contents of the three receiving units B, C, and D are shown, in Fig. 9b, after reception of the broadcast packet. As soon as segments have correctly been received in order, they are removed from the RX buffer (after the first broadcast packet transmission, units B and D have received correctly all segments up to number 3, and therefore segments 0 to 3 have been removed from RX buffers 902 and 906; for unit C, segments 0 to 4 have been received correctly and removed from the RX buffer 904) .
- segment 4 (requested by units B and D)
- segment 5 (requested by units B and C)
- segment 4 has not been acknowledged yet by all receiving units and the ARQ window is seven
- the broadcast unit A cannot continue with segments 11 and higher.
- Unit A must retransmit the negative acknowledged segments before it can continue. This results in the variation of the broadcast packet length.
- the ARQ window remains constant at seven, as being the minimum RX buffer size (904 and 906) among the receiving units B, C, and D.
- the RX buffers 902, 904, and 906 wrap around the end. Therefore, the position of the segments inside the RX buffer depends on the buffer size and how many segments were previously successfully transmitted.
- broadcast unit A In the second transmission, broadcast unit A retransmits segments 4, 5, and transmits new segments 7 through 10. Consequently, broadcast packet 920 contains only 6 segments, segments 4, 5, 7, 8, 9, 10. Segment 6 is not retransmitted because all receiving units have successfully acknowledged receipt of segment 6.
- the broadcast unit A In the third transmission, the broadcast unit A retransmits segments 7, 8, and 10 and transmits new segments 11 through 13. Consequently, broadcast packet 930 again contains only 6 segments, segments 7, 8, 10, 11, 12, and 13.
- the broadcast unit A retransmits segments 7, 8, 10, and 12.
- Broadcast packet 940 contains only 4 segments, segments 7, 8, 10, and 12.
- broadcast unit A In the fifth transmission, the broadcast unit A retransmits segments 7 and 10. Consequently, broadcast packet 950 contains only 2 segments, segments 7 and 10. Receiving units C and D have received all segments up to 13 correctly and have emptied their buffers and request for segments 14 and higher. Since segment 7 has not been acknowledged by all receiving units and the ARQ window size is seven, the broadcast unit cannot continue with segments 14 and higher.
- the broadcast unit may adapt the ARQ window depending on the receiving unit that requests retransmissions. Since the return slot is associated with the receiving unit, the broadcast unit knows exactly which receiving unit is requesting what segment . This may speed up the throughput . For example, in Fig. 9b, after the fourth transmission, it is clear that unit B with the longer RX buffer 902 is halting the progress of transmission. However, there is still one open position in unit B's RX buffer 902 since its RX buffer size is eight whereas the ARQ window is seven. In the fifth transmission, the broadcast unit could have increased the ARQ window size to eight without problems (i.e., segment 14 could be transmitted) .
- a flowchart illustrating a broadcast ARQ method of the invention begins by a broadcast unit assigning return windows to a plurality of receiving units in step 1010.
- the receiving units accept the return windows assigned to each in step 1015.
- the broadcast unit then transmits its broadcast message (using at least one packet) in step 1020.
- Each of the receiving units receives the packet and transmits a return message in its assigned return window in steps 1025 and 1035, respectively.
- steps 1045 and 1055 optionally, if a low power mode is available and enabled in a receiving unit, that receiving unit will go into a low power mode during the return windows of the other receiving units to conserve energy.
- the return messages will be formatted in accordance with an ARQ scheme such as described in the examples above.
- the broadcast unit receives the return messages from the receiving units and forms a composite acknowledgment based on the ARQ scheme used. If all receiving units acknowledge successful receipt of the packet, no retransmission is necessary in step 1050. However, in step 1050, if all units have not successful received the packet , then based on the composite acknowledgment formed by the broadcast unit, the data segments not received will be included for retransmission with the subsequent packet in step 1060.
- process may be modified in many ways without departing from the scope of the invention. For example, periodic checking of the local units may be used to identify when new receiving units are available and/or when existing receiving units are no longer available.
- process could dynamically adjust the ARQ scheme used based on the amount of segments not received correctly.
- Still another variation could include a further process for allowing the broadcast unit to become a receiving unit and one of the receiving units to become the broadcast unit. Many such variations are known for forming ad hoc networks and will be appreciated by those skilled in the art .
- the broadcast unit may also differentiate between different receiving units.
- the return channel indicates which receiving unit requests retransmissions. If the receiving unit is considered by the broadcast unit to be of lower importance, the broadcast unit may ignore the request, or restrict the number of retransmissions induced by this receiving unit .
- the return channels shown in the previous description were based on slots in time. In other embodiments, these channels can equally well consist of another nature such as frequency or code division.
- the return windows could be assigned cooperatively among the receiving units.
- the broadcast unit could, for example, receive a return message containing an identifying portion, in addition to the acknowledgment, that identifies the receiving unit. In this system the broadcast unit would not be involved in assigning return windows.
- the return message will always lag the broadcast message (or packets) , but the separation of the return messages need not include separation in time. As long as the channels are orthogonal, they do not mutually interfere.
- the invention may be practiced by using any appropriate return message transmission method. For example, in using CDMA, it is contemplated that communication between broadcast unit and receiving units will be conducted using a spread-spectrum technique. By transmitting and receiving using different spreading codes, the broadcast unit can identify the return messages from each of the receiving units.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
AU2001295533A AU2001295533A1 (en) | 2000-09-12 | 2001-09-03 | Retransmission for broadcast information |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US66040900A | 2000-09-12 | 2000-09-12 | |
US09/660,409 | 2000-09-12 |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2002023791A2 true WO2002023791A2 (en) | 2002-03-21 |
WO2002023791A3 WO2002023791A3 (en) | 2002-09-19 |
Family
ID=24649429
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2001/010126 WO2002023791A2 (en) | 2000-09-12 | 2001-09-03 | Retransmission for broadcast information |
Country Status (2)
Country | Link |
---|---|
AU (1) | AU2001295533A1 (en) |
WO (1) | WO2002023791A2 (en) |
Cited By (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2378363A (en) * | 2001-04-25 | 2003-02-05 | Nec Corp | Retransmission of Multiplexed Digital Broadcasts following Demodulation Failure |
WO2004091219A1 (en) * | 2003-04-05 | 2004-10-21 | Koninklijke Philips Electronics N.V. | Repairing broadcast dropout |
WO2005109728A1 (en) * | 2004-05-10 | 2005-11-17 | Telecom Italia S.P.A. | Method and system for efficient distribution of multicast service in a mobile network |
WO2008142169A1 (en) * | 2007-05-24 | 2008-11-27 | Thomson Licensing | Method for transmitting data packets and corresponding reception method |
EP1881640A3 (en) * | 2006-07-17 | 2009-05-27 | Robert Bosch GmbH | Method and system for overlapping multiple schedules of broadcast and acknowledgement collection |
DE102008003588A1 (en) | 2008-01-09 | 2009-07-23 | Deutsches Zentrum für Luft- und Raumfahrt e.V. | Method for terrestrial or broadcasting-transmission of information from broadcasting transceiver station to terminal, for e.g. video streaming application, involves calculating modulo-two-sum for previous correctly received data packets |
EP1940054A3 (en) * | 2006-12-26 | 2009-10-14 | Fujitsu Limited | System for receiving and storing broadcast content, and device for reception and storage |
EP2360598A1 (en) * | 2010-02-12 | 2011-08-24 | Blue Wonder Communications GmbH | Method and device for synchronizing data broadcasts |
US9419813B2 (en) | 2006-04-18 | 2016-08-16 | Thomson Licensing | Method and device for transmitting data to several receivers using ARQ |
CN114520711A (en) * | 2020-11-19 | 2022-05-20 | 迈络思科技有限公司 | Selective retransmission of data packets |
EP4002734A1 (en) * | 2020-11-19 | 2022-05-25 | Mellanox Technologies, Ltd. | Selective retransmission of packets |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2287383A (en) * | 1994-03-11 | 1995-09-13 | Motorola Ltd | Notification by energy burst of messages with unacceptable quality |
-
2001
- 2001-09-03 AU AU2001295533A patent/AU2001295533A1/en not_active Abandoned
- 2001-09-03 WO PCT/EP2001/010126 patent/WO2002023791A2/en active Application Filing
Cited By (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7339954B2 (en) | 2001-04-25 | 2008-03-04 | Nec Electronics Corporation | Multiplexing digital broadcast method that can establish a technique which can perfectly obtain a multiplexing digital broadcast data |
GB2378363A (en) * | 2001-04-25 | 2003-02-05 | Nec Corp | Retransmission of Multiplexed Digital Broadcasts following Demodulation Failure |
WO2004091219A1 (en) * | 2003-04-05 | 2004-10-21 | Koninklijke Philips Electronics N.V. | Repairing broadcast dropout |
WO2005109728A1 (en) * | 2004-05-10 | 2005-11-17 | Telecom Italia S.P.A. | Method and system for efficient distribution of multicast service in a mobile network |
US7701893B2 (en) | 2004-05-10 | 2010-04-20 | Telecom Italia S.P.A. | Method and system for efficient distribution of multicast services in a mobile network |
US9419813B2 (en) | 2006-04-18 | 2016-08-16 | Thomson Licensing | Method and device for transmitting data to several receivers using ARQ |
US7738455B2 (en) | 2006-07-17 | 2010-06-15 | Robert Bosch Gmbh | Method and system of overlapping multiple schedules for broadcast and acknowledgement collection |
EP1881640A3 (en) * | 2006-07-17 | 2009-05-27 | Robert Bosch GmbH | Method and system for overlapping multiple schedules of broadcast and acknowledgement collection |
US8279342B2 (en) | 2006-12-26 | 2012-10-02 | Fujitsu Limited | System for receiving and storing broadcast content, and device for reception and storage |
EP1940054A3 (en) * | 2006-12-26 | 2009-10-14 | Fujitsu Limited | System for receiving and storing broadcast content, and device for reception and storage |
FR2916598A1 (en) * | 2007-05-24 | 2008-11-28 | Thomson Licensing Sas | METHOD FOR TRANSMITTING DATA PACKETS AND CORRESPONDING RECEPTION METHOD |
WO2008142169A1 (en) * | 2007-05-24 | 2008-11-27 | Thomson Licensing | Method for transmitting data packets and corresponding reception method |
DE102008003588A1 (en) | 2008-01-09 | 2009-07-23 | Deutsches Zentrum für Luft- und Raumfahrt e.V. | Method for terrestrial or broadcasting-transmission of information from broadcasting transceiver station to terminal, for e.g. video streaming application, involves calculating modulo-two-sum for previous correctly received data packets |
EP2360598A1 (en) * | 2010-02-12 | 2011-08-24 | Blue Wonder Communications GmbH | Method and device for synchronizing data broadcasts |
CN102170344A (en) * | 2010-02-12 | 2011-08-31 | 布鲁旺德通讯有限公司 | Method and device for synchronous data broadcasting |
US9189445B2 (en) | 2010-02-12 | 2015-11-17 | Intel Mobile Communications GmbH | Method and device for synchronizing data broadcasts for system-on-chip |
CN105808494A (en) * | 2010-02-12 | 2016-07-27 | 英特尔移动通信技术德累斯顿有限公司 | Method and device for synchronizing data broadcasts |
CN105808494B (en) * | 2010-02-12 | 2020-01-03 | 英特尔移动通信技术德累斯顿有限公司 | Method and apparatus for synchronizing data broadcast |
CN114520711A (en) * | 2020-11-19 | 2022-05-20 | 迈络思科技有限公司 | Selective retransmission of data packets |
EP4002734A1 (en) * | 2020-11-19 | 2022-05-25 | Mellanox Technologies, Ltd. | Selective retransmission of packets |
US11870590B2 (en) | 2020-11-19 | 2024-01-09 | Mellanox Technologies, Ltd. | Selective retransmission of packets |
CN114520711B (en) * | 2020-11-19 | 2024-05-03 | 迈络思科技有限公司 | Selective retransmission of data packets |
Also Published As
Publication number | Publication date |
---|---|
WO2002023791A3 (en) | 2002-09-19 |
AU2001295533A1 (en) | 2002-03-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP7273937B2 (en) | Enhanced Uplink Transmission with TTI Bundling | |
US6996100B1 (en) | Method and system for medium access on a radio channel | |
US6928085B2 (en) | System and method for providing quality of service and contention resolution in ad-hoc communication systems | |
RU2485700C2 (en) | Method for cyclic distribution of band width with provision of possibility of hybrid automatic repeat request | |
JP4708492B2 (en) | System, method and apparatus for determining whether data has arrived correctly from a source to a destination in a time division multiplexing (TDM) communication network | |
US7054316B2 (en) | Method and system for interlayer control between re-sequencing and retransmission entities | |
US8248973B2 (en) | Method for operation of synchronous HARQ in a wireless communication system | |
US8320341B2 (en) | Re-transmission capability in semi-persistent transmission | |
EP1695462B1 (en) | Transmitting and receiving control protocol data unit having processing time information | |
EP1133094B1 (en) | Dynamic assignment of retransmission slots in wireless communication links | |
US7260073B2 (en) | Method for scheduling of plural packet data flows | |
EP1307990A2 (en) | Flexible arq for packet data transmission | |
JP2011530943A (en) | Data retransmission resource allocation method and apparatus for wireless communication system | |
WO2021032018A1 (en) | Feedback information transmission method and apparatus | |
US10530538B2 (en) | Hybrid automatic repeat request method and system | |
US20070277073A1 (en) | Communication device, communication system, method of operating a communication device and ARQ feedback message | |
WO2002023791A2 (en) | Retransmission for broadcast information | |
EP3790213B1 (en) | Mac-based hybrid automatic repeat request (harq) | |
EP1598973A1 (en) | Method and device of radio resource allocation | |
CN113169822A (en) | Method and apparatus for transmitting data based on HARQ | |
CN112738845B (en) | Design method of one-shot indication for HARQ feedback in NR-U system | |
CN110958682B (en) | Method and device for point-to-point physical layer communication in ad hoc network, sending UE (user equipment) and receiving UE | |
JP5121660B2 (en) | Transmission method and transmission apparatus for communication system | |
JPWO2020031277A1 (en) | Transmitters, receivers, wireless communication systems, and communication methods |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A2 Designated state(s): AE AG AL AM AT AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ CZ DE DE DK DK DM DZ EC EE EE ES FI FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PH PL PT RO RU SD SE SG SI SK SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
AK | Designated states |
Kind code of ref document: A3 Designated state(s): AE AG AL AM AT AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ CZ DE DE DK DK DM DZ EC EE EE ES FI FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PH PL PT RO RU SD SE SG SI SK SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A3 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
122 | Ep: pct application non-entry in european phase | ||
NENP | Non-entry into the national phase |
Ref country code: JP |