Multi-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks
Keyword(s):
Ad Hoc
◽
Media access control is an important technology in ad hoc networks. Based on the multi-hop Pseudo Bayesian (PB) algorithm and the single-hop Fast Conflict Resolution algorithm (FCR), in this paper, we propose a Multi-hop Fast Conflict Resolution (MFCR) algorithm for ad hoc networks. We make the detailed introduction of the theoretical model, the pseudo Bayesian analysis and the algorithm deign. MFCR employs a competition probability forecasting method, which is similar to the backoff counter used in FCR, combined with the handshake process used in PB to solve the utilization and the fairness problems of the time slot allocation. Simulations show that the MFCR has evident improvement in the network performance.