FACULTY OF ENGINEERING DEPARTMENT OF ELECTRICAL ENGINEERING B.SC .

ELECTRONICS & COMMUNICATIONS

Elective Course 1 (ELC 414 E Mobile Communications)

FIRST SEMESTER 2012/13

Sheet (3)

Dr. Nasr Rashid

Problem 3.1: Consider building a CSMA/CD network running at 1 Gbps over a 1-km distance with no repeaters. The signal speed in the cable is 200,000 km/sec. What is the minimum frame size? Problem 3.2: For a CSMA/CD terminal that wishes to transmit a packet in highly loaded system. Assume that the terminal uses a binary exponential backoff with a slot time of 50 microseconds. Calculate the packet waiting time assuming for the following number of collisions: a. 2. b. 4. c. 8 Problem 3.3: Consider Non-Persistent CSMA/CD system has a 2000 meter length, a fixed packet size of 1000 bits, runs at 10 Mbps, and has a propagation delay of 5 microseconds per kilometers. a. Calculate the end to end delay. b. Determine the packet duration. c. Determine the maximum utilization of the system and the maximum bit rate. Problem 3.4: A channel using random access protocols has three stations on a bus with end-to-end propagation delay . Station A is located at one end of the bus, and stations B and C are together located at the other end of the bus. Frames arrive at the three stations and are to be transmitted at stations A, B, and C at the respective times tA=0, tB = /2, tC=3/2. Frames require transmission time of 4. In appropriate figures, with time as the horizontal axis, show the transmission activity of each of the three stations for a. ALOHA. b. Non-Persistent CSMA. c. Non-Persistent CSMA/CD. Problem 3.5: Consider P-Persistent CSMA with station A is the only one who has a frame to send. a. What is the probability that A sends the frame when it senses the channel idle? b. What is the probability that A tries exactly n times before sending out the frame successfully? c. What is the probability that station A tries less than n times before sending out the frame successfully? (n=1, 2,). d. If there are n stations and all of them have a frame to send. All of them sense the channel, and its idle at time t. What is the probability that no frame is sent at t? What is the probability that a collision occurs at t? Problem 3.6: Suppose two nodes A and B, are attached to opposite ends of a 900m separation, and that they each have one frame of 1000 bits (including all headers and preambles) to send to each other. Both nodes attempt to transmit at time t = 0. Suppose there are four repeaters between A and B, each inserting a 20-bit delay. Assume the transmission rate is 10 Mbps, and CSMA/CD with backoff intervals of multiples of 512 bits is used. After te first collision, A draws K = 0 and B draws K = 1 in the exponential backoff protocol. Ignore the jam signal. a. What is the one-way propagation delay (including repeater delays) between A and B in seconds? Assume that the signal propagation speed is 2 108 m/sec. b. At what time (in seconds) is As packet completely delivered at B? c. Now suppose that only A has a packet to send and that the repeaters are replaced with switches. Suppose that each switch has a 20-bit processing delay in addition to a store-andforward delay. At what time, in seconds, is As packet delivered at B?