Channel sharing of competing flows in ad hoc networks

摘要: This paper studies the fairness with which competing flows share channel in ad hoc networks using collision avoidance protocols. It is shown that required multihop coordination makes backoff-based distributed fair queueing schemes less effective. Using extensive simulations of two different underlying network configuration, it commonly used flow contention graph insufficient to model among nodes and various degrees unfairness can take place. The problem more severe TCP-based due acknowledgment traffic, TCP throughput also negatively affected. A measurement based scheme analyzed estimate their from overheard traffic adjust backoff window accordingly (voluntarily); such a achieves much better but sacrifices too throughput. These results indicate explicit information exchange contending mandatory solve conclusively while maintaining reasonable