Two Fast Retransmit Techniques in UWSNs with ACK Indiscretion Problem
In underwater wireless sensor networks (UWSNs), flooding-based routing protocols are preferred due to their capability of reducing the routing overhead in terms of no need of path setup and maintenance. In addition to routing, a transport protocol should be developed to recover lost DATA segments in...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-02-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2014/160541 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850161361970003968 |
|---|---|
| author | Sungwon Lee Dongkyun Kim |
| author_facet | Sungwon Lee Dongkyun Kim |
| author_sort | Sungwon Lee |
| collection | DOAJ |
| description | In underwater wireless sensor networks (UWSNs), flooding-based routing protocols are preferred due to their capability of reducing the routing overhead in terms of no need of path setup and maintenance. In addition to routing, a transport protocol should be developed to recover lost DATA segments in loss-prone UWSNs. In particular, due to long propagation delay in UWSNS, a fast end-to-end recovery technique needs to be developed. Fortunately, the Fast Retransmit technique well-defined in TCP can be exploited for fast retransmissions of lost DATA segments. However, if it operates over the flooding-based routing protocols, each source node will receive multiple copies of ACK segments which are transmitted along different paths. Therefore, the source node cannot distinguish between these multiple copies of ACK segments and real duplicated ACK segments (defined as an ACK indiscretion problem in this paper), which leads to unnecessary retransmissions. In this paper, we therefore propose two Fast Retransmit techniques to address the ACK indiscretion problem. In our first proposed technique, the sink records a new count number into a header, informing how many duplicated ACK segments have been transmitted from the sink. Since this requires an additional field in the header for the count number, the second technique allows a source node to estimate the number of ACK copies which are expected to be received when the sink transmits an ACK segment, without any dependency on the additional field. From both of our proposed techniques, the source nodes become aware of the accurate number of duplicated ACK segments transmitted from the sink and can perform the Fast Retransmit correctly. |
| format | Article |
| id | doaj-art-ffa7b475799341cdb92705e0ffac5fec |
| institution | OA Journals |
| issn | 1550-1477 |
| language | English |
| publishDate | 2014-02-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-ffa7b475799341cdb92705e0ffac5fec2025-08-20T02:22:50ZengWileyInternational Journal of Distributed Sensor Networks1550-14772014-02-011010.1155/2014/160541160541Two Fast Retransmit Techniques in UWSNs with ACK Indiscretion ProblemSungwon LeeDongkyun KimIn underwater wireless sensor networks (UWSNs), flooding-based routing protocols are preferred due to their capability of reducing the routing overhead in terms of no need of path setup and maintenance. In addition to routing, a transport protocol should be developed to recover lost DATA segments in loss-prone UWSNs. In particular, due to long propagation delay in UWSNS, a fast end-to-end recovery technique needs to be developed. Fortunately, the Fast Retransmit technique well-defined in TCP can be exploited for fast retransmissions of lost DATA segments. However, if it operates over the flooding-based routing protocols, each source node will receive multiple copies of ACK segments which are transmitted along different paths. Therefore, the source node cannot distinguish between these multiple copies of ACK segments and real duplicated ACK segments (defined as an ACK indiscretion problem in this paper), which leads to unnecessary retransmissions. In this paper, we therefore propose two Fast Retransmit techniques to address the ACK indiscretion problem. In our first proposed technique, the sink records a new count number into a header, informing how many duplicated ACK segments have been transmitted from the sink. Since this requires an additional field in the header for the count number, the second technique allows a source node to estimate the number of ACK copies which are expected to be received when the sink transmits an ACK segment, without any dependency on the additional field. From both of our proposed techniques, the source nodes become aware of the accurate number of duplicated ACK segments transmitted from the sink and can perform the Fast Retransmit correctly.https://doi.org/10.1155/2014/160541 |
| spellingShingle | Sungwon Lee Dongkyun Kim Two Fast Retransmit Techniques in UWSNs with ACK Indiscretion Problem International Journal of Distributed Sensor Networks |
| title | Two Fast Retransmit Techniques in UWSNs with ACK Indiscretion Problem |
| title_full | Two Fast Retransmit Techniques in UWSNs with ACK Indiscretion Problem |
| title_fullStr | Two Fast Retransmit Techniques in UWSNs with ACK Indiscretion Problem |
| title_full_unstemmed | Two Fast Retransmit Techniques in UWSNs with ACK Indiscretion Problem |
| title_short | Two Fast Retransmit Techniques in UWSNs with ACK Indiscretion Problem |
| title_sort | two fast retransmit techniques in uwsns with ack indiscretion problem |
| url | https://doi.org/10.1155/2014/160541 |
| work_keys_str_mv | AT sungwonlee twofastretransmittechniquesinuwsnswithackindiscretionproblem AT dongkyunkim twofastretransmittechniquesinuwsnswithackindiscretionproblem |