Decomposition Algorithm And Binary Tree Conflict Probability Fusion Detection Csma Protocol Analysis

Twenty-first Century communication network has become the human social rapid development of important elements. Optical fiber based broadband cable network,has realized the dream of mankind "bandwidth unlimited" dream. While, Wireless mobile communication network, makes the human to realize the information in a mobile transmitting, exchange, transmission, reception. At present, people are trying hard to realize wireless communication network "bandwidth is infinite", only the invention to create advanced wireless communications technology, human society will enter into a more beautiful realm of freedom.In the modern wireless communication network, the random multi-access access technology has been one of the key technology of wireless communication network, therefore, random multi-access access technology research to the wireless communication network is significant, this also the only reason is have numerous scholars for the tireless efforts of grinds for years. However, the development of The Times is always out of step before technical generation, therefore, random multi-access access technology also need to keep up with the pace of the development of The Times. As is known to all, both classical ALOHA random multi-access access and has the function of detective carrier CSMA multiple address access technology, can not avoid channel information packet data collision. Therefore, the conflict decomposition technique arises at the historic moment, many scholars put forward continuously research professor of conflicting decomposition algorithm. Now the most commonly used and decomposition of the highest efficiency of tree conflict decomposition algorithm improved version of the binary tree conflict decomposition algorithm.In order to improve the random multi-access systems channel system throughput, this paper studies the carrier in protected reliably against detective CSMA and tree conflict decomposition algorithm, with the help of the teacher’s guidance, puts forward a new random multi-access access agreement-binary tree conflict decomposition algorithm combined with probability testing CAMS of the random multi-access access agreement. The agreement improved version of the binary tree conflict decomposition algorithm and the P detecting CSMA agreement combined, in the channel if the information packet collisions occur, then in the channel of free time buttress decomposition. For based on the basic P detection CSMA agreement to join conflict decomposition technique, can put the collision of failure for sending information packet successfully again. Therefore, the new agreement in the channel of the utilization rate has been improved a lot. MATLAB simulation experiment verified by this theory results show the effectiveness of the agreement.