WO2004114610A1 - 無線パケット通信方法 - Google Patents
無線パケット通信方法 Download PDFInfo
- Publication number
- WO2004114610A1 WO2004114610A1 PCT/JP2004/008912 JP2004008912W WO2004114610A1 WO 2004114610 A1 WO2004114610 A1 WO 2004114610A1 JP 2004008912 W JP2004008912 W JP 2004008912W WO 2004114610 A1 WO2004114610 A1 WO 2004114610A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- packet
- transmission
- wireless
- parallel
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims description 207
- 238000004891 communication Methods 0.000 title claims description 72
- 230000005540 biological transmission Effects 0.000 claims abstract description 548
- 238000012545 processing Methods 0.000 claims description 109
- 230000008569 process Effects 0.000 claims description 65
- 230000001629 suppression Effects 0.000 claims description 47
- 230000004044 response Effects 0.000 claims description 35
- 230000001186 cumulative effect Effects 0.000 claims description 31
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 description 27
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 description 27
- 230000000694 effects Effects 0.000 description 8
- 241001061260 Emmelichthys struhsakeri Species 0.000 description 6
- 230000008859 change Effects 0.000 description 6
- 238000012790 confirmation Methods 0.000 description 6
- 230000007423 decrease Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 238000001514 detection method Methods 0.000 description 4
- 230000006872 improvement Effects 0.000 description 3
- 238000011084 recovery Methods 0.000 description 3
- 241000020719 Satsuma Species 0.000 description 1
- 238000009825 accumulation Methods 0.000 description 1
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 239000000969 carrier Substances 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
-
- 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/02—Arrangements for detecting or preventing errors in the information received by diversity reception
- H04L1/06—Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
-
- 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/1887—Scheduling and prioritising arrangements
-
- 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/1893—Physical mapping arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/26—Systems using multi-frequency codes
- H04L27/2601—Multicarrier modulation systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/14—Two-way operation using the same type of signal, i.e. duplex
- H04L5/143—Two-way operation using the same type of signal, i.e. duplex for modulated signals
-
- 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/0096—Channel splitting in point-to-point links
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/04—Error control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
Definitions
- the present invention relates to a wireless packet communication method for transmitting a plurality of data packets in parallel by using a plurality of wireless channels and space division multiplexing between wireless stations, and in particular, to a retransmission process when data packets are not properly transmitted.
- Wireless communication method Background art
- the conventional wireless bucket communication method only one wireless channel to be used is determined in advance, and prior to the transmission of the data bucket, it is detected (carrier sense) whether the wireless channel is idle or not, Only one data packet was sent when the channel was idle.
- one radio channel can be shared by a plurality of radio stations at different time intervals ((IEEE 802. 11 "MAC and PHY Specification for Metropolitan Area Networks", IEEE 802. 11, 1998, (2) Low Power Data Communication System / Wideband Mobile Access System (CS MA) standard, ARIB SDT-T71 1.0 version, (Corp., Japan Radio Industry Association, formulated in 2000).
- a wireless packet communication method of transmitting a plurality of data packets in parallel using the plurality of wireless channels is used. It is being considered. In this method, for example, for three data packets, if there are two idle radio channels, two non-functioning channels are used to transmit two of three data buckets in parallel. Do. For two data packets, if there are three idle radio channels, all (two) data packets are sent in parallel using two radio channels.
- radio channel # 1 and radio channel # 2 are close to each other, and the transmission required time of data packets transmitted in parallel from each radio channel is different.
- radio channel # 2 since the data packet transmitted from radio channel # 1 is short, radio channel # 2 is being transmitted when the A Ck bucket for that is received. Therefore, in radio channel # 1, there is a possibility that the leaked power from radio channel # 2 can not receive an ACK packet. In such a situation, improvement in throughput can not be expected even if parallel transmission is performed using multiple radio channels simultaneously.
- the data size of the data frame input from the network is not constant. Therefore, when the input data frame is sequentially converted into data packets and transmitted, the bucket length (transmission required time) of each data bucket also changes. Therefore, even if a plurality of data packets are transmitted in parallel as shown in FIG. 48, the bucket length of each data bucket is different, and the possibility of failure to receive an ACK packet increases.
- the data frame is divided as shown in Fig. 49 (1) to generate two data packets.
- data frame 2 is divided and combined with data frame 1 and data frame 3 as shown in Figure 4 9 (2).
- data frame 1 and data frame 2 are combined, dummy bits are added to data frame 3, and two data packets with uniform packet length are generated.
- the transmission rate of each wireless channel is different, adjust the size ratio of each data bucket to correspond to the transmission rate ratio so that the bucket length becomes the same.
- the transmitting side determines that transmission of the data packet has failed, and retransmits the data packet. [Issue 1 for resending]
- the number of idle radio channels may be reduced at retransmission.
- two data packets to be retransmitted are divided into two and transmitted.
- it is not always possible to transmit continuously which causes decrease in throughput, increase in average transmission delay and increase in jitter. there is a possibility.
- Fig. 52 shows the conventional retransmission method 1.
- the number of data packets that can be transmitted in parallel is 3 and does not change at the transmission timings t 1, t 2 and t 3 obtained by carrier sense.
- the transmitting radio station A generates data packets P i, p 2 and P 3 from the data frame F 1 and generates data packets P 4, P 5 and P 6 from the data frame F 2.
- P1 to P6 correspond to the sequence numbers of the respective data packets.
- the no f fountain station A transmits data buckets P 1 to P 3 in parallel at transmission timing 1 1. After that, the transmission success of data packets P1 and P3 and the transmission failure of data packet P2 are confirmed by an ACK packet from the receiving side.
- the wireless station A determines that the data frame F 1 can not be recovered due to the transmission failure of the data packet P 2, and at the next transmission timing t 2, all the data packets P 1 to P 3 corresponding to the data frame F 1 resend. At this time, data packets P1 and P3 are successfully received. Even though, they will be sent again. If, on the other hand, data packet P1 fails to transmit, data packets P1 to P3 are retransmitted again at the next transmission timing t3.
- the transmitting side radio station A transmits a plurality of data packets constituting a data frame in parallel, if transmission of part of the data packets fails, a plurality of data packets constituting the same data frame will be paralleled again. resend. That is, since data packets that were successfully transmitted will also be retransmitted, it is necessary to reduce the throughput efficiency as well as the channel utilization efficiency.
- FIG. 53 shows the conventional retransmission method 2.
- the number of data packets that can be transmitted in parallel is 3 and does not change at the transmission timings t 1, t 2 and t 3 obtained by carrier sense.
- the transmitting radio station A generates data packets P 1, P 2 and P 3 from the data frame F 1 and generates data buckets P 4, P 5 and P 6 from the data frame F 2.
- the transmission time required for the data packets P1 to P6 is equal.
- Radio station A transmits data packets P 1 to P 3 in parallel at transmission timing 1 1. After that, the transmission success of the data packets P 1 and P 3 and the transmission failure of the data packet P 2 are confirmed by the ACK packet from the receiving side. Then, at the next transmission timing t 2, since it is not efficient to retransmit only the data packet P 2 for which transmission failed, the data packets P 4 and P 5 generated simultaneously are transmitted in parallel. After that, the transmission success of the data packet P 4 and P 5 and the transmission failure of the data bucket P 2 are confirmed by the ACK packet from the receiving side. Then, at the next transmission timing t 3, the data packet P 2 for which transmission failed again and the data packet P 6 are newly transmitted in parallel. After that, by the ACK bucket from the receiving side, the successful transmission of data bucket P 6 and data packet Check transmission failure of P2.
- the reception side is held to hold the data frames F 2, F 3, ... sequentially restored until the transmission of the data packet P 2 succeeds and the data frame F 1 is restored.
- the size of the reception buffer at the wireless station must be increased.
- An object of the present invention is a retransmission method that can improve throughput in retransmission processing while taking advantage of parallel transmission. Furthermore, when multiple data buckets are generated from data frames and parallel transmission is performed, it is easier to restore data frames including retransmitted data packets while improving throughput in retransmission processing. It is a retransmission method to make Disclosure of the invention
- the invention of claim 1 is characterized in that re-transmission of data buckets is failed between two radio stations.
- the number of radio channels determined to be free by carrier sense is compared with the number of retransmission packets. Then, only when the two are different or when the number of vacant channels is larger than the number of buckets for retransmission, the retransmission packet is reconstructed according to the number of vacant channels, and each reconstructed packet is used as an idle radio channel. Use to send in parallel.
- the invention according to claim 2 is characterized in that, when performing retransmission processing due to a data packet transmission failure between two radio stations using space division multiplexing, one radio channel determined to be free by carrier sense.
- the number of space division multiplexes of and the number of retransmission packets are compared. Then, only when both are different or when the number of space division multiplexes is larger than the number of retransmission packets, the retransmission packets are reconstructed according to the number of space division multiplexes, and each reconstructed retransmission packet is subjected to space division multiplex. Use parallel transmission.
- the retransmission packets when performing retransmission processing due to a data packet transmission failure between two radio stations capable of using space division multiplexing for each radio channel in combination, it is judged as a vacant state by carrier sense.
- the number of parallel transmissions and the number of retransmission packets which correspond to the sum of the respective space division multiplexing numbers of the radio channels, are compared. Then, only when the two are different or when the number of parallel transmissions is larger than the number of retransmission buckets, the retransmission packets are reconstructed according to the number of parallel transmissions, and each reconstructed retransmission packet is freed from the radio channel and space division multiplexing. Send in parallel using.
- the invention according to claim 4 compares the number of radio channels determined to be idle by carrier sense with the number of retransmission packets when retransmitting processing is performed due to a transmission failure of data packets between two radio stations. Then, when the number of idle channels is larger than the number of retransmission packets, the retransmission packets are copied according to the number of surplus idle channels, and retransmission packets and copy packets are sent in parallel using idle radio channels. Then, on the receiving side, the resend packet and the copy packet sent in parallel are received diversity.
- the invention of claim 5 is characterized in that, when performing retransmission processing due to a data packet transmission failure between two radio stations using space division multiplexing, the space of one radio channel determined to be free by carrier sense.
- the division multiplexing number is compared with the number of retransmission packets. Then, when the number of space division multiplexes is larger than the number of retransmission packets, surplus space division multiplexes Copy the retransmission packet according to the number, and send the retransmission packet and the copy packet in parallel using space division multiplexing. Then, the receiving side performs diversity reception of the retransmitted packet and the copy packet sent in parallel.
- the invention according to claim 6 is that, when performing retransmission processing due to a data packet transmission failure between two wireless stations capable of using space division multiplexing for each wireless channel in combination, it is determined to be idle by carrier sense.
- the number of parallel transmissions which corresponds to the sum of the space division multiplexing numbers of the wireless channel, is compared with the number of retransmission packets. Then, when the number of parallel transmissions is larger than the number of retransmission packets, the retransmission packets are copied according to the surplus number of parallel transmissions, and the retransmission packets and copy packets are parallelly transmitted using the idle radio channel and space division multiplexing. Do. Then, on the receiving side, diversity transmission of parallelly transmitted S transmission packets and copy packets is performed.
- the invention of claim 7 it is possible to virtually determine whether the two radio stations are physically busy or not according to the received power between the two radio stations, and to be in the busy state during the set transmission suppression time.
- the number of radio channels determined to be idle by carrier sense is compared with the number of retransmission packets. Then, when the number of free channels is smaller than the number of retransmission packets, the time required to transmit a plurality of retransmission buckets is secured on the idle radio channel, and the plurality of retransmission packets are continuously transmitted without intervening carrier sense.
- the invention according to claim 8 is characterized in that, when performing retransmission processing due to a data packet transmission failure between two wireless stations using space division multiplexing, one radio channel determined to be free by carrier sense. Compare the number of space division multiplexes and the number of retransmission buckets. Then, when the number of space division multiplexes is smaller than the number of retransmission packets, secure the time required to transmit multiple retransmission packets in the idle radio channel, and interpose the physical retransmission of multiple retransmission packets. Send continuously.
- carrier status becomes idle due to carrier sense.
- To the sum of each space division multiplexing number of the radio channel determined to be The corresponding number of parallel transmissions is compared with the number of retransmission packets. Then, when the number of parallel transmissions is smaller than the number of retransmission packets, the time required to transmit multiple retransmission buckets is secured on the idle radio channel U Multiple retransmission packets are made continuous without intervening physical carrier sense To send
- the space division multiple number according to any of claims 2, 3, 5, 6, 8, and 9 is set according to the propagation environment between two radio stations.
- the invention of claim 11 is the method according to any one of claims 7 to 9, wherein the time required for transmission of a plurality of retransmission packets is secured by a vacant wireless channel, and physical carriers sense the plurality of retransmission packets. Define the procedure to send continuously without doing. In the retransmission bucket to be transmitted first, the time required to transmit multiple retransmission buckets is set as the transmission suppression time and transmitted. The wireless station receiving the retransmission packet suppresses the transmission during the transmission suppression time, and the local station transmitting the retransmission packet continuously transmits the subsequent retransmission packet.
- the invention of claim 12 is the method according to any one of claims 7 to 9, in which time required for transmission of a plurality of retransmission packets is secured by an idle radio channel, and physical retransmission of the plurality of retransmission packets is performed.
- time required for transmission of a plurality of retransmission packets is secured by an idle radio channel, and physical retransmission of the plurality of retransmission packets is performed.
- the wireless station receiving this response packet suppresses transmission during the transmission suppression time, and the local station to which this response packet is addressed ignores the transmission suppression time and continuously transmits subsequent retransmission packets. Do.
- the invention according to claim 13 secures the time required for transmission of a plurality of retransmission packets in an idle radio channel in any one of claims 7 to 9, and allows physical retransmission of the plurality of retransmission packets.
- the wireless station receiving the control packet suppresses transmission during the transmission suppression time, and the local station transmitting the control packet continuously transmits a plurality of retransmission packets.
- the wireless station having received the control packet according to claim 13 sets a transmission suppression time in a response packet and transmits it.
- the wireless station receiving this response bucket suppresses transmission during the transmission suppression time, and the own station that is the destination of this response bucket transmits a plurality of retransmission packets continuously ignoring the transmission suppression time. .
- a plurality of data packets are transmitted in parallel using a plurality of radio channels, or a plurality of data packets are transmitted in parallel by space division multiplexing using one radio channel, Alternatively, both of them are used in combination to define the procedure for retransmission processing between two wireless stations transmitting in parallel a plurality of data packets corresponding to the sum of space division multiplexing numbers of a plurality of wireless channels. From the one or more data frames stored in the transmission buffer, the transmitting wireless station generates a plurality of data packets having the same required transmission time as each other and transmits them in parallel.
- the wireless station on the receiving side receives the acknowledgment packet transmitted from the wireless station on the receiving side, recognizes that transmission of some data packets has succeeded, and retransmits only the data packets for which transmission failed if it recognizes that it has succeeded. . Also, if no acknowledgment packet is received, multiple data packets are retransmitted. Also, upon receiving an acknowledgment response packet and recognizing that the transmission of all parallelly transmitted data buckets is successful, the next transmission processing is started.
- the radio station on the transmitting side generates a plurality of data buckets having equal transmission times from one or more data frames stored in the transmission buffer and transmits them in parallel. In addition, it sends a negative acknowledgment packet requesting a negative acknowledgment packet indicating a data packet that failed to be received, and receives a negative acknowledgment packet sent from the wireless station on the receiving side. If it recognizes that transmission of some or all data packets has failed, it retransmits only the data buckets that failed to be transmitted. Also, if a negative acknowledgment packet is not received, the next transmission processing is started.
- the wireless station on the transmitting side generates, from the one or more data frames stored in the transmission buffer, a plurality of data buckets whose transmission durations are equal to one another in at least several units capable of parallel transmission.
- Parallel transmission Continuously transmit in units that can be transmitted in parallel.
- it sends an acknowledgment request packet requesting an acknowledgment packet indicating a successfully received data packet, and sends an acknowledgment packet sent from the receiving radio station.
- Receive a ket when it is recognized that transmission of some data packets is successful, only data packets for which transmission failed are retransmitted. Also, if no acknowledgment packet is received, multiple data packets are retransmitted. Also, if it receives acknowledgment of acknowledgment buckets and recognizes that transmission of all data buckets sent in parallel has succeeded, it enters the next transmission process.
- the wireless station on the transmitting side generates, from the one or more data frames stored in the transmission buffer, a plurality of data packets whose transmission durations are equal to one another in at least several units capable of parallel transmission. Transmit continuously in parallel in units that allow parallel transmission. Furthermore, it sends a negative acknowledgment request packet requesting a negative acknowledgment packet that indicates a data packet that failed to be received, and receives a negative acknowledgment packet sent from the wireless station on the receiving side.
- a negative acknowledgment request packet requesting a negative acknowledgment packet that indicates a data packet that failed to be received
- receives a negative acknowledgment packet sent from the wireless station on the receiving side when it is recognized that transmission of some or all of the data packets has failed, only the data packet that failed to be transmitted is retransmitted. Also, if the negative acknowledgment bucket is not received, the next transmission processing is started.
- the invention of claim 19 relates to the method according to claim 17 or claim 18, wherein the number of data buckets that failed to be transmitted when the transmission durations of a plurality of data buckets which are continuously transmitted in parallel are equal to each other. If the number of parallel transmissions exceeds the number that can be transmitted in parallel, data packets that failed to be transmitted are continuously retransmitted in parallel. Also, if the number of data packets that failed to transmit is less than or equal to the number that allows parallel transmission, the data packets that failed to transmit are retransmitted or retransmitted in parallel.
- the invention according to claim 20 is the transmission according to any one of claims 17 or 18 wherein the time required for transmission of a plurality of data buckets that are continuously transmitted in parallel is different for each unit that can be transmitted in parallel. If the required time for transmission of the data packet failed is different, add a dummy bit to the data bucket that has a short transmission time to make the bucket length equal. Then, if the number of failed data packets exceeds the number that can be transmitted in parallel, data packets that failed to be transmitted are continuously retransmitted in parallel. Also, if the number of failed data packets is less than or equal to the number that can be transmitted in parallel, the data packet for which transmission failed is retransmitted or retransmitted in parallel.
- the invention of claim 21 relates to any one of claims 15 to 18 wherein, instead of retransmitting only the failed data packet, the data failed to be transmitted. Re-send all data buckets after the data bucket with the youngest sequence number in.
- the invention of claim 22 sets the number of data packets to be transmitted in parallel to p (where p is an integer of 2 or more).
- Step 1 of the first wireless station for transmitting data packets comprises a buckett set consisting of p data bucketlets having transmission durations equal to or less than one another, from one or more data frames stored in the transmission buffer. M sets (M is an integer of 1 or more) are generated.
- Step 2 transmits in parallel the packet set of one set (referred to as N set) out of M packet sets in generation order.
- N + 1th packet set is arranged in parallel in generation order. Send.
- Step 4 acquires the number h of unsent data buckets for which transmission failed, when receiving a response bucket indicating failure to transmit some data packets from the second wireless station, and generates N + 1 in generation order If there are unsent data buckets in the next set of bucketed sets, h sets of unsent data packets in the Nth set and (p ⁇ h) or less unsent packets in the N + first set of packet sets or later Send data packets in parallel. Also, if there are no unsent data packets in the (N + 1) th and subsequent packet sets, the Nth h unsent data packets are sent.
- Step 5 transmits the Nth set of packets in parallel again if it does not receive a response packet from the second wireless station.
- step 6 if all the data packets that make up the Nth packet set have been successfully transmitted, the number h of unsent data packets that have failed to be transmitted is N + 1 of the subsequent packet sets. Read the number of unsent data packets, and repeat the processing in step 4 until transmission of all bucket data of M packet sets is completed. Next, after transmission of all data packets of M sets of packet sets is completed, the process returns to step 1 to generate new M sets of packet sets.
- the invention according to claim 23 is such that, in claim 22, a negative acknowledgment request packet is transmitted after transmitting the packet set from the first wireless station to the second wireless station.
- the second wireless station transmits a negative acknowledgment packet to the negative acknowledgment request packet when there is a data packet of transmission failure.
- the first wireless station receives a negative acknowledgment packet If not, the process of step 3 is performed, and the process of step 5 is not performed.
- claim 24 is according to claim 22 or claim 23.
- the invention of claim 25 is characterized in that, in claim 2 2 or claim 23, when the number of data frames used for generating M sets of bucket sets in step 1 exceeds the upper limit value, data exceeding the upper limit value is generated. Stop generating a packet set from the frame and postpone that data frame to the next bucket set generation opportunity.
- the invention of claim 26 relates to the number of data packets to be transmitted in parallel! ) (P is an integer of 2 or more).
- Step 1 of the first wireless station for transmitting the data packet comprises, from one or more data frames stored in the transmission buffer, a group of data buckets consisting of a plurality of data buckets whose transmission required times T are mutually equal. Generate and add the number D 1 of data packets to the cumulative number R of data packets.
- step 2 among the data packets belonging to the data packet group, up to p unsent data buckets are transmitted in parallel in the order of generation.
- Step 3 receives the response unsent buckets indicating the successful transmission of all the data buckets from the second wireless station receiving the parallel transmitted data packet. Get the number of w.
- w p send up to p unsent data buckets in parallel in generation order. If a new data frame is input to the transmission buffer when w ⁇ p, a data packet equal to the required transmission time T is generated from the data frame and added to the data packet group, and the number of data buckets Add D 2 to the cumulative number of data buckets R, and then send up to p unsent data buckets in parallel in the generation order.
- step 4 if a response bucket indicating failure to transmit some data buckets transmitted in parallel from the second radio station arrives, the unsent data buckets for which transmission failed and the rest of the data buckets are transmitted. Gets the total number w of unsent data buckets. If w p p, the maximum number of unsent data packets that have failed to be transmitted and in the order of generation is sent in parallel. If a new data frame is input to the transmission buffer when w ⁇ p, the required transmission time from that data frame is equal to T. Data buckets are generated and added to the data buckets group, the number of data buckets is added to the data packet cumulative number R, and then unsent data buckets that failed to be sent are included in the generation order up to p not yet generated. Transmit data packet in parallel. Step 5 transmits in parallel all the data packets transmitted immediately before, if a response packet corresponding to the reception of a packet set from the second wireless station has not arrived.
- the first wireless station transmits a non-acknowledgement request packet after parallelly transmitting the data packet to the second wireless station.
- the second wireless station transmits a negative acknowledgment packet to the negative acknowledgment request packet when the transmission failure data bucket is received.
- the first wireless station performs the process of step 3 and does not perform the process of step 5 when the negative acknowledgment packet does not arrive.
- the invention of claim 2 8 is characterized in that, in claim 2 6 or claim 7, when the cumulative number of data buckets in the data bucket group exceeds the upper limit value, a data packet is generated from a new data frame. Stop Then, after the transmission of all data packets of the data packet group is completed, the required transmission time T and the cumulative number R of data packets are reset, and the process returns to step 1.
- the invention of claim 29 is characterized in that, in claim 28, when transmission of all data packets of the data packet group is completed, the cumulative number of data buckets of the data bucket group does not exceed the upper limit value. Return to step 1 without resetting the required transmission time T and the cumulative number of data buckets R.
- the invention according to claim 1 is characterized in that, in claim 2, instead of the number h of unsent data packets for which transmission failed in step 4, data buckets following unsent data buckets for which transmission has failed in the packet set are not transmitted. Let h be a data bucket and let its number be h Ru.
- the invention of claim 32 is characterized in that, in claim 26, instead of the total number w of unsent data packets for which transmission failed in step 4 and the remaining unsent data buckets of the data bucket group, w is a data bucket. Let a data bucket following a failed data bucket in a group be an unsent data bucket, and let the number be w.
- FIG. 1 is a flowchart showing the processing procedure of the first embodiment of the present invention.
- FIG. 2 is a time chart showing an operation example of the first embodiment of the present invention.
- FIG. 3 is a time chart showing an operation example of the first embodiment of the present invention.
- FIG. 4 is a flowchart showing the processing procedure of the second embodiment of the present invention.
- FIG. 5 is a flowchart showing the processing procedure of the third embodiment of the present invention.
- FIG. 6 is a flowchart showing the processing procedure of the fourth embodiment of the present invention.
- FIG. 7 is a flow chart showing the processing procedure of the fifth embodiment of the present invention.
- FIG. 8 is a flowchart showing the processing procedure of the sixth embodiment of the present invention.
- FIG. 9 is a time chart showing an operation example of the sixth embodiment of the present invention.
- FIG. 10 is a flowchart showing the processing procedure of the seventh embodiment of the present invention.
- FIG. 11 is a flowchart showing the processing procedure of the eighth embodiment of the present invention.
- FIG. 12 is a flowchart showing the processing procedure of the ninth embodiment of the present invention.
- FIG. 13 is a flowchart showing the processing procedure of the tenth embodiment of the present invention.
- Figure 14 is a flow chart showing the processing procedure for receiving retransmission buckets and copy buckets.
- FIG. 15 is a flowchart showing the processing procedure of the first embodiment of the present invention.
- FIG. 16 is a time chart showing an operation example of the eleventh embodiment of the present invention.
- FIG. 17 is a flowchart showing the processing procedure of the transmitting wireless station of the twelfth embodiment of the present invention.
- FIG. 18 is a flowchart showing the processing procedure of the receiving side radio station according to the twelfth embodiment of the present invention.
- FIG. 19 is a time chart showing an operation example of the 12th embodiment of the present invention.
- FIG. 20 is a flowchart showing the processing procedure of the thirteenth embodiment of the present invention.
- FIG. 21 is a time chart showing an operation example of the thirteenth embodiment of the present invention.
- FIG. 22 is a flowchart showing the processing procedure of the 14th embodiment of the present invention.
- FIG. 23 is a time chart showing an operation example of the fourteenth embodiment of the present invention.
- FIG. 24 is a chart showing the processing procedure of the fifteenth embodiment of the present invention.
- FIG. 25 is a time chart showing an operation example of the fifteenth embodiment of the present invention.
- FIG. 26 is a flowchart showing the processing procedure of the sixteenth embodiment of the present invention.
- FIG. 27 is a time chart showing an operation example of the sixteenth embodiment of the present invention.
- FIG. 28 is a chart showing the processing procedure of the seventeenth embodiment of the present invention.
- FIG. 29 is a diagram showing a generation 1 of a plurality of data buckets according to a seventeenth embodiment of the present invention.
- FIG. 30 is a time chart showing an operation example of data packet generation / transmission / retransmission example 1 according to the seventeenth embodiment of the present invention.
- FIG. 31 is a diagram showing a generation 2 of a plurality of data buckets according to a seventeenth embodiment of the present invention.
- FIG. 32 is a time chart showing an operation example of the generation example 2 of Z data transmission and retransmission of a plurality of data buckets according to the seventeenth embodiment of the present invention.
- FIG. 33 is a chart showing the processing procedure of the eighteenth embodiment of the present invention.
- FIG. 34 is a time chart showing an operation example of the eighteenth embodiment of the present invention.
- FIG. 35 is a timing chart showing an operation example of the nineteenth embodiment of the present invention.
- FIG. 36 is a time chart showing an operation example of the 20th embodiment of the present invention.
- FIG. 37 shows the structure of the data bucket.
- FIG. 38 is a diagram showing the configuration of the extended A C K packet.
- FIG. 39 is a diagram showing the configuration of an extended A C K request bucket.
- FIG. 40 is a chart showing the processing procedure of the twenty-first embodiment of the present invention.
- FIG. 41 is a time chart showing an operation example of the 21st embodiment of the present invention.
- FIG. 42 is a flowchart showing the processing procedure of the second embodiment of the present invention.
- FIG. 43 is a time chart showing an operation example of the second embodiment of the present invention.
- FIG. 44 is a flowchart showing the processing procedure of the twenty-fourth embodiment of the present invention.
- FIG. 45 is a time chart showing an operation example of the twenty-fourth embodiment of the present invention.
- FIG. 46 is a flowchart showing the processing procedure of the twenty-fifth embodiment of the present invention.
- FIG. 47 is a time chart showing an operation example of the twenty-fifth embodiment of the present invention.
- Figure 48 is a time chart that explains the problem when the center frequencies of multiple wireless channels are close.
- Figure 4 9 is a diagram for explaining how to generate multiple data buckets to be sent in parallel from data frames, (1) is frame division, (2) is frame patching, and (3) is frame aggregation. An example is shown.
- Figure 50 is a time chart that explains Challenge 1 (when the number of radio channels increases) at the time of retransmission.
- Fig. 51 is a time chart explaining the problem 1 (during radio channel decrease) at the time of retransmission.
- ' Figure 52 is a time chart explaining the conventional retransmission method 1.
- FIG. 53 is a time chart explaining the conventional retransmission method 2.
- the number of free channels at the time of retransmission processing increases or decreases with respect to the time of first transmission (Problem at the time of retransmission 1)
- the number of retransmission packets and the number of free channels It copes with cases where the number is different, etc., and tries to make effective use of parallel transmission even during retransmission processing.
- FIG. 1 shows a flow chart of a first embodiment of the present invention.
- 2 and 3 show an operation example of the first embodiment of the present invention. Here, it is assumed that radio channels # 1, # 2, # 3 are prepared.
- the radio channel in an idle state is searched by carrier sense (S101, S102).
- radio channel # 3 is busy at transmission data generation timing 1, and radio channel # 1 and radio channel # 2 are searched as idle.
- the same bucket length is obtained for each wireless channel. In this way, the reconstructed packets are allocated to (in parallel) and transmitted (S103).
- the packet is reconfigured to have a packet length, and the reconfigured packet is assigned to each wireless channel (parallel) and retransmitted (S107).
- the number of free channels and the number of retransmission packets are the same, no reconfiguration is necessary, and retransmission packets are allocated to (in parallel) each radio channel and retransmitted (S108). Thereafter, the above retransmission process is repeated until all buckets are received.
- Fig. 2 (1) although the ACK bucket for the data bucket 1a transmitted on the wireless channel # 1 was received, the ACK bucket for the data bucket 1b transmitted on the wireless channel # 2 was not received. This is the case when the retransmission process is performed for point 1 b.
- the data packet 1 b is divided into 3 (lb ⁇ l, 1 b ⁇ 2, lb ⁇ 3) and the wireless channel Allocate to # 1, # 2, # 3 and retransmit in parallel (Fig. 1, S107).
- ACK buckets for the data buckets 1a and 1b transmitted by the wireless channels # 1 and # 2 are not received, and retransmission processing is performed for the data buckets 1a and 1b. is there.
- data buckets 1 a and 1 b are divided and reconfigured (la ⁇ 1 (la ⁇ 2) , 1 b— 1), 1 b— 2), radio channel Allocate to # 1, # 2 and # 3 respectively and retransmit in parallel (Fig. 1, S107).
- the retransmission packet is reconstructed according to the number of free channels.
- the reconstruction of data packets is complicated because it requires processing on the receiving side accordingly, so the number of available channels may be limited to the number of retransmitted packets. (Satsuma of S106 judgment branch of Fig. 1).
- FIG. 3 shows the case where the ACK packet for data packets 1a and 1b transmitted on radio channels # 1 and # 2 is not received, and retransmission processing is performed for data packets 1a and 1b.
- the number of packets to be retransmitted is 2 and the number of vacant channels is 1 at the start of retransmission processing t 2, which is smaller than the number of data packets, so data buckets 1 a and 1 b are not reconstructed.
- Assign 1a to radio channel # 1 and retransmit (Fig. 1, S108).
- FIG. 4 shows a flow chart of a second embodiment of the present invention.
- a feature of this embodiment is that space division multiplexing is used in retransmission of data packets in the first embodiment.
- the radio channel in an idle state is searched by carrier sense (S101, S102).
- the wireless channels are reconfigured to have the same bucket length, and each reconfigured packet is assigned to each wireless channel (parallel transmission) To do (S103).
- each reconfigured buckett is allocated to each antenna of space division multiplex and parallel retransmission is performed (S 113).
- the retransmission buckets are allocated to one radio channel and retransmitted without reconfiguring the retransmission buckets (S114). Thereafter, the above retransmission process is repeated until an ACK packet is received for all packets.
- FIG. 5 shows a flow chart of a third embodiment of the present invention.
- a feature of this embodiment is that space division multiplexing is used in parallel transmission and retransmission of data buckets in the first embodiment.
- the number of data packets that can be transmitted in parallel is the sum of the number of space division multiplexes in the idle radio channel by combining the idle radio channel and the space division multiplexing.
- the number of parallel transmissions will be described as the number of free channels x the number of space division multiplexes.
- transmission buffer When this data arrives, carrier sense searches for an idle radio channel (S101, S102). Next, for the number of free channels ⁇ space division multiple number, reconfigure each packet to be the same bucket length, and assign each packet that has been reconfigured to each wireless channel and space division multiplex antenna ( Column) Send (S121).
- the number of free channels X space division multiplexing number increases with respect to the number of retransmission buckets. It may be limited to (Satsuko notation of S122 judgment branch in Figure 5).
- FIG. 6 shows a flow chart of a fourth embodiment of the present invention.
- the feature of this embodiment is as follows: With regard to the number of space division multiplexing used in S121 and S122 to S124 of the third embodiment, the antenna correlation is obtained from the propagation coefficient, and the number of space division multiplexing that can overlap one channel by a predetermined threshold (S125, S126). Others are with the third embodiment. It is similar. The same applies to the space division multiplexing number used in S112 of the second embodiment.
- FIG. 7 shows a flowchart of the fifth embodiment of the present invention.
- the feature of this embodiment is that parallel transmission is performed using a plurality of radio channels or parallel transmission is performed using a space division multiplexing method.
- the number of data arriving at the transmission buffer and the number of space division multiplexing according to the propagation environment There is a place to choose accordingly (S131).
- the number of vacant channels (or the number of space division multiplexes) is reconfigured to be the same packet length, and the respective wireless channels (or each antenna of space division multiplex) are reconfigured. Allocate (parallel) packets and send (SI).
- the number of free channels or space division multiplexing number is compared with the number of retransmission packets (S133), and if both are different (number of free channels / number of retransmission packets (or space division multiplexing number / number of retransmission packets))
- Each radio channel (or each antenna of space division multiplex) is reconfigured so as to be the same packet length in order to retransmit using all the free channels (or each antenna of space division multiplex).
- Each reassembled packet is allocated (in parallel) and retransmitted (S 134).
- FIG. 8 shows a flowchart of the sixth embodiment of the present invention.
- FIG. 9 shows an operation example of the sixth embodiment of the present invention.
- wireless channels # 1, # 2 and # 3 are assumed to be prepared.
- each ACK packet is received within a predetermined time after transmission (S204), and for packets for which an ACK packet is not received within the predetermined time.
- a radio channel in an idle state is searched by carrier sense (S205).
- the number of free channels is compared with the number of retransmission packets, and if the number of free channels is larger than the number of retransmission packets, the retransmission packet is copied according to the number of surplus free channels exceeding the number of retransmission buckets, The copy packet is assigned to each wireless channel and retransmitted in parallel (S207).
- the copy packet may use a new bucket created by copying the payload of the retransmission packet.
- the effect of frequency diversity can be obtained for retransmission packets in which copy packets are transmitted.
- retransmission packets are allocated to each wireless channel (parallel) and retransmitted (S208). Thereafter, the above retransmission process is repeated until an ACK packet is received for all packets.
- Figure 9 (1) shows that although the ACK packet for data bucket 1a sent on radio channel # 1 was received, the ACK bucket for data bucket 1b sent on radio channel # 2 was not received, and the data bucket was not received. This is the case when the retransmission process is performed for point 1 b.
- data packet 1 b is copied (lb, lb ') and allocated to radio channels # 1 and # 2, respectively. Send again (Fig. 8, S207).
- Figure 9 (2) shows the case where the ACK packet for data buckets 1a and 1b transmitted by radio channels # 1 and # 2 is not received and retransmission processing is performed for data packets 1a and 1b.
- data packet 1 a of data packets 1 a and 1 b is copied (1 a, lb, 1 a ') Assign to radio channels # 1, # 2, # 3 respectively and retransmit in parallel (Fig. 8, S207).
- Figure 9 shows the case where the ACK packet for data packets 1a and 1b transmitted by radio channels # 1 and # 2 is not received, and retransmission processing is performed for data buckets 1a and 1b. .
- the number of free channels is 1 at the start of retransmission processing t 2 with respect to the number of retransmission packets 2 and is smaller than the number of data packets, data packet 1 a is first allocated to radio channel # 1 and retransmitted (figure 8, S208).
- the number of free channels is 2 for the number 1 of retransmission packets, so copy data packet 1 b (lb, lb ') and assign it to radio channels # 1 and # 3 in parallel, respectively.
- Send again (Fig. 8, S207).
- the retransmission packet may be reconstructed according to the number of free channels. , S209).
- FIG. 10 shows a flow chart of a seventh embodiment of the present invention.
- a feature of this embodiment is that the space division multiplexing method is used at the time of retransmission of the data packet in the sixth embodiment.
- the radio channel in an idle state is searched by carrier sense (S201, S202).
- the same bucket length will be set for each wireless channel.
- the reconstructed packets are allocated to (in parallel) and transmitted (S203).
- each ACK packet is received within a predetermined time after transmission (S204), and an ACK packet is not received within the predetermined time.
- Retransmission processing is performed on the packet (S211 to S215).
- a radio channel in an idle state is searched by carrier sense (S211).
- one radio channel in an idle state is selected.
- the number of space division multiplexes in the selected radio channel is compared with the number of retransmission packets (S212). If the number of space division multiplexes is larger than the number of retransmission buckets, the excess space division multiplex number exceeding the number of retransmission packets is obtained.
- the retransmission packet is copied according to and the retransmission packet and the copy packet are allocated to each antenna of space division multiplexing and retransmitted in parallel (S 213).
- the copy bucket uses a new packet generated by copying the payload of the resent bucket. The effect of space diversity is obtained for retransmission buckets where copy buckets are sent.
- the space division multiplexing number is equal to the number of retransmission packets (however, if the number of retransmission packets is 2 or more), retransmission packets are allocated to each antenna of space division multiplexing and parallel retransmission is performed ( S 214).
- the space division multiplexing number is smaller than the number of retransmission packets (including the case where the number of retransmission packets is 1), space packet multiplexing is not used, and retransmission packets are sequentially retransmitted using an empty channel (S215) . Thereafter, the above retransmission processing is repeated until an ACK packet is received for all packets. If the space division multiplexing number is smaller than the number of retransmission buckets, retransmission packets may be reconstructed according to the space division multiplexing number and parallel retransmission may be performed.
- FIG. 11 shows a flow chart of an eighth embodiment of the present invention.
- a feature of this embodiment is that the space division multiplexing method is used in parallel transmission and retransmission of data buckets in the sixth embodiment.
- the retransmission packet is copied according to the number X space division multiplexing number, and the retransmission packet and the copy packet are allocated to the radio channel and each antenna of space division multiplexing and retransmitted in parallel (S223). Note that the effect of frequency diversity is obtained when copy buckets are assigned to radio channels, and the effect of space diversity is obtained when space division multiplexing is used.
- FIG. 12 shows a flow chart of a ninth embodiment of the present invention.
- the feature of this embodiment is that the antenna correlation is obtained from the propagation coefficient for the number of space division multiplexing used in S221 and S222 to S225 of the eighth embodiment, and space division multiplexing can be performed on one channel by a predetermined threshold. It is in the place where it asks for the number (S226, S227). Others are the same as in the eighth embodiment. The same applies to the space division multiplexing number used in S212 of the seventh embodiment.
- FIG. 13 shows a flow chart of the tenth embodiment of the present invention.
- the feature of this embodiment is that parallel transmission is performed using a plurality of radio channels or a space division multiplexing system is used. Parallel transmission is selected or it is selected according to the number of data arriving at the transmission buffer and the number of space division multiplexes according to the propagation environment (S 231). Depending on this selection, the number of free channels (or the number of space division multiplexes) is reconfigured to be the same packet length, and the wireless channels (or each antenna of space division multiplex) are reconfigured. Allocate each packet (in parallel) and transmit (S232).
- each ACK packet is received within a predetermined time after transmission (S204), and the buckett in which the ACK packet is not received within the predetermined time Performs the retransmission process (S205, S233 to S235).
- a wireless channel in an idle state is searched by carrier sense (S205).
- the number of free channels is compared with the number of retransmission packets (S233), and if the number of free channels (or the number of space division multiplexes) is larger than the number of retransmission packets, the number of retransmission packets is exceeded.
- the retransmission packets are not copied, and retransmission packets are allocated to each radio channel (or each space division multiplex antenna) (parallel ) Send again (S235). Thereafter, the above retransmission process is repeated until the A C K packet is received for all packets. Also in this embodiment, when the number of free channels (or the number of space division multiplexes) decreases with respect to the number of retransmission packets, the retransmission packet is re-created according to the number of free channels (or the number of space division multiplexes). It may be configured (see FIG. 13, S233 judgment branch force notation in FIG. 13, S236).
- reception demodulation is performed for each radio channel, and in the case of space diversity to be allocated to each space division multiplexing antenna, each antenna To receive and demodulate.
- selection diversity reception it is checked whether the sequence number of each received packet is duplicated, one of the duplicate packets is selected, and the rest is discarded. Then, an arrival confirmation packet Ack corresponding to the selected packet sequence number is transmitted.
- synthetic diversity reception the signal correlation of each buckett received is processed, and buckets (retransmission packet and copy packet) exceeding a predetermined threshold are combined and synthesized. Then, an acknowledgment packet Ack corresponding to the sequence number of the constructed packet is transmitted.
- the arrival confirmation packet A ck is a power to be transmitted via the radio channel or antenna used respectively for the retransmission packet and the copy packet, and the radio channel used for either one of the buckets. Or transmit via an antenna.
- the transmitting side of the retransmission packet confirms the sequence number of the transmitted packet, recognizes that the corresponding retransmission packet has arrived, and terminates the retransmission processing.
- FIG. 15 shows a flow chart of a first embodiment of the present invention.
- FIG. 16 shows an operation example of the first embodiment of the present invention. Here, it is assumed that radio channels # 1, # 2, # 3 are prepared.
- each wireless channel is generated to have the same bucket length by the method shown in FIG. 49, and each data packet is generated for each wireless channel. Assign (parallel) and send (S303).
- Retransmission processing is performed for the buckett (S305 to S308).
- a radio channel in an idle state is searched by carrier sense, and the number of idle channels is compared with the number of retransmission packets (S305). If the number of vacant channels is equal to or greater than the number of retransmission buckets, a vacant channel to be used for retransmission processing is selected, and retransmission buckets are allocated (parallelly) to each of the selected vacant channels (S306).
- the retransmission packet to be transmitted first is selected, and the retransmission packet and the remaining retransmission packets are used as the transmission suppression time (occupied time) described in the retransmission packet.
- the total of the time required for transmission of is set and transmitted (S307).
- the subsequent retransmission packet is continuously transmitted using the radio channel (S308). Thereafter, the above retransmission processing is repeated until ACK packets are received for all packets.
- ACK packets for data packets (1 + 2 a) and (2 b + 3) transmitted on radio channels # 1 and # 2 are not received by Ac k waiting time limit t 2 and data packets (1 + Retransmission processing is performed for 2 a) and (2 b + 3).
- a) is assigned to radio channel # 1 and transmitted (FIG. 15: S307).
- the sum of the required transmission time of the retransmission packet (1 + 2 a) and the time required to transmit the retransmission packet (2 b + c) is set as the transmission suppression time.
- This retransmission packet (1 + 2 a) causes radio channel # 1 to retransmit the next packet NAV is set until transmission of (2 b + c) is completed.
- radio channel # 1 is suppressed from transmissions from other radio stations, and becomes in an exclusive state of its own station. Therefore, when the transmission of the retransmission packet (1 + 2a) is completed, the retransmission packet (2b + c) can be continuously transmitted over the radio channel # 1 (Fig. 15: S 308).
- NAV Network Allocation Vector
- the radio station has a timer called NV that represents the time until the radio channel becomes idle. If NAV is 0, it indicates that the radio channel is idle, and if it is not 0, it indicates that the radio channel is busy due to virtual carrier detection.
- NAV timer
- the occupancy time described in the header of the data bucket is read, and if the value is larger than the current value of NAV, the value is set to NAV.
- both the physical carrier detection by the RSSI and the virtual carrier detection by the NAV indicate the busy state.
- Carrier sense according to the above two methods performs almost the same function.
- the occupancy time which is longer than the actual transmission time of the data packet, is described in the header, the radio channel becomes busy due to virtual carrier detection even in the time after the reception of the data packet.
- the occupation time in this case can be said to be transmission suppression time, and is described as "transmission suppression time" in the description of the present invention.
- the wireless station transmitting the data packet determines that the wireless channel is free and performs transmission only when both of these two carrier senses become free.
- Figures 17 and 18 show a flow chart of a twelfth embodiment of the present invention.
- Figure 17 shows the process of the transmitting radio station
- Figure 18 shows the process of the receiving radio station.
- FIG. 19 shows an operation example of the 12th embodiment of the present invention.
- radio channels # 1, # 2, # 3 are prepared.
- the feature of this embodiment is that the NAV is set not from the transmitting side but from the receiving side.
- the transmitting radio station searches for a vacant radio channel by carrier sense (FIG. 17: S301, S302).
- a data bucket is generated so as to have the same bucket length for each wireless channel, for example, according to the method shown in FIG. Allocate (parallel) and send ( Figure 12: S303).
- Figure 12: S303 Next, for all data packets sent in parallel, it is confirmed whether or not the power of receiving AC ⁇ buckets within a predetermined time after sending (Fig. 17: S304), and ACK buckets within a predetermined time For data buckets that are not received, resend processing is performed (FIG. 17: S305 to S308).
- the radio channel in an idle state is searched by carrier sense, and the number of idle channels is compared with the number of retransmission buckets (FIG. 17: S 305). If the number of free channels is equal to or greater than the number of retransmission packets, a free channel to be used for retransmission processing is selected, retransmission buckets are allocated to each of the selected free channels (parallel), and transmission is performed (FIG. 17: S306). On the other hand, if the number of free channels is smaller than the number of retransmission packets, the retransmission packet to be transmitted first is selected, and information indicating that there is a retransmission packet following the retransmission packet is added and transmitted (Fig.
- the receiving radio station When the receiving radio station receives a data packet, it determines whether information indicating that there is a data packet (retransmission packet) following the data packet is added (FIG. 18: S321, S322). . If there is no subsequent data bucket, a normal ACK packet is returned (FIG. 18: S323). On the other hand, if there is a subsequent data packet, return the transmission suppression time described in the normal ACK packet by setting the time required to transmit the subsequent retransmission packet notified from the transmitting wireless station. ( Figure 18: S324). Receive an ACK packet that describes this transmission suppression time The set radio station sets the transmission suppression time to the NAV of the radio channel and suppresses the transmission.
- a sender station f receives an ACK packet with a transmission suppression time set as a response to the previously transmitted data packet, the transmission suppression time is set to NAV as with other wireless stations. However, it ignores it (without carrier sensing) and continuously transmits subsequent retransmission packets using the radio channel (FIG. 17: S312, S313). Also, the setting of the NAV may not be performed for the reception of the ACK packet for which the transmission suppression time is set. Thereafter, the above retransmission process is repeated until an ACK bucket is received for all packets.
- Figure 19 shows that the ACK packet for the data packet (1 + 2 a), (2 b + 3) transmitted by radio channel # 1, # 2 is not received by Ac M terminal time limit t 2 and the data packet (i Retransmission processing is performed for + 2 a) and (2 b + 3).
- the number of free channels is 1 at the start of retransmission processing t 3 for the number of retransmission packets 2 and it is smaller than the number of retransmission buckets
- information indicating that there is a subsequent retransmission packet is added to the retransmission packet (1 + 2 a) (FIG. 17: S311).
- the NAV between radio channel # 1 until the transmission of the next retransmission packet (2 b + c) is completed is It is set and transmission using radio channel # 1 is suppressed.
- the radio station that transmitted the retransmission packet (1 + 2 a) ignores the NAV set to radio channel # 1 by the ACK packet, and the subsequent retransmission packet (2 b + 3) using radio channel # 1.
- are sent continuously (FIG. 17: S 312, S 313).
- retransmission packets (1 + 2 a) and (2 b + 2) can be transmitted continuously.
- the NAV is set from the transmitting wireless station that continuously transmits a plurality of retransmission packets, and in the twelfth embodiment, from the transmitting wireless station that continuously transmits a plurality of retransmission packets.
- the receiver radio station sets the NAV based on the request. With this NAV setting, radio channel # 1 becomes exclusive. Continuous transmission of multiple retransmission packets is possible.
- radio stations for which NAV settings are performed are limited to radio stations that can receive the first retransmission packet from the transmitting radio station, or to radio stations that can receive ACK buckets from the receiving radio station. . That is, it is limited to the wireless stations in the vicinity of the transmitting wireless station and the receiving wireless station. Therefore, in order to widen the range of the radio station which performs this NAV setting, a combination of the first embodiment and the twelfth embodiment is referred to as a thirteenth embodiment.
- FIG. 20 shows a flow chart of a thirteenth embodiment of the present invention.
- FIG. 21 shows an operation example of a crane according to the thirteenth embodiment of the present invention.
- radio channels # 1, # 2 and # 3 are prepared.
- S301 to S304 which are common to the first embodiment and the twelfth embodiment will be omitted.
- a radio channel in an idle state is searched by carrier sense, and the number of idle channels is compared with the number of retransmission packets (S305).
- the retransmission bucket to be transmitted first is selected, and the retransmission packet and the remaining retransmission packets are used as the transmission suppression time (occupied time) described in the retransmission packet.
- the sum of the time required to transmit the retransmission packet is set, and information indicating that there is a subsequent retransmission packet is added and transmitted (S 314).
- the function of the receiving radio station and the procedure for setting the NAV are the same as in the second embodiment, and the radio station having received the ACK packet sets the transmission suppression time to the NAV of the radio channel and transmits it. Suppress. Thereafter, subsequent retransmission packets are continuously transmitted using the radio channel. Note that it is also possible to notify that there is a retransmission bucket following the receiving wireless station by the transmission suppression time set for the retransmission packet. In this case, the receiving wireless station transmits an ACK packet, which is the transmission suppression time set as the time obtained by subtracting the transmission time of the first retransmission bucket from the notified transmission suppression time (the time required to transmit the subsequent retransmission bucket). do it.
- Figure 2 1 shows that the ACK packet for the data packet (1 + 2 a), (2 b + 3) sent by radio channel # 1, # 2 is not received by Ack waiting time t 2 and data packet (1 This is the case when retransmission processing is performed for + 2 a) and (2 b + 3).
- the number of free channels is 1 at retransmission start time t 3 for the number of retransmission packets 2 and it is smaller than the number of retransmission packets, so the retransmission packets (1 + 2 a) Assign to radio channel # 1 and send.
- the sum of the required transmission time of itself and the time required to transmit the retransmission packet (2 b + c) is set as the transmission suppression time for the retransmission packet (l + 2 a) (FIG. 20: S314) .
- the NAV between radio channel # 1 until the transmission of the next retransmission packet (2 b + c) is completed is It is set and transmission using radio channel # 1 is suppressed.
- the radio station that transmitted the retransmission packet (1 + 2 a) ignores the NAV set to radio channel # 1 by the ACK packet, and the subsequent retransmission packet (2 b + 3) using radio channel # 1.
- S 312, S 313 retransmission packets (l + 2 a) and (2 b + 2) can be transmitted continuously.
- FIG. 22 shows a flowchart of a fourteenth embodiment of the present invention.
- FIG. 23 shows an operation example of the fourteenth embodiment of the present invention.
- radio channels # 1, # 2, # 3 are prepared.
- a feature of this embodiment is that control packets for setting the NAV are exchanged in advance when transmitting a plurality of retransmission packets divided into a plurality of transmission timings.
- a radio channel in an idle state is searched by carrier sense (S301, S302).
- a data bucket is generated so as to have the same bucket length for each wireless channel according to the method shown in FIG. 49, for example. Allocate (in parallel) packets and transmit (S303).
- each ACK packet is received within a predetermined time after transmission (S304), and a data packet for which an A CK packet is not received within the predetermined time Performs the retransmission process (S305 to S333).
- the radio channel idle to search by carrier sense is compared with the number of retransmission packets and empty Chiyanenore number (S 3 0 5). If the number of free channels is equal to or greater than the number of retransmission packets, a free channel to be used for retransmission processing is selected, retransmission buckets are allocated to each of the selected free channels (parallel), and transmission is performed (S306).
- a control packet is transmitted in which the time required for transmission of a plurality of retransmission buckets is set as the transmission suppression time using the current idle channel (S331). After that, it sets the transmission suppression time in the response packet of the receiving side radio station for the control packet and transmits it.
- the process when the wireless station that has sent the control packet receives the response packet is the same as in the second and third embodiments, selects the retransmission packet to be sent first, sends it, and then sends the wireless channel
- the subsequent retransmission packet is continuously transmitted using (S332, S333). Thereafter, the above retransmission process is repeated until ACK buckets are received for all buckets.
- the process of setting the transmission suppression time to the response packet may be optional.
- the ACK packet for the data packet (1 + 2 a), (2 b + 3) transmitted by radio channel # 1, # 2 is not received by Ack waiting time t 2 and data packet (1 This is the case when retransmission processing is performed for + 2 a) and (2 b + 3).
- radio channel # 1 since only radio channel # 1 is free at time t 3 when retransmission processing starts, and there are one free channel number compared to the number of retransmission buckets 2 compared to the number of retransmission buckets, use radio channel # 1 first Send a control bucket to set the NAV (Fig. 2 2: S331).
- the time required to transmit all retransmission packets (1 + 2a) and (2b + c) is set as a transmission suppression time. Also, the same transmission suppression time is set to the response packet to the control packet. With this control bucket and response bucket, retransmit packet to radio channel # 1
- NAV is set until transmission of (1 + 2 a) and (2 b + c) is completed, and radio channel # 1 becomes exclusive.
- the retransmission packet (2b + c) can be transmitted continuously via the radio channel # 1 (Fig. 22: S333).
- the sender in the delivery confirmation by the ACK packet, may transmit a NAC request packet and the receiver may respond to the NAC packet.
- the number of vacant channels is different at the time of initial transmission and at the time of retransmission processing.
- FIG. 24 shows a flowchart of a fifteenth embodiment of the present invention.
- FIG. 25 shows an operation example of the fifteenth embodiment.
- radio channels # 1, # 2 and # 3 are prepared, and it is assumed that the number of data packets that can be transmitted in parallel at the transmission timings tl, t2 and t3 obtained by carrier sense does not change.
- the data packet is generated from the data frame according to the number that can be parallelly transmitted (S401, S402).
- data packets P1, P2, and P3 are generated from data frame F1.
- the packet length of each data packet is uniform.
- the number of data frames used to generate data packets is arbitrary; for example, three data buckets may be generated from two data frames as shown in FIGS. 49 (2) and (3).
- all sequence numbers of the data bucket to be transmitted are acquired (S403).
- P 1 to P 3 correspond to the sequence numbers of the respective data packets.
- the generated data packets P1 to P3 are transmitted in parallel (S404). Thereafter, the success or failure of transmission of all the data buckets is confirmed by the ACK packet from the receiving side (S405, S406).
- success / failure information of transmission of each data packet transmitted in parallel is described in one ACK packet, and is transmitted using one radio channel (here, # 1).
- Such an extended ACK packet uses, for example, the Group A CK procedure which has been studied in IEEE802.HTGe and the like. With this ACK packet, the transmission success of the data packet P1, P3 and the transmission failure of the data packet P2 are confirmed.
- FIG. 26 shows a flowchart of the sixteenth embodiment of the present invention.
- FIG. 27 shows an operation example of the twenty-sixth embodiment.
- the radio station A after transmitting a data packet from the transmitting side radio station A to the receiving side radio station B in the fifteenth embodiment, the radio station A transmits a NACK request packet to the radio station B. It is in the place to transmit and receive the NACK packet transmitted from the wireless station B.
- the NACK request packet contains information of the data packet transmitted from the wireless station A to the wireless station B.
- Station B does not send a NACK bucket to the NACK request packet if the data packet is successfully received, and includes information on the data bucket 1 if the data bucket 1 is not successfully received.
- Send back a NACK packet Therefore, if the NACK packet does not arrive from the wireless station B after the transmission of the NAC K request packet, the wireless station A determines that the previously transmitted data packet has been successfully transmitted. On the other hand, when a NACK packet is received, it is judged that the data packet described therein has failed in transmission.
- the other data packet retransmission processing is the same as in the first embodiment.
- the data packet is generated from the data frame according to the number that can be parallelly transmitted (S401, S402).
- S401, S402 the number that can be parallelly transmitted
- data buckets P 1, P 2 and P 3 are generated from data frame F 1.
- S403 all sequence numbers of data packets to be transmitted are obtained (S403), and data packets P1 to P3 are transmitted in parallel (S404).
- the NACK request packet which asks for the success or failure of reception of multiple data buckets sent in parallel, is Data packet to the destination (S411).
- the NACK request packet and the corresponding NACK packet are transmitted and received using one radio channel (here, # 1), and the data packet of the radio channel for which transmission failed is
- # 1 the radio channel for which transmission failed is
- An example is shown in which the information is collectively described in the NACK packet.
- Such extended NACK request packets and NACK packets use the Group A C K procedure, which has been studied, for example, in IEEE802. LlTGe.
- This' NACK bucket confirms transmission failure of data bucket P 2. Then, at the next transmission timing t2 obtained by carrier sense, only the data packet (in this case, P2) for which transmission failed is retransmitted (S412, S407). Next, the entire sequence number of the retransmitted data packet is obtained (S408), and the NACK request packet is transmitted to the destination of the data packet (S411).
- FIG. 28 shows a flowchart of a seventeenth embodiment of the present invention.
- FIG. 29 shows generation 1 of a plurality of data buckets in the seventeenth embodiment.
- FIG. 30 shows an operation example of the generation 1 of Z transmission and generation of a plurality of data packets in the seventeenth embodiment.
- the feature of this embodiment is that, from the data frame stored in the transmission buffer, a plurality of data packets having the required transmission time equal to one another are generated in parallel by the number of parallel transmittables. Where to send.
- the data packet is generated from the data frame according to the number that can be parallelly transmitted (S401, S402).
- S401, S402 the number that can be parallelly transmitted
- two data frames F 1 and F 2 are divided respectively, and three data packets P 1, P 2 and P 3 and data packets of the same transmission time required TA respectively.
- P4, P5 and P6 are generated.
- the success or failure of transmission of all the data packets is confirmed by the ACK packet from the receiving side (S423, S424).
- the acknowledgment request packet and the corresponding ACK packet are transmitted and received using one radio channel (here, # 1), and the success / failure information of the transmission of each data packet is described in that ACK bucket.
- # 1 radio channel
- An example is shown.
- Such extended ACK request buckets and ACK buckets use the GroupACK procedure discussed in, for example, IE E E 802. llTGe.
- the required time for transmission of the failed data packet is complete, and if it is not complete, a dummy bit is added to the data packet for which the required time for transmission is short, and parallel retransmission
- the required transmission times for multiple data buckets are aligned (S425, S426).
- the transmission required time for the data buckets P 1 to P 3 and the data buckets P 4 to P 6 generated from the data frames F 1 and F 2 is the same, so transmission failed.
- the required time for transmission of data packets P 2, P 5 and P 6 is also complete, and it is not necessary to add dummy bits at the time of parallel retransmission.
- the success or failure of the transmission of all the data packets transmitted in parallel is recognized by the ACK packet from the receiving side (S 423, S 424).
- the transmission of data packets P2, P5 and P6 is confirmed by this ACK packet, it is confirmed that the transmission of data packets P1 to P3 and data packets P4 to P6 transmitted continuously in parallel is successful.
- the process returns to step S401 to enter the next data bucket generation and transmission process.
- data packets P7, P8 and P9 are generated from data frame F3 and transmitted in parallel at transmission timing t3.
- data frames F 1 and F 2 are restored by aligning data packets P 1 to P 3 and data buckets P 4 to P 6.
- the data frame F 2 may be restored first, and the data frame F 1 may be restored later.
- the data bucket P 1 to P 3 and the data bucket P generated at one time may be generated. Since transmission and retransmission processing is performed in units of 4 to 6, data buckets P 7 and later generated at the next opportunity are transmitted and received first, and data frame F 3 is restored first. There is no. That is, the reception buffer size may be determined according to the number of data frames to be handled at one time or the number of data buckets, without largely changing the restoration order of the data frames, and it is possible to cope with a relatively small one. Can.
- FIG. 31 shows an example 2 of generation / transmission / retransmission of a plurality of data buckets in the seventeenth embodiment.
- FIG. 32 shows an operation example of a plurality of data packet generation / transmission Z retransmission example 2 in the seventeenth embodiment.
- data frame F1 is divided, three data packets P1, P2 and P3 with the same required transmission time TA are generated, and data frame F2 is further divided. And three data packets P 4, P 5 and P 6 of the same transmission time required TB are generated.
- the transmission processing time TA and TB of data packets generated in the number of units that can be transmitted in parallel are different (T A> T B). That is, although a plurality of data packets having the required transmission time equal to one another in several units that can be transmitted in parallel are generated, the transmission required time of a plurality of data packets to be transmitted continuously in parallel is different for each unit that can be transmitted in parallel. That's the case.
- FIG. 33 shows a flow chart of a eighteenth embodiment of the present invention.
- FIG. 34 shows an operation example of the eighteenth embodiment.
- the feature of this embodiment is that, in the seventeenth embodiment, after the data packet is transmitted from the transmitting side radio station A to the receiving side radio station B, the NACK request packet is transmitted from the radio station A to the radio station B. It is in the place to transmit and receive the NA CK packet transmitted from the wireless station B.
- the NAC request packet includes information on data packets transmitted from the wireless station A to the wireless station B. When the data packet is successfully received, the wireless station B does not send back the NA CK bucket to the NAC request bucket, and includes information on the data bucket when the data packet is not successfully received. Send back a NA CK packet.
- the radio station A does not receive the NA CK buckett from the radio station B after transmitting the NA CK request bucket, It is determined that the previously transmitted data packet has been successfully transmitted. On the other hand, when an NA CK packet is received, it is determined that the data packet described therein has failed in transmission.
- the other data packet retransmission processing is the same as in the seventeenth embodiment.
- the operation example shown in FIG. 34 corresponds to the generation / transmission / retransmission example 1 of a plurality of data packets shown in FIGS. 29 and 30, but is shown in FIGS. 31 and 32. The same applies to the generation 2 of the plurality of data packets.
- FIG. 35 shows an operation example of the nineteenth embodiment of the present invention.
- FIG. 36 shows an operation example of the 20th embodiment of the present invention.
- the data packets P 1 to P 3 generated from the data frame F 1 are successfully transmitted.
- 2 shows a situation where retransmission is caused by transmission failure.
- data frame F1 is restored after rearranging data buckets P1 and P3 arriving first and data packets P2 arriving later are rearranged in the correct order.
- the nineteenth embodiment and the sixteenth embodiment in order to simplify the data frame recovery process with reordering on the receiving side in FIG. 24 and FIG.
- the processing in step S407 in FIG. 26 is modified to re-send the data packet (P2, P3 in this case) on and after the youngest data packet in the data packet that failed to be transmitted. This makes it possible to easily restore the data frame F1.
- step 3 in steps S428 and S429 the data bucket after the youngest data bucket among the data buckets that failed to be sent (here P2, P3, P4, P5, P6) Change to resend.
- the operation of making the transmission required time between the data packets in steps S425 and S426 not be performed.
- the transmission time required for the data packets P1 to P3 and the data packets P4 to P6 is different, the data packet P2 to P to be retransmitted is retransmitted.
- the required time for transmission of 3 and data buckets P4 to P6 is also different. Therefore, the data packets P2 to P3 and the data packets P4 to P6 are continuously transmitted in parallel without performing the operation to make the required time for transmission between the data packets uniform. This makes it possible to easily restore data frames F 1 and F 2.
- Figure 37 shows the structure of the data packet.
- the data packet includes packet type information, identification information (ID) of a destination radio station, identification information (ID) of a transmission source radio station, and a sequence given to distinguish a plurality of data buckets transmitted in parallel. It consists of the number, the sequence number of the youngest number among the sequence numbers of multiple data packets sent in parallel, the data portion, and the FCS portion.
- Figure 38 shows the configuration of the extended A C K packet.
- the extended ACK packet is for collectively transmitting the success / failure information of each data packet transmitted in parallel as shown in FIG. 25 etc., and the extended NACK shown in FIG. 27 etc. The same is true for the buckett.
- the ACK packet of Example (1) consists of packet identification information, identification information (ID) of the destination radio station (data packet source radio station), the sequence number of the successfully received data packet, and the FCS section.
- ID identification information
- FCS FCS section.
- a bit map is prepared, and the bit corresponding to the sequence number of the data packet is made a value according to the reception success or failure. Express packet reception success.
- the top bit of the bitmap corresponds to the data buckett with the youngest sequence number among the multiple data packets transmitted in parallel.
- Figure 39 shows the configuration of the extended A C K request packet.
- the extended ACK request packet is for collectively transmitting information for determining the reception success or failure of a plurality of parallelly transmitted data buckets as shown in FIG. 30 etc., and is shown in FIG. 27 etc. The same is true for the extended NACK request bucket.
- the ACK request packet contains packet type information, the destination wireless station (data packet Identification information (ID) of the transmission destination radio station), identification information (ID) of the transmission source radio station (data packet transmission source radio station), a sequence number of all data packets transmitted in parallel, and an FCS section. Ru. Instead of describing the sequence numbers of all the data bucketts sent in parallel, the ACK request packet in example (2) was sent in parallel with the youngest sequence number among the sequence numbers of the data bucketts sent in parallel. Describe the number of data packets.
- FIG. 40 shows a flowchart of a twenty-first embodiment of the present invention.
- FIG. 41 shows an operation example of the twenty-first embodiment of the present invention.
- M be the number of packet sets generated at one time.
- the sequence number of the bucketset is set to N separately from the sequence number of.
- M sets of packet sets composed of P or less data packets are generated (S501 to S503).
- data packets P 1, P 2 and P 3 are generated as a first packet set from data frames F 1 and F 2, and a second packet set is generated from data frames F 3 and F 4.
- the packet length of each data packet is uniform. Note that data packets may be generated in packet set units, and the number of corresponding data frames is arbitrary.
- the unsent data bucket is in the second set (N + first set) and subsequent bucket sets. (S512, S513) If there are unsent data packets, h unsent data packets of the first set of packets (data packet P2 of transmission failure) and the second set of packet sets (p _ h) Select not more than unsent data packets (P4, P5) and transmit them in parallel at the next transmission timing t2 (S514). Since the data packet P2 and the data packet P4, P5 have the same generation timing, the packet length is also equal, and there is no problem in parallel transmission.
- the success or failure of the transmission of all the data packets of the first (Nth) packet set is confirmed by the A C K packet from the receiving side (S 516, S 506). If the transmission of data bucket P 2 is confirmed by this A C K packet, it is confirmed that the transmission of the first (Nth) packet set (P 1 to P 3) is successful. Then, the sequence number N of the packet set is incremented (S506, S507, S508) until the transmission success of all the packet sets is confirmed (S506, S507, S508), and the process shifts to processing of the second set (N + first set) of packets. . On the receiving side, the data frames F 1 and F 2 are restored by arranging the data buckets P 1, P 2 and P 3.
- the process returns from S 509 to S 506 to determine whether all data packets in the second set (N + 1 set) of packets have been sent successfully or not, and if there are unsent data packets yet, the third set (N + 2 set) The same process is repeated while incorporating the data packet of the subsequent packet set.
- FIG. 42 shows a flow chart of a second embodiment of the present invention.
- FIG. 43 shows an operation example of the second embodiment of the present invention.
- the feature of this embodiment is that after transmitting a data packet from the transmitting side radio station A to the receiving side radio station B, the radio station A transmits a negative acknowledgment request packet to the radio station B.
- the wireless station B does not return a negative response to the negative acknowledgment request packet if the data bucket is successfully received, and indicates that the data bucket is not successfully received.
- Reply packet is sent. Therefore, if the negative acknowledgment packet does not arrive from the wireless station B after the transmission of the negative acknowledgment request packet, the wireless station A determines that the previously transmitted data packet has been successfully transmitted. On the other hand, when a negative response bucket is received, it is determined that the data bucket described therein has failed in transmission.
- the other data packet retransmission processing is the same as that of the 21st embodiment.
- M sets of packet sets composed of p or less data packets are generated (S501 to S503).
- data packets P 1, P 2 and P 3 are generated as the first packet set from data frames F 1 and F 2
- the negative acknowledgment request bucket and the corresponding negative acknowledgment bucket NACK are transmitted and received using one wireless channel (here, # 1) and the data packet for which transmission failed.
- the information shows an example described in the negative acknowledgment packet NACK.
- some data packets of the first (Nth) packet set are retransmitted, and part or all of the unsent data packets of the second (N + 1st) and subsequent packet sets are combined. Parallel transmission. If the negative acknowledgment bucket NACK is not received in S522, it means that all these data buckets have been successfully transmitted, and the transmission of the first (Nth) packet set (P 1 to P 3) is successful. It is confirmed. On the other hand, for the second and subsequent (N + 1) sets of packet sets, the packet set sequence number N is incremented until transmission of all packet sets is confirmed successfully (S522, S507, S508 , S523).
- the transmission of the first set of bucketed set is determined by the successful transmission of the data packet P2. Is complete.
- the process proceeds from S523 to S511 for the second set of packet sets, and the number h (here two) of unsent data packets of the second set of packet sets is calculated. Do. Also, since the number M of packet sets generated is 2, and there are no packet sets after the third set, two unsent data packets (P 4, P 6) of the second set of packet sets are selected, Parallel transmission is performed at the next transmission timing t 3 (S513, S515).
- the number M of packet sets that can be generated at one time is limited to the upper limit. Set a value and stop generating a bucketset that exceeds the upper limit. Then, data frames not used for packet set generation are postponed until the next bucket set generation opportunity.
- the number of data frames used for generating M sets of bucket sets exceeds the upper limit value. Will stop generating packet sets from data frames that exceed the limit. Then, it forwards data frames not used for packet set generation to the next bucket set generation opportunity.
- FIG. 44 shows a flowchart of a twenty-fourth embodiment of the present invention.
- FIG. 45 shows an operation example of the twenty-fourth embodiment of the present invention.
- D data buckets (D1, D2, ...) generated at one time from a data frame be a data bucket group, and let R be the cumulative number of data packets that make up the data bucket group. Do.
- the cumulative number R in the present embodiment is arbitrary, and does not directly participate in control.
- sequence numbers are assigned to data packets constituting a data packet group in the order of generation, and transmission processing is performed in the order of generation.
- a data packet of the required transmission time is generated, and the generated D1 data packets are regarded as a data packet group (S531 to S533).
- data packets P1, P2 and P3 are generated from data frames F1 and F2
- the transmission time for each data bucket is T. Note that the number of data frames used to generate a data bucket group is arbitrary.
- up to p data packets (P 1 to P 3) are transmitted in parallel in generation order from the data packet group (S534). Thereafter, the success or failure of transmission of each data packet is confirmed by an ACK packet from the receiving side (S535, S536).
- success / failure information of transmission of each data packet is described in one ACK bucket, and it is returned using one radio channel (here, # 1).
- transmission failure of data packet P 2 is confirmed by this ACK bucket, the total number w (here four) of untransmitted data buckets of transmission failure and remaining unsent data packets of data packet group is acquired. (S5 36, S537).
- the cumulative number R of data buckets is D1 + D2.
- up to p (w) data packets are transmitted in parallel in the order of generation (S 541, S 534).
- the process returns from S540 to S531, and data packets are newly generated from the data frame.
- the data packet P 4 fails to be transmitted, so the number w of unsent data packets is data packet It becomes two pieces of P4, P6 (w ⁇ p).
- the data frames F1 and F2 are restored by arranging the data packets P1 to P3.
- data buckets P 7, P 8 and P 9 of transmission required time T are generated from the data frames F 5 and F 6 and added to the data buckets, and the cumulative number R is 9 I assume.
- data packets P1, P2, P3 of the transmission door jf required time T are newly generated from the data frames F7, F8, F9.
- the data packets P1 to P6 generated at the transmission timing 1 and the data packets P1 to P3 generated at the transmission timing t5 are independent of each other, and the transmission required time T is generally different.
- FIG. 46 shows a flowchart of a twenty-fifth embodiment of the present invention.
- Figure 4-7 is a book An operation example of a twenty-fifth embodiment of the invention is shown.
- the present embodiment is characterized in that an upper limit value Rover is provided to the cumulative number R of data bucket groups in the twenty-fourth embodiment. This is because, for example, at transmission timing t 3 and t 4 in FIG. 45 showing the 24th embodiment, data packets P 7 to 7 generated after the data packet P 6 is successfully transmitted, for example. If transmission of P 9 is successful, it is considered that the problem of changing the order of data frame restoration will occur. If the cumulative number R of data buckets is made unlimited, such problems may occur frequently.
- Steps S531 to S542 in the flowchart of the twenty-fifth embodiment shown in FIG. 46 are the same as the twenty-fifth embodiment shown in FIG.
- the cumulative number R of data packet groups is compared with the upper limit value Rover (SMI) In the case of R Rover, the data packet is not generated from the next data frame (does not proceed to S 541), and control is returned to S 534 to transmit all data packets of the current data packet group. .
- SMI upper limit value Rover
- the cumulative number R of data packet groups is compared with the upper limit value Rover (S 552 ), in the case of R ⁇ Rover Then, the process returns to S531 to newly generate a data bucket from the data frame.
- the R2 Rover it is determined whether or not there is a data frame in the transmission buffer (S553). If there is a data frame, the accumulated number of current data packet groups is newly reset without resetting R. Proceed to S542 and S534 to generate a data bucket from the data frame. Also, if there is no data frame, the process returns to S531 to newly generate a data packet from the data frame.
- 6 is set as the upper limit value Rover of the cumulative number R of data packet groups, and when data packets P1 to P6 are generated at transmission timing 1, R R Rover.
- the difference from the third embodiment shown in FIG. 45 is that when the number of unsent data packets in the data packet group becomes 2 «p) at transmission timing t 3, the data frame F 5 is transmitted to the transmission buffer. , F 6 is in the place where the data packet is not generated.
- the transmission completion of the data packets P1 to P6 is prioritized, and the data packets P4 and P6 are transmitted in parallel at the transmission timing t3.
- the data packet P6 is transmitted at the transmission timing t4 due to the transmission failure of the data packet P6, and after the transmission becomes successful, the data packet is transmitted from the new data frame F5, F6, F7 at the transmission timing t5. Generate P1, P2 and P3.
- the cumulative number of data packets forming the data bucket group is replaced with the cumulative number R of data packets, and the data frame accumulation used for generating the data bucket group is employed.
- the wireless station A transmits a negative acknowledgment request packet to the wireless station B, and the wireless station B Receive a negative acknowledgment packet to be sent.
- the processing of S535 and S536 is the transmission of a negative acknowledgment request packet and the reception of a negative acknowledgment packet, and when a negative acknowledgment packet is received, the unsent data bucket that failed to be transmitted at S537 and the data bucket
- the total number w of unsent data buckets remaining in the data group may be obtained, and if the negative acknowledgment bucket is not received, the number w of unsent data buckets remaining in the data bucket group may be acquired in S538.
- Others are similar to the 24th embodiment and the 25th embodiment.
- step S 511 instead of the step S 511 of obtaining the number of unsent data buckets that have failed to be transmitted in the bucket set, instead of step S 511, the data packet following the unsent data buckett that failed to be sent in is regarded as the unsent data bucket, and the number h is used for the following processing.
- the total number w of unsent data buckets for which transmission has failed and the remaining unsettled data buckets for the data buckets is acquired In place of step S537, among the data packets constituting the data packet group, the data bucket generated after the transmission failure unsent data packet is regarded as the unsent data bucket, and the number w is used for the following processing.
- the first to fifth embodiments described above transmit data packets in parallel using a plurality of wireless channels, but use a space division multiplexing method when transmitting data buckets. Or a method using a plurality of radio channels and the space division multiplexing number method together.
- antenna correlation may be calculated from the propagation coefficient, and the number of space division multiplexing that can be overlapped on one channel may be calculated using a predetermined threshold.
- parallel transmission using a plurality of wireless channels or parallel transmission using a space division multiplexing system, or selection according to the number of data arriving at the transmission buffer and the number of space division multiplexing according to the propagation environment You may Industrial applicability
- the present invention at the time of retransmission due to transmission failure of data packet, it is possible to transmit retransmission buckets efficiently and reliably by making the best use of free channel and space division multiplexing, and to improve throughput. Furthermore, while improving the throughput, it is possible to simplify data frame recovery control on the receiving side without increasing the receive buffer size.
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mobile Radio Communication Systems (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
- Communication Control (AREA)
- Small-Scale Networks (AREA)
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2005507285A JP4126059B2 (ja) | 2003-06-18 | 2004-06-18 | 無線パケット通信方法および無線パケット通信装置 |
US10/548,788 US7974243B2 (en) | 2003-06-18 | 2004-06-18 | Wireless packet communication method and wireless packet communication apparatus |
EP04746381.5A EP1635518B1 (en) | 2003-06-18 | 2004-06-18 | Wireless packet communication method |
CA 2518590 CA2518590C (en) | 2003-06-18 | 2004-06-18 | Wireless packet communication method |
US13/108,504 US8989108B2 (en) | 2003-06-18 | 2011-05-16 | Wireless packet communication method and wireless packet communication apparatus |
Applications Claiming Priority (16)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2003173914 | 2003-06-18 | ||
JP2003-173914 | 2003-06-18 | ||
JP2003-368685 | 2003-10-29 | ||
JP2003368685 | 2003-10-29 | ||
JP2003385603 | 2003-11-14 | ||
JP2003-385603 | 2003-11-14 | ||
JP2003-416354 | 2003-12-15 | ||
JP2003416354 | 2003-12-15 | ||
JP2003-427580 | 2003-12-24 | ||
JP2003427580 | 2003-12-24 | ||
JP2004019673 | 2004-01-28 | ||
JP2004-019673 | 2004-01-28 | ||
JP2004-029730 | 2004-02-05 | ||
JP2004029730 | 2004-02-05 | ||
JP2004111621 | 2004-04-05 | ||
JP2004-111621 | 2004-04-05 |
Related Child Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10548788 A-371-Of-International | 2004-06-18 | ||
US13/108,504 Division US8989108B2 (en) | 2003-06-18 | 2011-05-16 | Wireless packet communication method and wireless packet communication apparatus |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2004114610A1 true WO2004114610A1 (ja) | 2004-12-29 |
Family
ID=33545737
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2004/008912 WO2004114610A1 (ja) | 2003-06-18 | 2004-06-18 | 無線パケット通信方法 |
Country Status (6)
Country | Link |
---|---|
US (2) | US7974243B2 (ja) |
EP (1) | EP1635518B1 (ja) |
JP (4) | JP4126059B2 (ja) |
KR (1) | KR100807446B1 (ja) |
CA (3) | CA2701502C (ja) |
WO (1) | WO2004114610A1 (ja) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2006130541A2 (en) * | 2005-05-31 | 2006-12-07 | Qualcomm Incorporated | Rank step-down for mimo systems employing harq |
JP2007329694A (ja) * | 2006-06-08 | 2007-12-20 | Hitachi Ltd | 無線通信システムおよび無線通信装置 |
JP2008535444A (ja) * | 2005-04-05 | 2008-08-28 | テルコーディア テクノロジーズ インコーポレイテッド | 無線ネットワーク内における複数無線インターフェイスの使用 |
JP2008228091A (ja) * | 2007-03-14 | 2008-09-25 | Saxa Inc | リーダライタ装置 |
JP2008541607A (ja) * | 2005-05-11 | 2008-11-20 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | 複数キャリアのスケジューリング |
JP2009290341A (ja) * | 2008-05-27 | 2009-12-10 | Kyocera Corp | 携帯通信端末および無線通信方法 |
US7869463B2 (en) | 2005-07-08 | 2011-01-11 | Fujitsu Limited | Transmitting apparatus and receiving apparatus for controlling retransmission of communication data and information communication method using the same |
US9036610B2 (en) | 2009-05-08 | 2015-05-19 | Sony Corporation | Communication apparatus, communication method, and communication system for handling frames of variable length |
Families Citing this family (65)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1751465B (zh) * | 2003-06-18 | 2011-11-09 | 日本电信电话株式会社 | 无线分组通信方法及无线分组通信装置 |
WO2004114608A1 (ja) * | 2003-06-18 | 2004-12-29 | Nippon Telegraph And Telephone Corporation | 無線パケット通信方法 |
EP3934364B1 (en) * | 2003-09-09 | 2023-12-06 | Nippon Telegraph And Telephone Corporation | Multi-channel wlan station |
JP2006197045A (ja) * | 2005-01-12 | 2006-07-27 | Nec Corp | 無線パケット信号伝送システム、無線パケット信号伝送端末及びそれらに用いる無線パケット信号伝送方法 |
KR100713152B1 (ko) * | 2005-02-17 | 2007-05-02 | 삼성전자주식회사 | 홈네트워크 및 그의 채널할당방법 |
US20090125778A1 (en) * | 2005-12-15 | 2009-05-14 | Mitsubishi Electric Corporation | Communication system, transmission-side communication device, and reception-side communication device |
KR100794405B1 (ko) * | 2006-02-13 | 2008-01-16 | 주식회사 팬택앤큐리텔 | Ccsrl 계층에서의 메시지 전송 방법 및 그 처리 장치 |
JP2008060877A (ja) * | 2006-08-31 | 2008-03-13 | Hitachi Ltd | Mimo無線データ伝送システム |
JP4799396B2 (ja) * | 2006-12-25 | 2011-10-26 | 株式会社東芝 | 無線通信装置 |
MX2009007037A (es) * | 2007-01-04 | 2009-07-10 | Qualcomm Inc | Metodo y aparato para deteccion de espectro distribuido para comunicacion inalambrica. |
KR101265637B1 (ko) * | 2007-03-14 | 2013-05-22 | 엘지전자 주식회사 | 복수 개의 harq 프로세스 채널을 순차적으로 사용하여데이터를 송신하는 방법 |
WO2008142733A1 (ja) * | 2007-05-21 | 2008-11-27 | Fujitsu Limited | データ再送方法及び,これを適用する無線通信システム |
US20080311939A1 (en) * | 2007-06-18 | 2008-12-18 | Nokia Corporation | Acknowledgment aided space domain user scheduling for multi-user mimo |
WO2009011126A1 (ja) * | 2007-07-18 | 2009-01-22 | Panasonic Corporation | 受信装置、送信装置及び適応伝送レート制御方法 |
US8320486B2 (en) * | 2007-09-28 | 2012-11-27 | Apple Inc. | Retransmission method for HARQ in MIMO systems |
KR101626152B1 (ko) * | 2007-11-20 | 2016-06-01 | 삼성전자주식회사 | 통신 시스템에서 데이터 재전송 시스템 및 방법 |
WO2009154540A1 (en) * | 2008-06-19 | 2009-12-23 | Telefonaktiebolaget L M Ericsson (Publ) | Method and apparatus in a telecommunications network |
JP4962433B2 (ja) * | 2008-07-11 | 2012-06-27 | 日本電気株式会社 | 通信装置、通信システム、通信プログラム、および、通信方法 |
KR101497153B1 (ko) | 2008-12-22 | 2015-03-02 | 엘지전자 주식회사 | 무선랜 시스템에서의 기본서비스세트 부하 관리 절차 |
WO2010137777A1 (en) * | 2009-05-28 | 2010-12-02 | Lg Electronics Inc. | Apparatus and method for determination of frame structure for reducing interference in frequency reuse system using cognitive radio |
US9112618B2 (en) * | 2009-07-02 | 2015-08-18 | Qualcomm Incorporated | Coding latency reductions during transmitter quieting |
US8780982B2 (en) | 2009-07-02 | 2014-07-15 | Qualcomm Incorporated | Transmitter quieting and different encoding rates for portions of a set of frames |
US8902995B2 (en) * | 2009-07-02 | 2014-12-02 | Qualcomm Incorporated | Transmitter quieting and reduced rate encoding |
US8537772B2 (en) * | 2009-07-02 | 2013-09-17 | Qualcomm Incorporated | Transmitter quieting during spectrum sensing |
US8958475B2 (en) * | 2009-07-02 | 2015-02-17 | Qualcomm Incorporated | Transmitter quieting and null data encoding |
KR101698808B1 (ko) * | 2009-09-22 | 2017-01-24 | 삼성전자주식회사 | 다중 채널 통신 장치 및 방법 |
EP2302845B1 (en) | 2009-09-23 | 2012-06-20 | Google, Inc. | Method and device for determining a jitter buffer level |
US8650448B2 (en) | 2009-10-13 | 2014-02-11 | Intel Corporation | Retransmission techniques in wireless networks |
US20110134930A1 (en) * | 2009-12-09 | 2011-06-09 | Mclaren Moray | Packet-based networking system |
JP5351790B2 (ja) * | 2010-01-29 | 2013-11-27 | ソフトバンクモバイル株式会社 | 通信システム及び通信制御方法 |
JP5788971B2 (ja) * | 2010-05-03 | 2015-10-07 | アルカテル−ルーセント | 無線ネットワーク内でバッファ・ステータス・レポートを送信するための方法および装置 |
JP5672932B2 (ja) * | 2010-10-13 | 2015-02-18 | 富士ゼロックス株式会社 | 通信装置、通信システム及びプログラム |
US20120155458A1 (en) * | 2010-12-20 | 2012-06-21 | Brocade Communications Systems, Inc. | Repeated Lost Packet Retransmission in a TCP/IP Network |
US8751565B1 (en) | 2011-02-08 | 2014-06-10 | Google Inc. | Components for web-based configurable pipeline media processing |
US8681866B1 (en) | 2011-04-28 | 2014-03-25 | Google Inc. | Method and apparatus for encoding video by downsampling frame resolution |
US8661323B2 (en) | 2011-05-09 | 2014-02-25 | Google Inc. | Method and apparatus for generating packet mask |
US9106787B1 (en) | 2011-05-09 | 2015-08-11 | Google Inc. | Apparatus and method for media transmission bandwidth control using bandwidth estimation |
JP2013093717A (ja) * | 2011-10-25 | 2013-05-16 | Fujitsu Ltd | 無線局、通信システム、及び通信方法 |
US9490850B1 (en) | 2011-11-28 | 2016-11-08 | Google Inc. | Method and apparatus for decoding packetized data |
KR101970684B1 (ko) | 2012-02-28 | 2019-04-19 | 삼성전자주식회사 | 무선통신시스템에서 피드백 정보 전송 장치 및 방법 |
US9185429B1 (en) | 2012-04-30 | 2015-11-10 | Google Inc. | Video encoding and decoding using un-equal error protection |
US8971247B2 (en) * | 2012-05-25 | 2015-03-03 | Qualcomm Incorporated | Methods, devices, and systems for efficient retransmission communications |
JP6021487B2 (ja) * | 2012-07-18 | 2016-11-09 | キヤノン株式会社 | 情報処理システム、制御方法、サーバ、情報処理装置およびコンピュータプログラム |
US20140029523A1 (en) * | 2012-07-30 | 2014-01-30 | Baruch Sterman | Systems and methods for communicating a stream of data packets via multiple communications channels |
US10034023B1 (en) | 2012-07-30 | 2018-07-24 | Google Llc | Extended protection of digital video streams |
US9391810B2 (en) | 2012-07-30 | 2016-07-12 | Vonage Business Inc. | Systems and methods for communicating a stream of data packets via multiple communications channels |
US9560085B2 (en) | 2012-07-30 | 2017-01-31 | Vonage Business Inc. | Systems and methods for communicating a stream of data packets via multiple communications channels |
US9172740B1 (en) | 2013-01-15 | 2015-10-27 | Google Inc. | Adjustable buffer remote access |
US9311692B1 (en) | 2013-01-25 | 2016-04-12 | Google Inc. | Scalable buffer remote access |
US9225979B1 (en) | 2013-01-30 | 2015-12-29 | Google Inc. | Remote access encoding |
US10313079B2 (en) * | 2013-08-23 | 2019-06-04 | Qualcomm Incorporated | Common HARQ processes |
CN105432035B (zh) * | 2014-02-28 | 2019-05-03 | 华为技术有限公司 | 数据传输方法和通信设备 |
WO2015170475A1 (ja) | 2014-05-08 | 2015-11-12 | 日本電気株式会社 | 通信装置、通信システム、通信方法および通信用プログラムが記憶された記憶媒体 |
US9729283B2 (en) * | 2014-05-08 | 2017-08-08 | Intel IP Corporation | Systems, methods and devices for flexible retransmissions |
US9733847B2 (en) | 2014-06-02 | 2017-08-15 | Micron Technology, Inc. | Systems and methods for transmitting packets in a scalable memory system protocol |
JP6460688B2 (ja) * | 2014-09-12 | 2019-01-30 | 矢崎エナジーシステム株式会社 | 運行管理システム |
US11606782B2 (en) * | 2015-03-30 | 2023-03-14 | Qualcomm Incorporated | Event triggered multi-link channel quality measurement and report for mission critical applications |
US10469210B2 (en) | 2015-11-24 | 2019-11-05 | Marvell World Trade Ltd. | Acknowledgment data unit for data unit fragment |
JP6509774B2 (ja) | 2016-04-27 | 2019-05-08 | 双葉電子工業株式会社 | 通信システム、送信機、受信機及び通信方法 |
RU2019127262A (ru) | 2017-02-27 | 2021-03-29 | АйПиКОМ ГМБХ УНД КО. КГ | Обратная связь с настраиваемой задержкой |
JP2019033375A (ja) * | 2017-08-08 | 2019-02-28 | シャープ株式会社 | 通信装置および通信方法 |
JP7004900B2 (ja) * | 2017-12-08 | 2022-01-21 | 富士通株式会社 | 情報処理装置、情報処理システム、情報処理方法、及びプログラム |
WO2020030276A1 (en) * | 2018-08-09 | 2020-02-13 | Telefonaktiebolaget Lm Ericsson (Publ) | Transmitting and receiving signals |
CN111294859B (zh) * | 2019-05-24 | 2021-09-07 | 展讯通信(上海)有限公司 | 数据分组的传输方法及装置、存储介质、终端 |
US11570660B2 (en) * | 2020-03-18 | 2023-01-31 | Connectify, Inc. | Management of data communication connections |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH0535624A (ja) * | 1991-07-25 | 1993-02-12 | Melco:Kk | データ転送方法ならびにデータ送信装置および復元装置 |
JP2001044969A (ja) * | 1999-08-02 | 2001-02-16 | Mitsubishi Electric Corp | 移動体通信システム、基地局および移動通信端末、ならびに再送制御方法 |
JP2002281002A (ja) * | 2001-03-15 | 2002-09-27 | Nec Corp | データ再送方法及び通信システム |
JP2003101604A (ja) * | 2001-09-20 | 2003-04-04 | Sony Corp | データ伝送方法及び装置並びにデータ受信方法及び装置 |
JP2004040493A (ja) * | 2002-07-03 | 2004-02-05 | Matsushita Electric Ind Co Ltd | パケット通信装置及びパケット通信方法 |
Family Cites Families (35)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS57107658A (en) | 1980-12-25 | 1982-07-05 | Fujitsu Ltd | Control system for plurality of lines |
US4663706A (en) * | 1982-10-28 | 1987-05-05 | Tandem Computers Incorporated | Multiprocessor multisystem communications network |
JPH06232871A (ja) | 1993-01-29 | 1994-08-19 | Toshiba Corp | 無線通信システム |
US5430724A (en) * | 1993-07-02 | 1995-07-04 | Telefonaktiebolaget L M Ericsson | TDMA on a cellular communications system PCM link |
US5444718A (en) * | 1993-11-30 | 1995-08-22 | At&T Corp. | Retransmission protocol for wireless communications |
JPH08116331A (ja) | 1994-10-18 | 1996-05-07 | Casio Comput Co Ltd | データ伝送制御方法 |
JPH08237735A (ja) * | 1995-02-24 | 1996-09-13 | Toshiba Corp | 移動通信システムおよびこのシステムで使用される無線通信装置並びに無線データ伝送方法 |
US6307868B1 (en) * | 1995-08-25 | 2001-10-23 | Terayon Communication Systems, Inc. | Apparatus and method for SCDMA digital data transmission using orthogonal codes and a head end modem with no tracking loops |
SE511881C2 (sv) | 1997-08-08 | 1999-12-13 | Ericsson Telefon Ab L M | Förfarande och arrangemang för överföring av paketinformation i ett digitalt telekommunikationssystem |
US6021124A (en) * | 1997-08-19 | 2000-02-01 | Telefonaktiebolaget Lm Ericsson | Multi-channel automatic retransmission query (ARQ) method |
JP3373428B2 (ja) | 1998-05-01 | 2003-02-04 | シャープ株式会社 | データ伝送装置、データ伝送方法、データ伝送プログラムを記録した記録媒体およびデータ伝送プログラム |
US6697331B1 (en) * | 1999-11-17 | 2004-02-24 | Telefonaktiebolaget Lm Ericsson (Publ) | Link layer acknowledgement and retransmission for cellular telecommunications |
US6574668B1 (en) * | 2000-01-25 | 2003-06-03 | Cirrus Logic, Inc. | Retransmission scheme in wireless computer networks |
US20020154705A1 (en) * | 2000-03-22 | 2002-10-24 | Walton Jay R. | High efficiency high performance communications system employing multi-carrier modulation |
EP1195937A1 (en) * | 2000-10-03 | 2002-04-10 | Telefonaktiebolaget Lm Ericsson | Space-time coding with orthogonal transformations |
FR2818844B1 (fr) * | 2000-12-22 | 2003-03-07 | Mitsubishi Electricite | Procede de transmission de donnees entre au moins un emetteur et au moins un recepteur, emetteur, recepteur et systeme de transmission correspondants |
GB0110125D0 (en) * | 2001-04-25 | 2001-06-20 | Koninkl Philips Electronics Nv | Radio communication system |
US7289567B2 (en) | 2001-04-30 | 2007-10-30 | Motorola, Inc. | Apparatus and method for transmitting and receiving data using partial chase combining |
EP1255369A1 (en) * | 2001-05-04 | 2002-11-06 | TELEFONAKTIEBOLAGET LM ERICSSON (publ) | Link adaptation for wireless MIMO transmission schemes |
JP4271903B2 (ja) * | 2001-06-13 | 2009-06-03 | 株式会社エヌ・ティ・ティ・ドコモ | 移動体通信システム及び移動体通信方法 |
US7570656B2 (en) * | 2001-06-18 | 2009-08-04 | Yitran Communications Ltd. | Channel access method for powerline carrier based media access control protocol |
US7031419B2 (en) * | 2001-06-29 | 2006-04-18 | Nokia Corporation | Data transmission method and system |
US20030066004A1 (en) * | 2001-09-28 | 2003-04-03 | Rudrapatna Ashok N. | Harq techniques for multiple antenna systems |
US7269127B2 (en) * | 2001-10-04 | 2007-09-11 | Bae Systems Information And Electronic Systems Integration Inc. | Preamble structures for single-input, single-output (SISO) and multi-input, multi-output (MIMO) communication systems |
US20030067890A1 (en) * | 2001-10-10 | 2003-04-10 | Sandesh Goel | System and method for providing automatic re-transmission of wirelessly transmitted information |
JP3869712B2 (ja) * | 2001-12-14 | 2007-01-17 | 株式会社日立国際電気 | 無線ブリッジ |
JP3460715B2 (ja) | 2002-01-30 | 2003-10-27 | 松下電器産業株式会社 | 通信システムおよび通信方法 |
KR100434384B1 (ko) * | 2002-03-21 | 2004-06-04 | 엘지전자 주식회사 | 선택적 흐름제어를 통한 데이터 신뢰성 보장장치 및 방법 |
JP3679075B2 (ja) * | 2002-09-13 | 2005-08-03 | 松下電器産業株式会社 | 無線送信装置および無線送信方法 |
US7397864B2 (en) * | 2002-09-20 | 2008-07-08 | Nortel Networks Limited | Incremental redundancy with space-time codes |
US20040184470A1 (en) * | 2003-03-18 | 2004-09-23 | Airspan Networks Inc. | System and method for data routing |
US7532600B2 (en) * | 2003-04-25 | 2009-05-12 | Alcatel-Lucent Usa Inc. | Method and system for using hybrid ARQ in communication systems that use multiple input multiple output antenna systems |
KR101035219B1 (ko) * | 2003-10-08 | 2011-05-18 | 디지털 파운튼, 인크. | Fec-기반 신뢰도 제어 프로토콜 |
JP4343220B2 (ja) * | 2004-02-27 | 2009-10-14 | シャープ株式会社 | 通信装置、通信方法、通信プログラム、および通信プログラムを記録した記録媒体 |
JP4044942B2 (ja) * | 2005-04-08 | 2008-02-06 | 松下電器産業株式会社 | 無線送信装置および無線送信方法 |
-
2004
- 2004-06-18 EP EP04746381.5A patent/EP1635518B1/en active Active
- 2004-06-18 CA CA2701502A patent/CA2701502C/en active Active
- 2004-06-18 CA CA2701501A patent/CA2701501C/en active Active
- 2004-06-18 KR KR20057019401A patent/KR100807446B1/ko active IP Right Grant
- 2004-06-18 CA CA 2518590 patent/CA2518590C/en active Active
- 2004-06-18 JP JP2005507285A patent/JP4126059B2/ja not_active Expired - Fee Related
- 2004-06-18 US US10/548,788 patent/US7974243B2/en active Active
- 2004-06-18 WO PCT/JP2004/008912 patent/WO2004114610A1/ja active Application Filing
-
2008
- 2008-02-18 JP JP2008035896A patent/JP4510104B2/ja not_active Expired - Fee Related
- 2008-02-18 JP JP2008035895A patent/JP4510103B2/ja not_active Expired - Fee Related
- 2008-02-18 JP JP2008035897A patent/JP4589415B2/ja not_active Expired - Fee Related
-
2011
- 2011-05-16 US US13/108,504 patent/US8989108B2/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH0535624A (ja) * | 1991-07-25 | 1993-02-12 | Melco:Kk | データ転送方法ならびにデータ送信装置および復元装置 |
JP2001044969A (ja) * | 1999-08-02 | 2001-02-16 | Mitsubishi Electric Corp | 移動体通信システム、基地局および移動通信端末、ならびに再送制御方法 |
JP2002281002A (ja) * | 2001-03-15 | 2002-09-27 | Nec Corp | データ再送方法及び通信システム |
JP2003101604A (ja) * | 2001-09-20 | 2003-04-04 | Sony Corp | データ伝送方法及び装置並びにデータ受信方法及び装置 |
JP2004040493A (ja) * | 2002-07-03 | 2004-02-05 | Matsushita Electric Ind Co Ltd | パケット通信装置及びパケット通信方法 |
Cited By (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2008535444A (ja) * | 2005-04-05 | 2008-08-28 | テルコーディア テクノロジーズ インコーポレイテッド | 無線ネットワーク内における複数無線インターフェイスの使用 |
US8737402B2 (en) | 2005-05-11 | 2014-05-27 | Telefonaktiebolaget L M Ericsson (Publ) | Multi-carrier scheduling |
JP2008541607A (ja) * | 2005-05-11 | 2008-11-20 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | 複数キャリアのスケジューリング |
JP4834081B2 (ja) * | 2005-05-11 | 2011-12-07 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | 複数キャリアのスケジューリング |
WO2006130541A2 (en) * | 2005-05-31 | 2006-12-07 | Qualcomm Incorporated | Rank step-down for mimo systems employing harq |
WO2006130541A3 (en) * | 2005-05-31 | 2007-02-08 | Qualcomm Inc | Rank step-down for mimo systems employing harq |
US8842693B2 (en) | 2005-05-31 | 2014-09-23 | Qualcomm Incorporated | Rank step-down for MIMO SCW design employing HARQ |
KR100957435B1 (ko) | 2005-05-31 | 2010-05-11 | 콸콤 인코포레이티드 | Harq를 이용하는 mimo 시스템에 대한 랭크 스텝다운 |
US7869463B2 (en) | 2005-07-08 | 2011-01-11 | Fujitsu Limited | Transmitting apparatus and receiving apparatus for controlling retransmission of communication data and information communication method using the same |
CN101223759B (zh) * | 2005-07-08 | 2013-05-22 | 富士通株式会社 | 发送装置、信息通信方法 |
JP2007329694A (ja) * | 2006-06-08 | 2007-12-20 | Hitachi Ltd | 無線通信システムおよび無線通信装置 |
JP2008228091A (ja) * | 2007-03-14 | 2008-09-25 | Saxa Inc | リーダライタ装置 |
JP2009290341A (ja) * | 2008-05-27 | 2009-12-10 | Kyocera Corp | 携帯通信端末および無線通信方法 |
US9036610B2 (en) | 2009-05-08 | 2015-05-19 | Sony Corporation | Communication apparatus, communication method, and communication system for handling frames of variable length |
US9706436B2 (en) | 2009-05-08 | 2017-07-11 | Sony Corporation | Communication apparatus, communication method, and communication system for handling frames of variable length |
US10111134B2 (en) | 2009-05-08 | 2018-10-23 | Sony Corporation | Communication apparatus, communication method, and communication system for handling frames of variable length |
US10575214B2 (en) | 2009-05-08 | 2020-02-25 | Sony Corporation | Communication apparatus, communication method, and communication system for handling frames of variable length |
Also Published As
Publication number | Publication date |
---|---|
JP4510104B2 (ja) | 2010-07-21 |
EP1635518A1 (en) | 2006-03-15 |
JP4126059B2 (ja) | 2008-07-30 |
KR100807446B1 (ko) | 2008-02-25 |
CA2518590A1 (en) | 2004-12-29 |
US20060171353A1 (en) | 2006-08-03 |
US20110216728A1 (en) | 2011-09-08 |
JP2008187725A (ja) | 2008-08-14 |
CA2518590C (en) | 2010-08-10 |
JP4510103B2 (ja) | 2010-07-21 |
JP2008193707A (ja) | 2008-08-21 |
US7974243B2 (en) | 2011-07-05 |
CA2701501C (en) | 2016-01-26 |
JP4589415B2 (ja) | 2010-12-01 |
CA2701501A1 (en) | 2004-12-29 |
JPWO2004114610A1 (ja) | 2006-07-27 |
EP1635518B1 (en) | 2019-07-31 |
KR20060016751A (ko) | 2006-02-22 |
CA2701502C (en) | 2014-08-05 |
JP2008148358A (ja) | 2008-06-26 |
US8989108B2 (en) | 2015-03-24 |
CA2701502A1 (en) | 2004-12-29 |
EP1635518A4 (en) | 2011-07-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2004114610A1 (ja) | 無線パケット通信方法 | |
US11533130B2 (en) | Method and arrangement for retransmission using HARQ | |
JP5384686B2 (ja) | 通信システムにおける方法および装置 | |
CN102474392B (zh) | 在针对采用多点协作传输接收的分组的nack传输中引入延迟 | |
KR20060059256A (ko) | 송신기와 수신기간 데이터 전송 방법, 중계기 노드, 통신노드 네트워크 | |
KR20160036458A (ko) | 단말간 통신의 harq 처리 방법 및 장치 | |
US11271686B2 (en) | Hybrid automatic repeat request acknowledgement and upload multiuser operation | |
Shi et al. | Retransmission schemes for 5G radio interface | |
US11546100B2 (en) | Operation of automatic repeat request | |
US20210021379A1 (en) | Base station and automatic retransmission scheduling method thereof | |
JP2011055435A (ja) | 再送制御装置及び再送制御方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES 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 NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): BW GH GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK 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 | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2005507285 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2518590 Country of ref document: CA Ref document number: 2004746381 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2006171353 Country of ref document: US Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10548788 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 20048097603 Country of ref document: CN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020057019401 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 1020057019401 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 2004746381 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 10548788 Country of ref document: US |