Please use this identifier to cite or link to this item:
|Title:||Network coding to combat packet loss in underwater networks||Authors:||Chitre, M.
Underwater acoustic networks
|Issue Date:||2010||Citation:||Chitre, M.,Soh, W.-S. (2010). Network coding to combat packet loss in underwater networks. Proceedings of the 5th ACM International Workshop on UnderWater Networks, WUWNet '10 : -. ScholarBank@NUS Repository. https://doi.org/10.1145/1868812.1868817||Abstract:||Channel variability and a high level of ambient noise lead to significant probability of packet loss in many underwater networks. Techniques based on acknowledgements and re-transmissions (such as ARQ) can be used to build robust networks over the unreliable links between underwater nodes. An alternative solution based on erasure codes can also be used to combat the packet loss. However, both solutions rely on a node re-transmitting information originating at that node. We propose an alternative solution based on network coding, where nodes transmit packets which are composed partially from information originating at that node, and partially from information received by that node from other nodes. The intuition behind this solution is to effectively route the information over good paths in the network rather than to simply rely on re-transmission of the information by the originating nodes. In this paper, we show that our proposed solution indeed performs better than the acknowledgment and erasure coding based solutions, and has the potential to effectively combat the high packet loss experienced by many underwater networks. © 2010 ACM.||Source Title:||Proceedings of the 5th ACM International Workshop on UnderWater Networks, WUWNet '10||URI:||http://scholarbank.nus.edu.sg/handle/10635/71108||ISBN:||9781450304023||DOI:||10.1145/1868812.1868817|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 15, 2019
checked on May 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.