Event Details
Markov Chain Analysis of Collaborative Codes in Random Multi Access Communication Systems
Presenter: Dr. Fayez Gebali - ECE Dept.
Supervisor:
Date: Thu, September 5, 2002
Time: 12:00:00 - 13:00:00
Place: EOW 430
ABSTRACT
ABSTRACT
In this talk I will briefly explain the concept of collaborative codes multiple access (CCMA) systems. Then I will discuss discrete-time Markov chain analysis for CCMA. Three media access schemes are proposed asynchronous CCMA (A-CCMA) where users can start transmission at any time, synchronous CCMA (S-CCMA) where users can start transmission only at the start of a synchronizing clock, and collision detection CCMA (CD-CCMA) where users can detect when a collision has taken place. The performance of these three systems is compared with pure ALOHA, slotted ALOHA, and p-persistent CSMA-CD systems, respectively. It is shown that these well-known protocols are special case of CCMA when the number of available codes is only one.
Free and open to the public