We propose an efficient hybrid automatic repeat request (HARQ) method that simultaneously achieves packet combining and resolution of the collisions of random access identifiers (RAIDs) during retransmission in a non-orthogonal multiple access (NOMA)-based random access system. Here, the RAID functions as a separator for simultaneously received packets that use the same channel in NOMA. An example of this is a scrambling code used in 4G and 5G systems. Since users independently select a RAID from the candidate set prepared by the system, the decoding of received packets fails when multiple users select the same RAID. Random RAID reselection by each user when attempting retransmission can resolve a RAID collision; however, packet combining between the previous and retransmitted packets is not possible in this case because the base station receiver does not know the relationship between the RAID of the previously transmitted packet and that of the retransmitted packet. To address this problem, we propose a HARQ method that employs novel hierarchical tree-structured RAID groups in which the RAID for the previous packet transmission has a one-to-one relationship with the set of RAIDs for retransmission. The proposed method resolves RAID collisions at retransmission by randomly reselecting for each user a RAID from the dedicated RAID set from the previous transmission. Since the relationship between the RAIDs at the previous transmission and retransmission is known at the base station, packet combining is achieved simultaneously. Computer simulation results show the effectiveness of the proposed method.

In unlicensed spectrum, wireless communications employing carrier sense multiple access with collision avoidance (CSMA/CA) suffer from longer transmission delay time as the number of user terminals (UTs) increases, because packet collisions are more likely to occur. To cope with this problem, this paper proposes a new multiuser detection (MUD) scheme that uses both request-to-send (RTS) and enhanced clear-to-send (eCTS) for high-reliable and low-latency wireless communications. As in conventional MUD scheme, the metric-combining MUD (MC-MUD) calculates log likelihood functions called metrics and accumulates the metrics for the maximum likelihood detection (MLD). To avoid increasing the number of states for MLD, MC-MUD forces the relevant UTs to retransmit their packets until all the collided packets are correctly detected, which requires a kind of central control and reduces the system throughput. To overcome these drawbacks, the proposed scheme, which is referred to as cancelling MC-MUD (CMC-MUD), deletes replicas of some of the collided packets from the received signals, once the packets are correctly detected during the retransmission. This cancellation enables new UTs to transmit their packets and then performs MLD without increasing the number of states, which improves the system throughput without increasing the complexity. In addition, the proposed scheme adopts RTS and eCTS. One UT that suffers from packet collision transmits RTS before the retransmission. Then, the corresponding access point (AP) transmits eCTS including addresses of the other UTs, which have experienced the same packet collision. To reproduce the same packet collision, these other UTs transmit their packets once they receive the eCTS. Computer simulations under one AP conditions evaluate an average carrier-to-interference ratio (CIR) range in which the proposed scheme is effective, and clarify that the transmission delay time of the proposed scheme is shorter than that of the conventional schemes. In two APs environments that can cause the hidden terminal problem, it is demonstrated that the proposed scheme achieves shorter transmission delay times than the conventional scheme with RTS and conventional CTS.

This paper describes a simple packet combining scheme with maximum likelihood detection (MLD) for multiple-input multiple-output with orthogonal frequency division multiplexing (MIMO-OFDM) in relay channels to construct reliable wireless links in wireless local area networks (LANs). Our MLD-based approach employs the multiplexed sub-stream signals in different transmit slots. The proposed scheme uses an additional combining process before MLD processing. Moreover, the proposed scheme sets the cyclic shift delay (CSD) operation in the relay terminal. We evaluate the performance of the proposed scheme by the packet error rate (PER) and throughput performance in the decode-and-forward (DF) strategy. First, we show that the proposed scheme offers approximately 4.5dB improvement over the conventional scheme in the received power ratio of the relay terminal to the destination terminal at PER =0.1. Second, the proposed scheme achieves about 1.6 times the throughput of the conventional scheme when the received power ratio of the relay terminal to the destination terminal is 3dB.

