Date Added: Aug 2009
The Distributed and Fair Access (DFA) protocol is proposed for multi-hop wireless networks. The proposed protocol eliminates several problems existed in the original Binary CountDown (BCD) algorithm, such as lack of fairness, data collision and the inefficiency of channel usage, by introducing hiddenstation elimination and second chance channel contention that are suitable for multi-hop networks. Further in this paper, numerical analysis of modeling the behavior of DFA in multi-hop networks is presented. With low computational complexity, the proposed model estimates the transmission probability and the channel throughput. In the authors' analysis, the data transmission influenced by the remote stations is carefully monitored and analyzed.