In typical end-to-end recovery protocols, an ACK segment is delivered to a source node over a single path. ACK loss requires the source to retransmit the corresponding data packet. However, in underwater wireless sensor networks which prefer flooding-based routing protocols, the source node has redundant chances to receive the ACK segment since multiple copies of the ACK segment can arrive at the source node along multiple paths. Since existing RTO calculation algorithms do not consider inherent features of underlying routing protocols, spurious packet retransmissions are unavoidable. Hence, in this letter, we propose a new ACK loss-aware RTO calculation algorithm, which utilizes statistical ACK arrival times and ACK loss rate, in order to reduce such retransmissions.
Sungwon LEE
Kyungpook National University
Dongkyun KIM
Kyungpook National University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Sungwon LEE, Dongkyun KIM, "ACK Loss-Aware RTO Calculation Algorithm over Flooding-Based Routing Protocols for UWSNs" in IEICE TRANSACTIONS on Information,
vol. E97-D, no. 11, pp. 2967-2970, November 2014, doi: 10.1587/transinf.2014EDL8127.
Abstract: In typical end-to-end recovery protocols, an ACK segment is delivered to a source node over a single path. ACK loss requires the source to retransmit the corresponding data packet. However, in underwater wireless sensor networks which prefer flooding-based routing protocols, the source node has redundant chances to receive the ACK segment since multiple copies of the ACK segment can arrive at the source node along multiple paths. Since existing RTO calculation algorithms do not consider inherent features of underlying routing protocols, spurious packet retransmissions are unavoidable. Hence, in this letter, we propose a new ACK loss-aware RTO calculation algorithm, which utilizes statistical ACK arrival times and ACK loss rate, in order to reduce such retransmissions.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2014EDL8127/_p
Copy
@ARTICLE{e97-d_11_2967,
author={Sungwon LEE, Dongkyun KIM, },
journal={IEICE TRANSACTIONS on Information},
title={ACK Loss-Aware RTO Calculation Algorithm over Flooding-Based Routing Protocols for UWSNs},
year={2014},
volume={E97-D},
number={11},
pages={2967-2970},
abstract={In typical end-to-end recovery protocols, an ACK segment is delivered to a source node over a single path. ACK loss requires the source to retransmit the corresponding data packet. However, in underwater wireless sensor networks which prefer flooding-based routing protocols, the source node has redundant chances to receive the ACK segment since multiple copies of the ACK segment can arrive at the source node along multiple paths. Since existing RTO calculation algorithms do not consider inherent features of underlying routing protocols, spurious packet retransmissions are unavoidable. Hence, in this letter, we propose a new ACK loss-aware RTO calculation algorithm, which utilizes statistical ACK arrival times and ACK loss rate, in order to reduce such retransmissions.},
keywords={},
doi={10.1587/transinf.2014EDL8127},
ISSN={1745-1361},
month={November},}
Copy
TY - JOUR
TI - ACK Loss-Aware RTO Calculation Algorithm over Flooding-Based Routing Protocols for UWSNs
T2 - IEICE TRANSACTIONS on Information
SP - 2967
EP - 2970
AU - Sungwon LEE
AU - Dongkyun KIM
PY - 2014
DO - 10.1587/transinf.2014EDL8127
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E97-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2014
AB - In typical end-to-end recovery protocols, an ACK segment is delivered to a source node over a single path. ACK loss requires the source to retransmit the corresponding data packet. However, in underwater wireless sensor networks which prefer flooding-based routing protocols, the source node has redundant chances to receive the ACK segment since multiple copies of the ACK segment can arrive at the source node along multiple paths. Since existing RTO calculation algorithms do not consider inherent features of underlying routing protocols, spurious packet retransmissions are unavoidable. Hence, in this letter, we propose a new ACK loss-aware RTO calculation algorithm, which utilizes statistical ACK arrival times and ACK loss rate, in order to reduce such retransmissions.
ER -