This investigation proposes a virtual-FIFO (VFIFO) back-off algorithm for wireless networks. The proposed scheme takes advantage of the central unit (CU) in a wireless network to broadcast a common back-off window size to all the users, significantly alleviating the unfairness of bandwidth utilization in conventional binary exponential back-off (BEB) algorithms. The proposed scheme exploits the CU's capability for collision detection to estimate the number of simultaneously competing users. Additionally, packets generated in a given cycle are split into groups according to their times of arrivals and are guaranteed to be serviced one after another within the next cycle. Although the proposed algorithm is not strictly first come fist served, the FIFO principle is virtually accomplished. Simulation results demonstrate that the standard deviation of delay can be improved by more than two orders and the throughput can be maintained at 0.42 when the number of users approaches infinity. The capture effect even further improves system performance.