CSE 434 TTh 9:15 AM Homework #2 Sample Solution September 30, 2003

Please email Catherine (cwen@asu.edu) if you have questions about the sample solution.

1. (2.11) Radio antennas often work best when the diameter of the antenna is equal to the wavelength of the radio wave. Reasonable antennas range from 1 cm to 5 meters in diameter. What frequency range does this cover? (10 point) f = c c f = 300000000 m / s f1 = = 30000000000 Hz = 3x1010 Hz = 30GHz .01m 300000000 m / s f2 = = 60000000 Hz = 6 x10 7 = 60Mhz 5m So the range of frequencies covered by this range of radio antennas is 60MHz to 30GHz.

(2.12) Multipath fading is maximized when the two beams arrive 180 degrees out of phase. How much of a path difference is required to maximize the fading for a 50km-long 1-GHz microwave link? (10 point) For the two waves to arrive at 180 out of phase, the path difference will be the distance needed to make these waves 180 degrees out of phase i.e., half of a wavelength. f = c c 300000000m / s = = = .3m f 1000000000Hz The path difference is 0.5? = 0.15m

2. (2.17) Using only the data given in the text, what is the maximum number of telephones that the existing U.S. system can support without changing the numbering plan or adding additional equipment? Could this number of telephones actually be achieved? For purposes of this problem, a computer or fax machine counts as a telephone. Assume there is only one device per subscriber line. (10 point) There are 1010 possible phone numbers for the US phone system, of the form: (XXX) XXX-XXXX . From page 120, there are about 22,000 end-offices. From page 124, there are about 10,000 possible telephones (or local loop subscribers) per end-office. 22,000 x 10,000 = 2.2 x 108 possible telephones in the existing US system. Since some end offices may not be full, this number of telephones may never be achieved.

(2.19) A regional telephone company has 10 million subscribers. Each of their telephones is connected to a central office by a copper twisted pair. The average length of these twisted pairs is 10 km. How much is the copper in the local loops worth? Assume that the cross section of each strand is a circle 1 mm in diameter, the density of copper is 9.0 grams/cm3, and that copper sells for 3 dollars per kilogram. (10 point) L = ~ length of each twisted pair = 10km = 106 cm r = radius of each strand = .5 mm = .05 cm = 5x10-2 cm A = Area of each strand = pr2 = 7.85x10-3 cm2 Vs = Volume of each strand = A x L = (7.85x10-3 cm2 )(106 cm) = 7.85x103 cm3 Vp = Volume of each twisted pair = Vs x 2 strands/pair = 1.57x104 cm3 Vt = Total volume of copper = Vp x number of local loops = (1.57x104 cm3 /subscriber)(107 subscribers) = 1.57x1011 cm3 Total mass of copper = (9g/cm3 )(1.57x1011 cm3 ) = 1.413x1012 grams = 1.413x109 kg ($3/kg)(1.413x109 kg) = $4.239 x 109 = $4.2 billion

3. (2.41) Three packet-switching networks each contain n nodes. The first network has a star topology with a central switch, the second is a (bi-directional) ring, and the third is fully interconnected, with a wire from every node to every other node. What are the best-, average-, and worst-case transmission paths in hops? (10 point)

Fully Connected Star Network Bi-directional Ring

Best Case 1 2 1

Average Case 1 2 n/4

Worst Case 1 2 n/2

(2.44) In a typical mobile phone system with hexagonal cells, it is forbidden to reuse a frequency band in an adjacent cell. If 840 frequencies are available, how many can be used in a given cell? (10 point)

There can be at least three frequency groups A, B and C. Dividing the total available frequencies by three gives us 840/3 = 280 frequencies for each cell.

4. (2.53) A CDMA receiver gets the following chips: (-1 +1 3 +1 1 3 +1 +1). Assuming the chip sequences defined in Fig. 2-45(b), which stations transmitted, and which bits did each one send? (10 point) S = (-1 +1 -3 +1 -1 -3 +1 +1) S A = (1 -1 +3 +1 -1 +3 +1 +1) / 8 = 1 S B = (1 -1 -3 -1 -1 -3 +1 -1) / 8 = -1 S C = (1 +1 +3 +1 -1 -3 -1 -1) / 8 = 0 S D = (1 +1 +3 -1 +1 +3 +1 -1) / 8 = 1 Therefore, station A sent a 1 bit, station B sent a 0 bit, station C did not transmit, and station D sent a 1 bit.

5. (3.1) An upper-layer packet is split into 10 frames, each of which has an 80 percent chance of arriving undamaged. If no error control is done by the data link protocol, how many times must the message be sent on average to get the entire thing through? (10 point) Because each frame is independent, the probability of the message getting through is p = 0.810 = 0.107 . The probability of a message requiring i transmissions is p (1 p) i1 . The expected number of transmissions, E, is:
E = ip (1 p)
i =1 i i 1

= p i (1 p )
i =1

i 1

= p i (1 p )
i =0

i 1

1 1 , we take the derivative of both sides and get ir i 1 = . r = 1 r (1 r ) 2 i= 0 i= 0 1 1 Let r = (1 p ) . This gives us = 2 . Plugging this in, we have 2 (1 1 p ) p

Since

1 1 p i (1 p) i1 = p 2 = . Therefore, it takes an average of p p i= 0

1 = 9.3 transmissions. 0.107

(3.5) A bit string, 0111101111101111110, needs to be transmitted at the data link layer. What is the string actually transmitted after bit stuffing? (10 point) 011110111110011111010

(3.9) Sixteen-bit messages are transmitted using a Hamming code. How many check bits are needed to ensure that the receiver can detect and correct single bit errors? Show the bit pattern transmitted for the message 1101001100110101. Assume that even parity is used in the Hamming code. (10 point) m + r + 1 = 2r For m = 16, r = 5. Thus, we need 5 check bits for 16-bit messages. For message 1101001100110101, we know the codeword should be: **1*101*0011001*10101, in which bit 1, 2, 4, 8, 16 are check bits to be computed. pos Expansion 3=1+2 5=1 +4 6= 2 +4 7=1+2 +4 9=1 10 = 2 11 = 1 + 2 12 = +4 13 = 1 +4 14 = 2 +4 15 = 1 + 2 +4 17 = 1 18 = 2 19 = 1 + 2 20 = +4 21 = 1 +4

+8 +8 +8 +8 +8 +8 +8 + 16 + 16 + 16 + 16 + 16

To compute each check bit: 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 -------------------------------------------------------------------------------------------------#1: *0 1 1 1 0 1 0 1 1 1 1 #2: *1 1 0 1 0 1 0 1 0 1 #4: *1 1 0 1 1 0 0 1 0 1 #8: *1 0 0 1 1 0 0 1 #16: *1 1 0 1 0 1 Thus, the transmitted Hamming code is: 011110110011001110101