Each of 6 stations in a network have one packet to transmit. Determine the time that one of the stations is the first to successfully transmit (no collision). At t=0(slot 0), all 6 stations try to transmit and go into the exponential backoff part of the transmission protocol (one time slot is 51.2 uS, therefore, possible transmission times for a station are multiples of 51.2 uS.)

More information on the exponential backoff procedure for this problem is provided on the next page. Label the stations starting with 0, so your output should contain names of station 0, station 1, station 2, station 3, station 4 and station 5.

Turn in your answer in table form showing which stations transmit (are scheduled to transmit) during each time slot. Slot 0 is the initial slot (so all 6 stations are listed) for transmissions at t=0 (slot 0). Slot 1 is the next slot and it starts at time t= 51.2 us, etc. Lastly, provide the time when the first station is able to successfully transmit and the number of that station (e.g. Station 3 transmits successfully in slot 5 which occurs at time 256 uS)

Use the input file Project2_part1_rn.txt for the random numbers needed for this problem. This file contains more than the necessary number of values to successfully complete the problem. If you run out of numbers before finding a solution, then you are making a mistake somewhere. You can solve this problem by hand or use a computer program. If you use a program, provide the source code as an attachment.

Part 1b (2 pts) For this part each station has 1 packet to transmit. Determine the time when each of the stations make a successful transmission. Need to provide the same information as in part a, except that the information is required for all 6 stations. Use the input file Project2_part1_rn.txt for the random numbers needed for this problem.

Part 1c (4pts) For this part, you have 5 stations in a network and all stations have an endless supply of packets to transmit. After a station successfully transmits a packet, it skips 2 slots (i.e. if it transmits in slot 4, it skips slots 5 and 6 and tries its next packet in slot 7) before attempting to transmit its next packet. A station that successfully transmits a packet will reset its collision count to 0. At what time does the last station successfully transmit its first packet (that is give the minimum time when all stations have successfully transmitted at least one packet). Use the input file Project2_part1_rn.txt for the random numbers needed for this problem