In scenario where wireless ad hoc networks are deployed, significant TCP unfairness in wireless ad hoc networks has been reported during the past several years. This unfairness results from the nature of the shared wireless medium and location dependency. However, this queue is not a FIFO queue. TCP flows sharing the queue have different, dynamically changing priorities determined by the topology and traffic patterns. Thus, they get different feedback in terms of packet loss rate and packet delay when congestion occurs. In this paper, we will use a normal FIFO scheduling scheme, which helps competing TCP connections to achieve fairness without much throughput loss. Simulation results show that our scheme successfully eliminates the extreme unfairness existing in above-mentioned scenarios.