TCP-aware network coding with opportunistic scheduling in wireless mobile ad hoc networks

Authors:
Tebatso Nage;F. Richard Yu;Marc St-Hilaire
Affiliations:
Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, Canada;Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, Canada;Department of Systems and Computer Engineering, Carleton University, Ottawa, ON, Canada
Venue:
Computer Communications
Year:
2011

Citing 7
Cited 0

On Practical Network Coding for Wireless Environments

IZS '06 Proceedings of the 2006 International Zurich Seminar on Communications
XORs in the air: practical wireless network coding

IEEE/ACM Transactions on Networking (TON)
Local Topology Assisted XOR Coding in Wireless Mesh Networks

ICDCSW '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops
Cross-Layer Design of Wireless Mesh Networks with Network Coding

IEEE Transactions on Mobile Computing
TCP-Aware Channel Allocation in CDMA Networks

IEEE Transactions on Mobile Computing
Flight size auto tuning for broadband wireless networks

Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Network information flow

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper presents a scheme that employs TCP-aware network coding with opportunistic scheduling to enhance TCP throughput in wireless mobile ad hoc networks. Specifically, it considers a TCP parameter, congestion window size, and wireless channel conditions simultaneously to improve TCP throughput performance. Evaluation of this scheme is carried out by using ns2 simulations in different scenarios. The results show that the proposed scheme gives approximately 35% throughput improvement in a high mobility environment and about 33% throughput increase in no or low mobility environment as compared to traditional network coding with opportunistic scheduling. This paper also proposes a new adaptive-W (i.e., adaptive Waiting time) scheme whose objective is to adaptively control waiting time of overheard packets that are stored in a buffer to achieve tradeoff between throughput and overhead.