The Throughput Analysis of IBTCRPP-CSMA in Ad Hoc Network

From the point of view to improve QoS of Ad Hoc network, this paper analyses the problem about mobile nodes in Ad Hoc network and decides to solve the problem by designing effective MAC protocol. Therefore, a novel random multi-access protocol using Binary Tree Collision Resolution for collision packets in Probability-Persistent Random Multi-Access (IBTCRPP-CSMA) is proposed. The throughput of IBTCRPP-CSMA and computer simulation experiments are obtained. Simulation results agree with theoretical analysis. By contrasts of throughputs among several CSMA protocols, IBTCRPP-CSMA has higher throughput and channel utilization, thereby ensuring the system’s high QoS.

[1]  Ivan Marsic,et al.  Clustering overhead for hierarchical routing in mobile ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  J. J. Garcia-Luna-Aceves,et al.  Node activation with polling channel access , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3]  J. J. Garcia-Luna-Aceves,et al.  Hop-reservation multiple access (HRMA) for ad-hoc networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  J. J. Garcia-Luna-Aceves,et al.  Collision avoidance and resolution multiple access for multichannel wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  Sun Yun-shan.  Study on improved isolated algorithm of conflict resolution for binary trees , 2004 .