1-persistent csma/cd implementation in matlab

1-persistent csma/cd protocol is to be implemented in matlab . Time is divided into discrete time slots. • There are 6 stations sharing a bus cable to form a local area network. Note that the number of stations in a network is changeable. • A frame is generated with probability pf = 0.1 in each time slot at each station. Its destination can be randomly chosen from the other 5 stations. Note that the frame generation probability is changeable. • Frame size is 10 slots. Once a station grabs the shared medium for a frame transmission, the frame transmission lasts over 10 time slots. Note that the frame size is changeable. The “binary exponential backoff” algorithm can be implemented in discrete time as follows. After mth collisions, a station waits for a random number of time slots, which is chosen uniformly at random from the set {0, 1, 2, . . . , 2n−1} where n = min{10, m}, before attempting to retransmit. After 16 collisions, the station gives up (or simply drops the frame). Note that the maximumrandomization interval of 2^10 − 1 and the maximum retransmission count of 15 are changeable