Study Of A Distributed Algorithm Of Slot Collision Detection And Resolution

Mobile Ad Hoc Networks feature self-organization and no center, and they do not need fixed network infrastructures. Since they can quickly build network platforms for military and civilian applications, the technologies in them become the key ones in future wireless communication networks. Due to the features of dynamic topology in a mobile Ad Hoc network and slot multiplexing in TDMA protocol, the problem of slot collision is inevitable in a distributed TDMA protocol.Two techniques based on differe nt aspects of slot collision called fast detection and resolution algorithm and adaptive node density's slot allocation algorithm, are studied in this paper. First, the cross-layer design of using SINR and received power in physical layer to forecast and detect slot collision, the basic TDMA frame structure and the forecasting and detection parts in fast detection and resolution algorithm are described. Second, the specific TDMA frame structure and the process of modifying slot allocation based on the node density in adaptive slot allocation algorithm are described. Finally, the characteristics of the two algorithms are analyzed. Fast detection and resolution algorithm is able to solve most slot collisions and adaptive to most TDMA protocol. Adaptive node de nsity's slot allocation algorithm is able to solve the problem of indecomposable slot collision because of lack of local time slots.In this paper, a Mobile Ad Hoc network model is established with OPNET simulation software, and parameters of node rate and network size are set for different network simulation. The simulation results show that fast detection and resolution algorithm and adaptive node density's slot allocation algorithm can both effectively solve the problem of slot collision, improve the network throughput, and reduce the dropped packets caused by slot collision.