ComboCoding: Combined intra-/inter-flow network coding for TCP over disruptive MANETs
- Authors
- Chen, C.-C.; Chen, C.; Oh, S.Y.; Park, J.-S.; Gerla, M.; Sanadidi, M.Y.
- Issue Date
- 2011
- Keywords
- Lossy channels; Network coding; Random linear coding; TCP; Wireless multihop; XOR coding
- Citation
- Journal of Advanced Research, v.2, no.3, pp.241 - 252
- Journal Title
- Journal of Advanced Research
- Volume
- 2
- Number
- 3
- Start Page
- 241
- End Page
- 252
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/20552
- DOI
- 10.1016/j.jare.2011.05.002
- ISSN
- 2090-1232
- Abstract
- TCP over wireless networks is challenging due to random losses and ACK interference. Although network coding schemes have been proposed to improve TCP robustness against extreme random losses, a critical problem still remains of DATA-ACK interference. To address this issue, we use inter-flow coding between DATA and ACK to reduce the number of transmissions among nodes. In addition, we also utilize a pipeline random linear coding scheme with adaptive redundancy to overcome high packet loss over unreliable links. The resulting coding scheme, ComboCoding, combines intra-flow and inter-flow coding to provide robust TCP transmission in disruptive wireless networks. The main contributions of our scheme are twofold; the efficient combination of random linear coding and XOR coding on bi-directional streams (DATA and ACK), and the novel redundancy control scheme that adapts to time-varying and space-varying link loss. The adaptive ComboCoding was tested on a variable hop string topology with unstable links and on a multipath MANET with dynamic topology. Simulation results show that TCP with ComboCoding delivers higher throughput than with other coding options in high loss and mobile scenarios, while introducing minimal overhead in normal operation. © 2011.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Computer Engineering > Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.