The application of Cumulative Decision Feedback (DF) technique for energy/complexity constrained Wireless Sensor Networks (WSN) is considered. Theoretical bit error probability and average rate of a BPSK modulated DF are derived together with PHY-MAC layers' energy efficiency model for DF and Forward Error Correction (FEC) techniques. Moreover, an empirical optimization, which in turn relies upon a low complexity SNR estimation method also derived in this letter, is applied to the DF technique in order to obtain maximum energy efficiency.

In uplink data communication in wireless networks, a portable computer may retransmit a packet multiple times before the base station receives the correct one. Each retransmission consumes communication bandwidth and battery energy of the portable computer. Therefore, it is desirable to reduce the number of retransmissions. In this paper, we propose the aggressive packet combining scheme for this purpose. The base station executes this scheme to combine multiple erroneous copies as follows: (1) perform bit-by-bit majority voting on the erroneous copies to produce a combined packet, (2) identify the least reliable bits in this combined packet, and (3) search the correct bit pattern for these bits. Then the base station may recover the correct packet, thereby reducing the mean number of retransmissions. The proposed scheme has several advantages: (1) it is more powerful than the majority packet combining scheme, (2) it can complement many existing ARQ protocols to improve their performance, (3) it does not add additional bits to the packet and hence it does not consume extra bandwidth in the wireless channel, and (4) it is only executed by the base station and hence the portable transceiver can be kept simple. The simulation results show that the proposed scheme is more bandwidth-efficient and energy-efficient than the majority packet combining scheme.

This paper proposes a new maximal ratio combining (MRC) frequency diversity automatic-repeat-request (ARQ) scheme suitable for high-speed orthogonal frequency division multiplexing (OFDM) systems that is based on the conventional packet combining ARQ scheme. The proposed scheme regularly changes the previously prepared subcarrier assignment pattern at each retransmission according to the number of retransmissions. This scheme sharply reduces the number of ARQ retransmissions and much improves the throughput performance in slow fading environments by virtue of the frequency diversity effect while it requires no complex adaptive operations. Computer simulation results show that the proposed scheme reduces the required number of retransmissions to about 3 at the accumulative correct packet reception rate (ACPRR) of 0.9.

An efficient ARQ scheme based on the packet combining technique is investigated for multi-carrier modulation systems. In multi-carrier modulation systems, several sub-carriers are used for high data rate transmission and their individual received signal quality becomes different from one sub-carrier to others in a frequency selective fading channel. Therefore by changing the assignment of data to the sub-carriers in the retransmission packets, the distortion between the previous transmitted packet and the newly retransmitted one will be different. This is the principle of the proposed adaptive data order rearrangement for a packet combining ARQ scheme, which can achieve more diversity gain in packet combining and improve the ARQ performance. From the results of the theoretical analysis and the computer simulation, it is confirmed that the proposed packet combining ARQ with the proposed operation can achieve the better performance in terms of the average packet transmission success probability. In addition, this proposed scheme is also compared with the conventional multi-carrier modulation ARQ scheme based on the partial retransmission of a packet. The computer simulation results demonstrate that the proposed scheme has also advantage against the latter one, and it is considered to be as a more efficient ARQ scheme for multi-carrier modulation systems.

The performance of the hybrid-ARQ scheme with a convolutional code, in which the retransmission criterion is based on an estimated decoding error rate, is evaluated for moderately time-varying channels. It is shown by computer simulations that the simple average diversity combining scheme can almost attain the same performance as the optimally weighted diversity combining scheme. For the whole and partial retransmission schemes with the average diversity combining, the theoretical bounds of throughput and bit error rate are derived, and it is shown that their bounds are tight and the treated schemes can attain a given error rate with good throughput for moderately time-varying channels. Furthermore, the throughput is shown to be improved by the partial retransmission scheme compared with the whole retransmission scheme.

A new Hybrid-ARQ scheme with a convolutional code and the Viterbi decoding is proposed, which uses the packet combining technique and a retransmission criterion based on an estimated decoding error rate. The throughput and bit error rate are evaluated by theoretical bounds and computer simulations. It is shown that a given error rate tolerance can be attained with good throughput for any signal to noise ratio, i.e. for the slow time-varying channels. Furthermore, the throughput performance can be improved by retransmitting not all but a part of packet.