Relevant bibliographies by topics / Automatic repeat request

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Automatic repeat request'

Author: Grafiati
Published: 4 June 2021
Last updated: 15 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Automatic repeat request.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Automatic repeat request"

1

Makki, Behrooz, Tommy Svensson, Thomas Eriksson, and Mohamed-Slim Alouini. "Coordinated Hybrid Automatic Repeat Request." IEEE Communications Letters 18, no. 11 (2014): 1975–78. http://dx.doi.org/10.1109/lcomm.2014.2360178.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Prasolov, V. A., and D. A. Tokarev. "Automatic repeat request with turbo-codes." Infokommunikacionnye tehnologii 15, no. 3 (2017): 257–61. http://dx.doi.org/10.18469/ikt.2017.15.3.07.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Choi, Sang Won. "Index Coded Automatic Repeat Request (ARQ)." Entropy 22, no. 8 (2020): 869. http://dx.doi.org/10.3390/e22080869.

Full text
Abstract:
In this paper, an index-coded Automatic Repeat Request (ARQ) is studied in the perspectives of transmission efficiency and memory overhead. Motivated by reducing significant computational complexity from huge matrix inverse computation of random linear network coding, a near-to-optimal broadcasting scheme, called index-coded Automatic Repeat Request (ARQ) is proposed. The main idea is to consider the principal packet error pattern across all receivers. With the help of coded side information formed by successfully decoded packets associated with the dominant packet error pattern, it is shown that two contradictory performance metrics such as transmission efficiency and transmit (receive) cache memory size for index coding (decoding) can be enhanced with a reasonable trade-off. Specifically, the transmission efficiency of the proposed scheme is proved to be asymptotically optimal, and memory overhead is shown to be asymptotically close to the conventional ARQ scheme. Numerical results also validate the proposed scheme in the sense of memory overhead and transmission efficiency in comparison with the conventional ARQ scheme and the optimal scheme using random linear network coding.
APA, Harvard, Vancouver, ISO, and other styles
4

Rehman, Ateeq Ur, Varghese Antony Thomas, Lie-Liang Yang, and Lajos Hanzo. "Performance of Cognitive Selective-Repeat Hybrid Automatic Repeat Request." IEEE Access 4 (2016): 9828–46. http://dx.doi.org/10.1109/access.2016.2628776.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Prasolov, V. A., and D. A. Tokarev. "AUTOMATIC REPEAT REQUEST WITH TURBO-CODES DECODING." Vestnik of Ryazan State Radio Engineering University 61 (2017): 3–7. http://dx.doi.org/10.21667/1995-4565-2017-61-3-3-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vitsas, V., and A. C. Boucouvalas. "Automatic repeat request schemes for infrared wireless communications." Electronics Letters 38, no. 5 (2002): 244. http://dx.doi.org/10.1049/el:20020163.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xiao You Zhou and Ahmed E. Kamal. "Automatic repeat-request protocols and their queueing analysis." Computer Communications 13, no. 5 (1990): 298–311. http://dx.doi.org/10.1016/0140-3664(90)90018-c.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rong Zhang and Lajos Hanzo. "Superposition-Aided Delay-Constrained Hybrid Automatic Repeat ReQuest." IEEE Transactions on Vehicular Technology 59, no. 4 (2010): 2109–15. http://dx.doi.org/10.1109/tvt.2010.2040040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Jun, Yiqiang Q. Zhao, Yifeng Zhou, and Louise Lamont. "Packet Delay Statistics of the Multichannel Selective-Repeat Automatic-Repeat-Request." Wireless Personal Communications 66, no. 2 (2011): 235–49. http://dx.doi.org/10.1007/s11277-011-0325-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ngo, Hoang Anh, and Lajos Hanzo. "Hybrid Automatic-Repeat-reQuest Systems for Cooperative Wireless Communications." IEEE Communications Surveys & Tutorials 16, no. 1 (2014): 25–45. http://dx.doi.org/10.1109/surv.2013.071913.00073.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Automatic repeat request"

1

