Modeling of Collision Avoidance Protocols in Single-Channel Multihop Wireless Networks

Although there has been considerable work on the performance evaluation of collision avoidance schemes, most analytical work is confined to single-hop ad hoc networks or networks with very few hidden terminals. We present the first analytical model to derive the saturation throughput of collision avoidance protocols in multi-hop ad hoc networks with nodes randomly placed according to a twodimensional Poisson distribution. We show that the sender-initiated collision-avoidance scheme achieves much higher throughput than the ideal carrier sense multiple access scheme with a separate channel for acknowledgments. More importantly, we show that the collision-avoidance scheme can accommodate much fewer competing nodes within a region in a network infested with hidden terminals than in a fully-connected network, if reasonable throughput is to be maintained. Simulations of the IEEE 802.11 MAC protocol and one of its variants validate the predictions made in the analysis. It is also shown that the IEEE 802.11 MAC protocol cannot ensure collision-free transmission of data packets and thus throughput can degrade well below what is predicted by the analysis of a correct collision avoidance protocol. Based on these results, a number of improvements are proposed for the IEEE 802.11 MAC protocol.