HIERARCHICAL SCHEDULE SENSING PROTOCOL FOR CDMA WIRELESS NETWORKS

Abstract

As with any multiple access protocols, there is always the issue of resource allocation and in the case of random access, the additional issue of contention. In this thesis a new protocol design has been proposed to solve the problem of packet collisions in a fully connected wireless CDMA network. A Markov Chain analysis has been performed on this proposed protocol to obtain its basic network performance, upon which the effects of possible packet collisions in the system are also studied. To make the performance study more realistic, the system is analysed further by involving the effects of multipath fading and multi-user interference that cannot be avoided in wireless communications. Finally, the effectiveness of the protocol is demonstrated when compared to a normal receiver-code based CDMA protocol without the proposed collision avoidance mechanism. All the analyses are purely mathematical, the purpose of which is to provide insights on the mechanisms of the protocol and to help identify the controlling parameters of the design.