Decomposition Algorithm. Conflict Based On The Non-isolated Binary Trees The Slotted Aloha Research

Random Multiple Access technology is an important technology for wireless network communication。Under certain conditions, Random Multiple Access technology can effectively channel resources occupied, reducing the transfer delay, are widely used in wireless communication networks. However, in the rapid development of Satellite Communication Systems, Wireless Packet Networks and Computer Communication Networks, Random Access techniques are also facing new challenges and developments. Due to Random Multiple Access System in time and frequency intervals are not fixed, "collision" may occur during the information transmission, Collision Resolution Algorithm must be used to conflict the data. In this paper, in the background of laboratory research, to Slotted ALOHA as the research object, and introduced the Non-isolated Binary Tree Algorithm, then detailed analysis of its performance.The paper is divided into six chapters:Chapter 1. Presented the development of today's wireless communication technology, the application of Multiple Access technologies, in turn leads to Random Multiple Access technology, and analysis of Random Multiple Access caused by conflict.Chapter2.Describes the development process of Random Multiple Access System, mainly discussed the ALOHA protocol and CSMA protocol works, comparison of several Random Multiple Access protocol performance, and discussed the existence of Random Multiple Access technology and solutions.Chapter3. Introduced Tree Collision Resolution Algorithm, discussed in detail Tree Collision Resolution Algorithm theoretical and N Tree Collision Resolution Algorithm, provides a strong theoretical foundation for the Tree Collision Resolution Algorithm.Chapter4.Deeply investigated the Non-isolated Binary Tree Algorithm for Conflict Resolution. First detailed analysis of the Non-isolated Binary Conflict Resolution Algorithm, then based on the theoretical of the above and simulated the performance. Chapter5. The first comprehensive analysis of the pure Slotted ALOHA system, and when G> 1, then introduced the Non-isolated Binary Tree Algorithm for Conflict Resolution, after a series of theoretical analysis and numerical comparison, then make a simulation, and analysis of simulation results.Chapter6. Summarized the full text of the main research work, discussed the problems in it and the direction of continue in-depth in future.