Beirouti, Patrick. "Automatic repeat request on fading channels." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61226.

Full text
Abstract:
Automatic repeat request (ARQ) is a widespread technique for error control in data communication systems. This research examines the performance of conventional ARQ schemes over fading channels. The basic Gilbert-Elliott two-state Markov model is used to represent these channels. This basic model is recursively extended to a 2$ sp{n}$-state Markov chain suitable for n-bit block codes. Using this 'Extended Gilbert-Elliot' model, an approximation of the throughput efficiency of the conventional ARQ schemes is derived. This approximation is particularly valid for slow fading channels. Furthermore, performance plots are obtained, showing the effects of channel fading on throughput efficiency: ARQ performance deteriorates with slower fading, or alternatively, higher channel memory. Consequently, frequency-hopped codeword transmission is explored, a technique by which channel memory can be reduced. Throughput performance of frequency-hopped ARQ systems is derived, which shows significant potential improvements over systems with no frequency hopping.
APA, Harvard, Vancouver, ISO, and other styles
2

Rehman, Ateeq Ur. "Hybrid automatic repeat request assisted cognitive radios." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/419585/.

Full text
Abstract:
It is widely known that the Cognitive Radio (CR) paradigm has the potential of improving the exploitation of the earmarked but momentarily unoccupied spectrum, which is exclusively allocated to the primary users (PUs) based on the conventional fixed spectrum allocation policy. The CR systems first have to sense, whether the PU’s band is unoccupied and then dynamically access it. Naturally, CR systems suffer from the same propagation impairments as the traditional wireless communication systems, such as interference, fading and noise, which affect both the reliability and the attainable data rate. In order for the CR system to achieve both reliable data transmission as well as a high throughput and low delay, we propose novel CR-aided Hybrid Automatic Repeat Request (HARQ) protocols, which intrinsically amalgamate the CR functions with HARQ protocols and study their performance. Both perfect and imperfect spectrum sensing are considered. Specifically, we propose the cognitive stop-and-wait-HARQ (CSW-HARQ), cognitive Go-Back-N-HARQ (CGBN-HARQ) as well as the cognitive selective-repeat (CSR-HARQ) schemes and study their throughput and delay both by analysis and simulation. To protect the PUs legal rights, we model their activity of occupying a primary radio (PR) channel as a two-state Markov chain consisting of ‘ON’ and ‘OFF’ states. In order to use the PR channel, the CR system first senses the presence of the PUs and once the PR channel is found to be free (i.e., in the OFF state), the CR system transmits its data packets relying on the principles of SW-HARQ, GBN-HARQ and SR-HARQ. Otherwise, the CR system continues sensing the channel until finding a free one. Naturally, the PR channel may be sensed erroneously, which results either in false alarm or in misdetection. Therefore, the channel may be modelled by a two-state Markov chain, provided that sensing is ideal, or by a four-state Markov chain, if sensing is non-ideal. Here, the four states are determined by the actual state of the PR channel and the state sensed by the CR system. We analyse both the throughput and delay of CR systems relying on different HARQ schemes. We invoke a pair of analytical approaches, namely the probability based approach and the Discrete Time Markov Chain (DTMC) based approach. Closed-form expressions are derived for the throughput, average packet delay and the end-to-end packet delay. Furthermore, for the end-to-end packet delay, we derive both the probability distribution and the average end-to-end packet delay. In the DTMCbased approach, we propose a state generation algorithm for eliminating the illegitimate states, which helps reduce both the dimensionality of the related state transition matrices and the associated computational complexity. All the equations obtained by analysis are validated by numerical simulations. Our performance results reveal that both the achievable throughput and delay of the CSWHARQ, CGBN-HARQ and the CSR-HARQ schemes are substantially affected by the activity of the PUs, by the reliability of the PR channels, by the unreliable sensing decisions and by the number of packets transmitted per time-slot (TS). Specifically, when the probability of the PR channel being busy is high and/or its reliability is relatively low, the throughput attained by these HARQ schemes becomes relatively low and their packet delay increases. Furthermore, for the CGBN-HARQ and CSR-HARQ, our results show that when the propagation environment is time-variant, the number of packets transmitted within a TS should be adapted accordingly, in order to attain the highest throughput and the shortest average transmission delay.
APA, Harvard, Vancouver, ISO, and other styles
3

