Channel Sharing of Competing Flows in Ad Hoc Networks

  • Authors:
  • Yu Wang;J. J. Garcia-Luna-Aceves

  • Affiliations:
  • -;-

  • Venue:
  • ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies the fairness with which competingflows share the channel in ad hoc networks using collisionavoidance protocols. It is shown that the required multi-hopcoordination makes the backoff-based distributed fairqueueing schemes less effective. Using extensive simulationsof two competing flows with different underlying networkconfigurations, it is shown that the commonly usedflow contention graph is insufficient to model the contentionamong nodes and that various degrees of unfairness cantake place. The fairness problem is more severe in TCP-basedflows due to the required acknowledgment traffic, andTCP throughput is also negatively affected. A measurement-basedfair scheme is analyzed in which nodes estimate theirfair share of the channel from overheard traffic and adjusttheir backoff window accordingly (voluntarily); it is shownthat such a scheme achieves much better fairness but sacrificestoo much throughput. These results indicate that moreexplicit information exchange among contending nodes ismandatory to solve the fairness problem conclusively whilemaintaining reasonable throughput.