Cooperative hybrid‐automatic repeat request (HARQ) protocols, which can exploit the spatial and temporal diversities, have been widely studied. The efficiency of cooperative HARQ protocols is higher than that of cooperative protocols because retransmissions are only performed when necessary. We classify cooperative HARQ protocols as three decode‐and‐forward‐based HARQ (DF‐HARQ) protocols and two amplified‐and‐forward‐based HARQ (AF‐HARQ) protocols. To compare these protocols and obtain the optimum parameters, two unified frameworks are developed for protocol analysis. Using the frameworks, we can evaluate and compare the maximum throughput and outage probabilities according to the SNR, the relay location, and the delay constraint. From the analysis we can see that the maximum achievable throughput of the DF‐HARQ protocols can be much greater than that of the AF‐HARQ protocols due to the incremental redundancy transmission at the relay.

No abstract

Cooperative hybrid-ARQ (HARQ) protocols have been widely studied because they are more efficient than cooperative protocols without HARQ. In [7J, the throughput of a cooperative HARQ protocol based on the decode-andforward protocol (DF-HARQ) is obtained. In this paper, the maximum achievable throughput of the DF-HARQ protocol is obtained using the asymptotic outage probability when the maximum number of transmission (M) goes to infinity. The range of the optimum worst-case coding rate (R) of the maximum achievable throughput is also obtained. Furthermore, we can expect that the methodology for obtaining the maximum achievable throughput in this paper also applicable to other cooperative HARQ protocols

No abstract

This paper presents a theoretical analysis of mobility detection in connectivity-based localization, which exploits connectivity information as range measurements to anchors at a known location, to investigate how well and how precise mobility can be detected with connectivity in short-range networks. We derive mobility detection, miss detection, and false alarm probabilities in terms of a mobility detection threshold, defined as the minimum distance to detect the mobility, under the shadow fading channel and arbitrary mobility models to take into account practical and general scenarios. Based on the derivations, we address the threshold determination with the criteria in the sense of the minimum average error from miss detection and false alarm. Numerical and simulation evaluations are performed to verify our theoretical derivations, to show that increasing anchor numbers can improve the mobility detection probability with a smaller detection threshold, and that the probabilities are bounded by the weights of miss detection and false alarm. This work is the first attempt at addressing the performance of mobility detection using connectivity, and it can be utilized as a baseline for connectivity-based mobility tracking.