Ngo^, Hoa`ng Anh. "Hybrid automatic-repeat-reQuest systems for cooperative wireless communications." Thesis, University of Southampton, 2012. https://eprints.soton.ac.uk/210915/.

Full text
Abstract:
As a benefit of achieving a diversity gain and/or a multiplexing gain, MIMO techniques are capable of significantly increasing the achievable throughput and/or the network coverage without additional bandwidth or transmit power. For the sake of striking an attractive trade-off between the attainable diversity gain and/or multiplexing gain, in this thesis the novel Space-Time-Frequency Shift Keying (STFSK) concept is proposed for the family of MIMO systems. More specifically, in order to generate space-time-frequency domain codewords, the STFSK encoding schemes activate one out of Q dispersion matrices, and the associated address bits are then combined with a classic time-domain and frequency-domain modulation scheme. The resultant arrangements impose no inter-symbol interference and are capable of eliminating the inter-antenna interference, hence offering a range of benefits over other classic MIMO arrangements. Additionally, a soft-output STFSK demodulator is designed for iterative detection and the complexity of both the hard- as well as soft-decision demodulators is quantified. Furthermore, the STFSK performance is studied in both the single-user and the multipleuser multi-cell environment in order to investigate the effects of these techniques on the performance of the holistically optimized systems. Furthermore, we studied the H-ARQ systems advocated in the context of cooperation-aided wireless networks, where the MIMO elements are constituted by the individual elements of separate network nodes. Both perfect and imperfect coherent detection as well as non-coherent detection aided cooperative H-ARQ schemes are considered. In the perfect coherent detection based pilot symbol assisted scheme, a novel relay-switching aided H-ARQ scheme is proposed for mitigating the effects of correlation in fading wireless channels, followed by a H-ARQ scheme employing systematic Luby transform codes. In contrast to the unrealistic perfect coherent detection, realistic imperfect coherent schemes are studied, where the channel impulse responses are imperfectly estimated. Furthermore, non-coherent differential detection aided cooperative H-ARQ schemes are proposed and compared to their coherent detection assisted counterparts. Finally, a novel cooperative H-ARQ arrangement based on distributed space-time codes is proposed for the sake of improving the attainable system throughput, while reducing the system’s complexity.
APA, Harvard, Vancouver, ISO, and other styles
4

Qin, Yang. "Performance of network coded systems supported by automatic repeat request." Thesis, University of Southampton, 2012. https://eprints.soton.ac.uk/336231/.

Full text
Abstract:
Inspired by the network information theory, network coding was invented in 2000. Since then, the theory and application of network coding have received intensive research and various network coding schemes have been proposed and studied. It has been demonstrated that the packetlevel network coding has the potential to outperform the traditional routing strategies in packet networks. By taking the advantages of the information carried by the packets sent to different receivers (sinks) in a packet network, packet-level network coding is capable of reducing the number of packets transmitted over the network. Therefore, the packet-level network coding employs the potential for boosting the throughput of packet networks. By contrast, the symbollevel network coding, which is also referred to as the physical-layer network coding, is capable of exploiting interference instead of avoiding it for improving the channel capacity and/or enhancing the reliability of communications. In this thesis, our focus is on the packet-level network coding. Performance of communication systems with network coding has been widely investigated from different perspectives, mainly under the assumption that packets are reliably transmitted over networks without errors. However, in practical communication networks, transmission errors always occur and error-detection or error-correction techniques are required in order to ensure reliable communications. Therefore, in this report, we focus our attention mainly on studying the performance of the communication networks with packet-level network coding, where Automatic Retransmission reQuest (ARQ) schemes are employed for error protection. Three typical ARQ schemes are invoked in our research, which are the Stop-and-Wait ARQ (SW-ARQ), Go-Back-N ARQ (GBN-ARQ) and the Selective-Repeat ARQ (SR-ARQ). Our main concern is the impact of network coding on the throughput performance of network coding nodes or networks containing network coding nodes. Additionally, the impact of network coding on the delay performance of network coding nodes or coded networks is also addressed. In a little more detail, in Chapter 3 of the thesis, we investigate the performance of the netvi works employing packet-level network coding, when assuming that transmission from one node to another is not ideal and that a certain ARQ scheme is employed for error-control. Specifically, the delay characteristics of general network coding node are first analyzed. Our studies show that, when a coding node invokes more incoming links, the average delay for successfully forming coded packets increases. Then, the delay performance of the Butterfly networks is investigated, which shows that the delay generated by a Butterfly network is dominated by the communication path containing the network coding node. Finally, the performance of the Butterfly network is investigated by simulation approaches, when the Butterfly network employs SW-ARQ, GBN-ARQ, or SR-ARQ for error-control. The achievable throughput, the average delay as well as the standard deviation of the delay are considered. Our performance results show that, when given a packet error rate Packet Error Rate (PER), the SR-ARQ scheme is capable of attaining the highest throughput and resulting in the lowest delay among these three ARQ schemes. In Chapter 4, the steady-state throughput of general network coding nodes is investigated, when the SW-ARQ scheme is employed. We start with considering a Two-Input-Single-Output (2ISO) network coding node without queueing buffers. Expressions for computing the steady-state throughput is derived. Then, we extend our analysis to the general H-Input-Single-Output (HISO) network coding nodes without queueing buffers. Finally, our analytical approaches are further extended to the HISO network coding nodes with queueing buffers. A range of expressions for evaluating the steady-state throughput are obtained. The throughout performance of the HISO network coding nodes is investigated by both analytical and simulation approaches. Our studies in this chapter show that the throughput of a network coding node decreases, as the number of its incoming links increases. This property implies that, in a network coding system, the coding nodes may form the bottlenecks for information delivery. Furthermore, the studies show that adding buffers to the network coding node may improve the throughput performance of a network coding system. Then, in Chapters 5 and 6, we investigate the steady-state throughput performance of the general network coding nodes, when the GBN-ARQ in Chapter 5 or the SR-ARQ in Chapter 6 is employed. Again, analytical approaches for evaluating the steady-state throughput of the general network coding nodes are concerned and a range of analytical results are obtained. Furthermore, the throughput performance of the network coding nodes supported by the GBN-ARQ or SR-ARQ is investigated by both simulations and numerical approaches. Finally, in Chapter 7, the conclusions extracted from the research are summarized and the possible directions for future research are proposed.
APA, Harvard, Vancouver, ISO, and other styles
5

Kalscheuer, Jon M. "A selective automatic repeat request protocol for undersea acoustic links." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Jun%5FKalscheuer.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Shi, Tao. "Turbo coded hybrid automatic repeat request and differential space-time spreading /." Full text available from ProQuest UM Digital Dissertations, 2007. http://0-proquest.umi.com.umiss.lib.olemiss.edu/pqdweb?index=0&did=1609153711&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1245353026&clientId=22256.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Furuhashi, Takeshi, Tomohiro Yoshikawa, Hiromu Takahashi, and Yusuke Kaneda. "A Study on Reliability-based Selective Repeat Automatic Repeat Request for Reduction of Discrimination Time of P300 Speller." 日本知能情報ファジィ学会, 2010. http://hdl.handle.net/2237/20692.

Full text
Abstract:
Session ID: SA-B1-2<br>SCIS & ISIS 2010, Joint 5th International Conference on Soft Computing and Intelligent Systems and 11th International Symposium on Advanced Intelligent Systems. December 8-12, 2010, Okayama Convention Center, Okayama, Japan
APA, Harvard, Vancouver, ISO, and other styles
8

Mantha, Ramesh. "Hybrid automatic repeat request schemes using turbo codes and low-density parity check codes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape8/PQDD_0019/MQ58728.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Takahashi, Hiromu, Tomohiro Yoshikawa, and Takeshi Furuhashi. "A Study on Application of Reliability Based Automatic Repeat Request to Brain Computer Interfaces." Springer-Verlag, 2009. http://hdl.handle.net/2237/13910.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

FURUHASHI, Takeshi, Tomohiro YOSHIKAWA, and Hiromu TAKAHASHI. "Error Control for Performance Improvement of Brain-Computer Interface: Reliability-Based Automatic Repeat Request." 電子情報通信学会, 2011. https://search.ieice.org/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Automatic repeat request"

1

Mantha, Ramesh. Hybrid automatic repeat request schemes using turbo codes and low density parity check codes. National Library of Canada, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

A Selective Automatic Repeat Request Protocol for Undersea Acoustic Links. Storming Media, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Automatic repeat request"

1

Weik, Martin H. "automatic repeat request." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1134.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Weik, Martin H. "automatic request repeat." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1135.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Faruque, Saleh. "Automatic Repeat Request (ARQ)." In SpringerBriefs in Electrical and Computer Engineering. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-21170-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Faruque, Saleh. "Automatic Repeat Request (ARQ)." In Free Space Laser Communication with Ambient Light Compensation. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-57484-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

García-García, Carlos, Juan Gómez-Luna, Ezequiel Herruzo Gomez, and José Ignacio Benavides Benitez. "simARQ, An Automatic Repeat Request Simulator for Teaching Purposes." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32304-1_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Qin, Yang, and Lie-Liang Yang. "Throughput of Network Coding Nodes Employing Go-Back-N or Selective-Repeat Automatic Repeat ReQuest." In Network Coding at Different Layers in Wireless Networks. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29770-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chenglin, Shangguan, Jia Dai, Yang Yanbao, Yu Hanxiao, Sun Ce, and Fei Zesong. "A Hybrid Automatic Repeat reQuest Scheme Based on Maximum Distance Separable Codes." In Communications and Networking. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66625-9_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Qin, Yang, and Lie-Liang Yang. "Erratum to: Throughput of Network Coding Nodes Employing Go-Back-N or Selective-Repeat Automatic Repeat ReQuest." In Network Coding at Different Layers in Wireless Networks. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29770-5_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Takahashi, Hiromu, Tomohiro Yoshikawa, and Takeshi Furuhashi. "A Study on Application of Reliability Based Automatic Repeat Request to Brain Computer Interfaces." In Advances in Neuro-Information Processing. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03040-6_123.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Takahashi, Hiromu, Tomohiro Yoshikawa, and Takeshi Furuhashi. "Reliability-Based Automatic Repeat reQuest with Error Potential-Based Error Correction for Improving P300 Speller Performance." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17534-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Automatic repeat request"

1

Soleymani, Touraj, John S. Baras, and Deniz Gündüz. "Networked Control with Hybrid Automatic Repeat Request Protocols." In 2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024. http://dx.doi.org/10.1109/isit57864.2024.10619447.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gönültaş, Emre, Swathi Priya Dhandhapani, Stefan Adalbjörnsson, and Zaigham Kazmi. "AI-Assisted Link Adaptation: Predicting Hybrid Automatic Repeat Request Success." In 2024 58th Asilomar Conference on Signals, Systems, and Computers. IEEE, 2024. https://doi.org/10.1109/ieeeconf60004.2024.10942964.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Huang, Qinan, Jianhua Zeng, Chongtao Guo, Jing Liu, and Haoyuan Pan. "AoI Analysis for Automatic Repeat-Request in Vehicular Cooperative Perception Networks." In 2024 IEEE 100th Vehicular Technology Conference (VTC2024-Fall). IEEE, 2024. https://doi.org/10.1109/vtc2024-fall63153.2024.10757510.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Du, Ruopu, Bowen Feng, Yi Yang, and Qinyu Zhang. "AoI-Based Coded Hybrid Automatic Repeat Request Strategy for Non- Terrestrial Networks." In 2024 IEEE 99th Vehicular Technology Conference (VTC2024-Spring). IEEE, 2024. http://dx.doi.org/10.1109/vtc2024-spring62846.2024.10683245.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

"Performance Analysis of Basic Automatic Repeat Request Protocols and Hybrid Automatic Repeat Request Protocol." In 4th International Conference on Communication Engineering and Computer Science (CIC-COCOS’2022). Cihan University, 2022. http://dx.doi.org/10.24086/cocos2022/paper.567.

Full text
Abstract:
The size of network and internet traffic is rising spontaneously by the day, with data usage at zettabyte to petabyte scale at an exponential high rate and therefore considered to generate huge traffic along the way which causes the chance of error in transmission to be high as well. Automatic Repeat Request (ARQ) protocol is an error control function for data transmission that uses acknowledgements. These protocols exist in Data link or Transport layers. ARQ is categorize into three major types such as Stop and wait, Go Bank N and Selective Repeat. Hybrid automatic repeat (HARQ) request which is an advancement to earlier mentioned protocols to detect error via cycle redundancy check was later developed. This paper evaluates the performance of these basic ARQs and HARQ protocols in consideration of the current state of high signal interference and collision during competitive accesses, more especially in highly densely networks.
APA, Harvard, Vancouver, ISO, and other styles
6

Shi, T., and L. Cao. "Differential Space-Time Spreading with Segment Selective Repeat-Based Automatic Repeat Request." In 2008 IEEE International Conference on Communications. IEEE, 2008. http://dx.doi.org/10.1109/icc.2008.349.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Claypool, David J., and Kevin M. McNeill. "Automatic repeat request (ARQ) over TDMA-based mesh network." In MILCOM 2008 - 2008 IEEE Military Communications Conference (MILCOM). IEEE, 2008. http://dx.doi.org/10.1109/milcom.2008.4753653.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Qin, Yang, and Lie-Liang Yang. "Throughput comparison of automatic repeat request assisted Butterfly networks." In 2010 7th International Symposium on Wireless Communication Systems (ISWCS 2010). IEEE, 2010. http://dx.doi.org/10.1109/iswcs.2010.5624344.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Qin, Yang, and Lie-Liang Yang. "Delay comparison of automatic repeat request assisted Butterfly networks." In 2010 7th International Symposium on Wireless Communication Systems (ISWCS 2010). IEEE, 2010. http://dx.doi.org/10.1109/iswcs.2010.5624489.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Xiayang, Matthew D. Higgins, and Mark S. Leeson. "Stop-and-wait automatic repeat request schemes for molecular communications." In 2013 First International Black Sea Conference on Communications and Networking (BlackSeaCom). IEEE, 2013. http://dx.doi.org/10.1109/blackseacom.2013.6623386.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Automatic repeat request"

1

Fairhurst, G., and L. Wood. Advice to link designers on link Automatic Repeat reQuest (ARQ). RFC Editor, 2002. http://dx.doi.org/10.17487/rfc3366.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Unknown, Author. L51630 In-Line Detection and Sizing of Stress Corrosion Cracks Using EMAT Ultrasonics. Pipeline Research Council International, Inc. (PRCI), 1990. http://dx.doi.org/10.55274/r0010616.

Full text
Abstract:
The development of stress corrosion cracks (SCC) in buried gas pipelineshas posed a serious threat to pipeline integrity for many years. It can be reliably detected by magnetic particle techniques in the field or by laboratory studies using low frequency eddy currents. It is also possible to find and measure the depths of the cracks from the ID by careful scanning with an ultra-sonic angle beam probe but the transducer must be manipulated by a skilled operator. All of these approaches are not very satisfactory for in-line inspections because they are not suitable for covering the total area of a pipeline and they are too labor intensive to be automated. In order to address this problem with new technology, the PRCI requested proposals for any technique that seemed to be practical and the Electromagnetic Acoustic Transducer (EMAT) was suggested as very promising because it has already demonstrated operation in the environment of the inside of a gas pipeline. Magnasonics, Inc., of Albuquerque, New Mexico, was chosen from many respondents to conduct an in-vestigation of the use of EMATs for overcoming the problems expected to arise from in-line operation and to incorporate the latest developments in ultrasonic inspection with EMATs. The objective of the program described in this report was twofold. First, to apply the most recent developments in EMAT technology to the problem of detecting and sizing stress corrosion cracks (SCC) in operating gas pipelines and second to exploit the ability of EMATs to generate and detect a wide variety of ultrasonic waves in the walls of a pipeline under operating conditions.
APA, Harvard, Vancouver, ISO, and other styles
3

Seginer, Ido, Louis D. Albright, and Robert W. Langhans. On-line Fault Detection and Diagnosis for Greenhouse Environmental Control. United States Department of Agriculture, 2001. http://dx.doi.org/10.32747/2001.7575271.bard.

Full text
Abstract:
Background Early detection and identification of faulty greenhouse operation is essential, if losses are to be minimized by taking immediate corrective actions. Automatic detection and identification would also free the greenhouse manager to tend to his other business. Original objectives The general objective was to develop a method, or methods, for the detection, identification and accommodation of faults in the greenhouse. More specific objectives were as follows: 1. Develop accurate systems models, which will enable the detection of small deviations from normal behavior (of sensors, control, structure and crop). 2. Using these models, develop algorithms for an early detection of deviations from the normal. 3. Develop identifying procedures for the most important faults. 4. Develop accommodation procedures while awaiting a repair. The Technion team focused on the shoot environment and the Cornell University team focused on the root environment. Achievements Models: Accurate models were developed for both shoot and root environment in the greenhouse, utilizing neural networks, sometimes combined with robust physical models (hybrid models). Suitable adaptation methods were also successfully developed. The accuracy was sufficient to allow detection of frequently occurring sensor and equipment faults from common measurements. A large data base, covering a wide range of weather conditions, is required for best results. This data base can be created from in-situ routine measurements. Detection and isolation: A robust detection and isolation (formerly referred to as 'identification') method has been developed, which is capable of separating the effect of faults from model inaccuracies and disturbance effects. Sensor and equipment faults: Good detection capabilities have been demonstrated for sensor and equipment failures in both the shoot and root environment. Water stress detection: An excitation method of the shoot environment has been developed, which successfully detected water stress, as soon as the transpiration rate dropped from its normal level. Due to unavailability of suitable monitoring equipment for the root environment, crop faults could not be detected from measurements in the root zone. Dust: The effect of screen clogging by dust has been quantified. Implications Sensor and equipment fault detection and isolation is at a stage where it could be introduced into well equipped and maintained commercial greenhouses on a trial basis. Detection of crop problems requires further work. Dr. Peleg was primarily responsible for developing and implementing the innovative data analysis tools. The cooperation was particularly enhanced by Dr. Peleg's three summer sabbaticals at the ARS, Northem Plains Agricultural Research Laboratory, in Sidney, Montana. Switching from multi-band to hyperspectral remote sensing technology during the last 2 years of the project was advantageous by expanding the scope of detected plant growth attributes e.g. Yield, Leaf Nitrate, Biomass and Sugar Content of sugar beets. However, it disrupted the continuity of the project which was originally planned on a 2 year crop rotation cycle of sugar beets and multiple crops (com and wheat), as commonly planted in eastern Montana. Consequently, at the end of the second year we submitted a continuation BARD proposal which was turned down for funding. This severely hampered our ability to validate our findings as originally planned in a 4-year crop rotation cycle. Thankfully, BARD consented to our request for a one year extension of the project without additional funding. This enabled us to develop most of the methodology for implementing and running the hyperspectral remote sensing system and develop the new analytical tools for solving the non-repeatability problem and analyzing the huge hyperspectral image cube datasets. However, without validation of these tools over a ful14-year crop rotation cycle this project shall remain essentially unfinished. Should the findings of this report prompt the BARD management to encourage us to resubmit our continuation research proposal, we shall be happy to do so.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Automatic repeat request' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography