October University for Modern Sciences & Arts CS326

Faculty of Computer Science Mobile Computing

Final-Fall 2017 Time Allowed: 3 hours

CS326

Mobile Computing

Final Exam

Faculty CS
Semester Fall 2017
Time Allowed 3 hours
Total Mark 100
No. of Pages 3
Material provided -
Equipment permitted -
Additional Instructions -

No books, paper or electronic devices are permitted to be brought into the

examination room other than those specified above.
October University for Modern Sciences & Arts CS326
Faculty of Computer Science Mobile Computing
Final-Fall 2017 Time Allowed: 3 hours

Answer all of the following questions:

Question 1 (25 Marks)

[a] Show how to decide on the number of signaling levels given the maximum signal to
noise ratio in wireless communication systems.
[b] In a typical wireless system, a technique that uses 64 signaling levels is used.
 What is the minimum signal to noise ratio that allows for this number of levels?
𝑆
𝐶 = 2𝐵 𝑙𝑜𝑔2 𝑀 = 𝐵 𝑙𝑜𝑔2 (1 + )
𝑁
𝑆
𝐵 𝑙𝑜𝑔2 𝑀2 = 𝐵 𝑙𝑜𝑔2 (1 + )
𝑁
𝑆
𝑙𝑜𝑔2 𝑀2 = 𝑙𝑜𝑔2 (1 + )
𝑁
𝑆
𝑀2 = 1 +
𝑁
𝑆
= 𝑀2 − 1 = 642 − 1 = 4095
𝑁
𝑆
𝑆𝑁𝑅 (𝑖𝑛 𝑑𝐵) = 10 𝑙𝑜𝑔10 = 36.12 𝑑𝐵
𝑁
 If the (thermal) noise power is given as: 𝑁 = 1.38 × 10−23 𝑇𝐵 where T is the kelvin
temperature and B is the channel bandwidth. What is the minimum received signal power
needed to achieve a channel capacity of 2.4 Mbps at T=300° 𝐾?
𝐶 = 2𝐵 𝑙𝑜𝑔2 𝑀
2.4 ∗ 106 = 2𝐵 𝑙𝑜𝑔2 64 = 12𝐵
𝐵 = 0.2 ∗ 106 = 2 ∗ 105 𝐻𝑧
𝑆 𝑆 𝑆
= −23
= −23
= 4095
𝑁 1.38 ∗ 10 𝑇 𝐵 1.38 ∗ 10 ∗ 300 ∗ 2 ∗ 105
𝑆 = 3.39066 ∗ 10−12 𝑤𝑎𝑡𝑡𝑠

[c] If three identical transmitters 𝑆1 , 𝑆2 , 𝑆3 located respectively at (0,0), (100,0) and

(0,100) as shown in next figure. The transmitters have equal transmission power.
Estimate the location (𝑥, 𝑦) of a receiver receiving signals of powers 𝑃1 , 𝑃2 , 𝑃3 from the
𝑃 𝑃
three transmitters respectively such that: 𝑃1 = 2.25 and 𝑃2 = 0.25. Assume that the pass
2 3
loss exponent is 2.
October University for Modern Sciences & Arts CS326
Faculty of Computer Science Mobile Computing
Final-Fall 2017 Time Allowed: 3 hours

(𝑥, 𝑦)

𝑆3
(0,100)

𝑆1
(0,0) 2
(100,0)

𝑃1 𝑑22 9
= 2 = 2.25 = ⇒ 𝑑12 : 𝑑22 = 4: 9
𝑃2 𝑑1 4

𝑃2 𝑑32 1
= = ⇒ 𝑑22 : 𝑑32 = 4: 1
𝑃3 𝑑22 4
𝑑12 : 𝑑22 : 𝑑32 = 16: 36: 9
𝑑12 = 𝑥 2 + 𝑦 2 = 16𝑘 (1)
𝑑22 = (𝑥 − 100)2 + 𝑦 2 = 36𝑘 (2)
𝑑32 = 𝑥 2 + (𝑦 − 100)2 = 9𝑘 (3)
Subtracting (2)- (1)
−200𝑥 + 10000 = 20𝑘
10000 − 20𝑘
𝑥= = 50 − 0.1𝑘
200
Subtracting (1)- (3)
200𝑦 − 10000 = 7𝑘
10000 + 7𝑘
𝑦= = 50 + 0.035𝑘
200

Page 2 of 3
October University for Modern Sciences & Arts CS326
Faculty of Computer Science Mobile Computing
Final-Fall 2017 Time Allowed: 3 hours

Substituting in (1):
(50 − 0.1𝑘)2 + (50 + 0.035𝑘 )2 = 16𝑘
0.011225𝑘 2 − 22.5𝑘 + 5000 = 0
−𝑩 ∓ √𝑩𝟐 − 𝟒𝑨𝑪
𝒌=
𝟐𝑨
𝟐𝟐. 𝟓 ∓ √(−𝟐𝟐. 𝟓)𝟐 − 𝟒(0.011225)(𝟓𝟎𝟎𝟎)
=
𝟐(0.011225)
𝟐𝟐. 𝟓 ∓ 𝟏𝟔. 𝟕𝟖𝟓𝟒𝟏
=
𝟎. 𝟎𝟐𝟐𝟒𝟓
𝑘 = 1749.907 𝑜𝑟 254.547
𝑥 = −124.991 𝑜𝑟 24.5453
𝑦 = 111.247 𝑜𝑟 58.909
(𝑥, 𝑦) = (−124.991, 111.247) 𝑜𝑟 (24.5453, 58.909)

Question 2 (15 Marks)

[a] Describe the GSM networks. What are the multiple access techniques used in the
GSM networks?
[b] Define the hidden terminal problem. Show how the Carrier Sense Multiple
Access/Collision Avoidance (CSMA/CA) algorithm is modified to overcome the hidden
terminal problem.
[c] Describe the basic functions offered by the IEEE 802.11 based networks.

Question 3 (25 Marks)

[a] Write a complete cycle of the pseudo-random sequence generated by the primitive
polynomial 𝑝(𝑥 ) = 𝑥 4 + 𝑥 + 1.
The sequence is 000100110101111
1 + 𝑥 + 𝑥 2 + 𝑥 3 + 𝑥 5 + 𝑥 7 + 𝑥 8 + 𝑥 11
+ 𝑥 15
1 + 𝑥 + 𝑥4 1
1 + 𝑥 + 𝑥4

Page 3 of 3
October University for Modern Sciences & Arts CS326
Faculty of Computer Science Mobile Computing
Final-Fall 2017 Time Allowed: 3 hours

𝑥 + 𝑥4
𝑥 + 𝑥2 + 𝑥5
𝑥2 + 𝑥4 + 𝑥5
𝑥2 + 𝑥3 + 𝑥6
𝑥3 + 𝑥4 + 𝑥5 + 𝑥6
𝑥3 + 𝑥4 + 𝑥7
𝑥5 + 𝑥6 + 𝑥7
𝑥5 + 𝑥6 + 𝑥9
𝑥7 + 𝑥9
𝑥 7 + 𝑥 8 + 𝑥 11
𝑥 8 + 𝑥 9 + 𝑥 11
𝑥 8 + 𝑥 9 + 𝑥 12
𝑥 11 + 𝑥 12
𝑥 11 + 𝑥 12 + 𝑥 15
𝑥 15
[b] In a cyclic code system using the divisor polynomial 𝑝(𝑥 ) = 𝑥 5 + 𝑥 2 + 1, write the
CRC code for the message 1011001001010.
𝑥 5 𝑀(𝑥 ) = 𝑥 5 (𝑥12 + 𝑥 10 + 𝑥 9 + 𝑥 6 + 𝑥 3 + 𝑥 ) = 𝑥 17 + 𝑥 15 + 𝑥 14 + 𝑥 11 + 𝑥 8 + 𝑥 6
𝑥 12 + 𝑥 10 + 𝑥 6 + 𝑥 5 + 𝑥 2 + 1
𝑥5 + 𝑥2 + 1 𝑥 17 + 𝑥 15 + 𝑥 14 + 𝑥 11 + 𝑥 8 + 𝑥 6
𝑥 17 + 𝑥 14 + 𝑥 12
𝑥 15 + 𝑥 12 + 𝑥 11 + 𝑥 8 + 𝑥 6
𝑥 15 + 𝑥 12 + 𝑥 10
𝑥 11 + 𝑥 10 + 𝑥 8 + 𝑥 6
𝑥 11 + 𝑥 8 + 𝑥 6
𝑥 10
𝑥 10 + 𝑥 7 + 𝑥 5
𝑥7 + 𝑥5

Page 4 of 3
October University for Modern Sciences & Arts CS326
Faculty of Computer Science Mobile Computing
Final-Fall 2017 Time Allowed: 3 hours

𝑥7 + 𝑥4 + 𝑥2
𝑥5 + 𝑥4 + 𝑥2
𝑥5 + 𝑥2 + 1
𝑥4 + 1
The CRC code is hence: 10001
[c] A sender A owns the key 010011 and user B owns 110101. Assuming binary 0 is
coded as signal level -1 and binary 1 is coded as signal level +1.
- show that the two keys are orthogonal
(−1,1, −1, −1,1,1). (1,1, −1,1, −1,1) = −𝟏 + 𝟏 + 𝟏 − 𝟏 − 𝟏 + 𝟏 = 𝟎
- If the base station receives (0, 2, -2, 0, 1, 2), what is sent by each sender?
(0, 2, −2, 0, 1, 2). (−1,1, −1, −1,1,1) = 𝟎 + 𝟐 + 𝟐 + 𝟎 + 𝟏 + 𝟐 = 𝟕
(0, 2, −2, 0, 1, 2). (1,1, −1,1, −1,1) = 𝟎 + 𝟐 + 𝟐 + 𝟎 − 𝟏 + 𝟐 = 𝟓
Both A and B sent 1
Question 5 (35 Marks)
[a] Consider a cellular system with hexagonal cells of radius R = 1000 m. Suppose the
minimum distance between cell centers using the same frequency must be D = 6 km to
maintain the required signal-to-interference ratio. Find:
- The frequency reuse factor.
𝑑
= √3𝐾
𝑟
1 𝑑 2 1
𝐾 = ( ) = (6)2 = 12
3 𝑟 3
- The carrier to interference ratio (in dB) if the propagation loss coefficient is 3
𝐶 1 𝑑 𝛾 1
= ( ) = (6)3 = 36
𝐼 6 𝑟 6
𝐶
10 𝑙𝑜𝑔10 ( ) = 10 𝑙𝑜𝑔10 (36) = 15.56 𝑑𝐵
𝐼
[b] A city has an area of 2400 square km and is covered by a cellular system. Cells are of
regular hexagonal shape with radius 1 Km. To avoid interference, the minimum distance
between the co-channel cells is estimated to be 6Km. The system uses 210 duplex
channels. Assume a GOS of 2% for an Erlang B system is specified. If the average user

Page 5 of 3
 October University for Modern Sciences & Arts CS326
Faculty of Computer Science Mobile Computing
Final-Fall 2017 Time Allowed: 3 hours

call request rate is 2 calls per hour and the average call holding time is 3 minutes,
compute
- The number of cells in the service area.
- The number of channels per cell.
- Traffic intensity of each cell.
- The maximum carried traffic.
- The total number of users that can be served for 2% GOS.
- The change in GOS if the number of users is increased by 10%.
3√3 2
(Note that the area of hexagon is 𝑟 )
2

3√3 2 3√3
𝑐𝑒𝑙𝑙 𝑎𝑟𝑒𝑎 = 𝑟 = 𝑘𝑚2
2 2
2400
𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑐𝑒𝑙𝑙𝑠 = = 923.76 ≅ 924 𝑐𝑒𝑙𝑙𝑠
3√3
2
1 𝑑 2 1
𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑐ℎ𝑎𝑛𝑛𝑒𝑙𝑠 𝑝𝑒𝑟 𝑐𝑒𝑙𝑙 = 𝐾 = ( ) = (6)2 = 12
3 𝑟 3
𝑁𝑒𝑒𝑑𝑒𝑑 𝑡𝑟𝑎𝑓𝑓𝑖𝑐 𝑖𝑛𝑡𝑒𝑛𝑠𝑖𝑡𝑦 𝑝𝑒𝑟 𝑐𝑒𝑙𝑙 (𝑎𝑡 2% 𝐺𝑜𝑆) =
6.6147 𝐸𝑟𝑙𝑎𝑛𝑔𝑠 (𝑢𝑠𝑖𝑛𝑔 𝑡ℎ𝑒 𝑡𝑎𝑏𝑙𝑒)
𝑇ℎ𝑒 𝑚𝑎𝑥𝑖𝑚𝑢𝑚 𝑐𝑎𝑟𝑟𝑖𝑒𝑑 𝑡𝑟𝑎𝑓𝑓𝑖𝑐 = 924 ∗ 6.6147 = 6111.9828 𝐸𝑟𝑙𝑎𝑛𝑔𝑠
2
𝑢𝑠𝑒𝑟 𝑡𝑟𝑎𝑓𝑓𝑖𝑐 𝑖𝑛𝑡𝑒𝑛𝑠𝑖𝑡𝑦 = 𝜆𝑢 ℎ = ∗ 3 = 0.1 𝐸𝑟𝑙𝑎𝑛𝑔
60
6111.9828
𝑡𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑢𝑠𝑒𝑟𝑠 = = 61119.828 ≅ 61120 𝑢𝑠𝑒𝑟𝑠
0.1
Increasing the number of users by 10% increases the cell traffic intensity by 10%; so the
new cell traffic intensity = 6.6147 ∗ 1.1 = 7.27617 𝐸𝑟𝑙𝑎𝑛𝑔𝑠
From the table, the nearest value in the row n=12 is 7.1410 under loss probability 3%.
0.05−0.03
The grade of service will be 0.03 + 7.9501−7.1410 ∗ (7.27617 − 7.1410) = 0.033 = 3.3%

The Erlang-B table is given below

n Loss probability (E) n

0.007 0.008 0.009 0.01 0.02 0.03 0.05 0.1 0.2 0.4
1 .00705 .00806 .00908 .01010 .02041 .03093 .05263 .11111 .25000 .66667 1
2 .12600 .13532 .14416 .15259 .22347 .28155 .38132 .59543 1.0000 2.0000 2

Page 6 of 3
 October University for Modern Sciences & Arts CS326
Faculty of Computer Science Mobile Computing
Final-Fall 2017 Time Allowed: 3 hours

3 .39664 .41757 .43711 .45549 .60221 .71513 .89940 1.2708 1.9299 3.4798 3
4 .77729 .81029 .84085 .86942 1.0923 1.2589 1.5246 2.0454 2.9452 5.0210 4
5 1.2362 1.2810 1.3223 1.3608 1.6571 1.8752 2.2185 2.8811 4.0104 6.5955 5
6 1.7531 1.8093 1.8610 1.9090 2.2759 2.5431 2.9603 3.7584 5.1086 8.1907 6
7 2.3149 2.3820 2.4437 2.5009 2.9354 3.2497 3.7378 4.6662 6.2302 9.7998 7
8 2.9125 2.9902 3.0615 3.1276 3.6271 3.9865 4.5430 5.5971 7.3692 11.419 8
9 3.5395 3.6274 3.7080 3.7825 4.3447 4.7479 5.3702 6.5464 8.5217 13.045 9
10 4.1911 4.2889 4.3784 4.4612 5.0840 5.5294 6.2157 7.5106 9.6850 14.677 10
11 4.8637 4.9709 5.0691 5.1599 5.8415 6.3280 7.0764 8.4871 10.857 16.314 11
12 5.5543 5.6708 5.7774 5.8760 6.6147 7.1410 7.9501 9.4740 12.036 17.954 12
13 6.2607 6.3863 6.5011 6.6072 7.4015 7.9667 8.8349 10.470 13.222 19.598 13
14 6.9811 7.1155 7.2382 7.3517 8.2003 8.8035 9.7295 11.473 14.413 21.243 14
15 7.7139 7.8568 7.9874 8.1080 9.0096 9.6500 10.633 12.484 15.608 22.891 15
16 8.4579 8.6092 8.7474 8.8750 9.8284 10.505 11.544 13.500 16.807 24.541 16
17 9.2119 9.3714 9.5171 9.6516 10.656 11.368 12.461 14.522 18.010 26.192 17
18 9.9751 10.143 10.296 10.437 11.491 12.238 13.385 15.548 19.216 27.844 18
19 10.747 10.922 11.082 11.230 12.333 13.115 14.315 16.579 20.424 29.498 19
20 11.526 11.709 11.876 12.031 13.182 13.997 15.249 17.613 21.635 31.152 20
21 12.312 12.503 12.677 12.838 14.036 14.885 16.189 18.651 22.848 32.808 21
22 13.105 13.303 13.484 13.651 14.896 15.778 17.132 19.692 24.064 34.464 22
23 13.904 14.110 14.297 14.470 15.761 16.675 18.080 20.737 25.281 36.121 23
24 14.709 14.922 15.116 15.295 16.631 17.577 19.031 21.784 26.499 37.779 24
25 15.519 15.739 15.939 16.125 17.505 18.483 19.985 22.833 27.720 39.437 25
26 16.334 16.561 16.768 16.959 18.383 19.392 20.943 23.885 28.941 41.096 26
27 17.153 17.387 17.601 17.797 19.265 20.305 21.904 24.939 30.164 42.755 27
28 17.977 18.218 18.438 18.640 20.150 21.221 22.867 25.995 31.388 44.414 28
29 18.805 19.053 19.279 19.487 21.039 22.140 23.833 27.053 32.614 46.074 29
30 19.637 19.891 20.123 20.337 21.932 23.062 24.802 28.113 33.840 47.735 30
31 20.473 20.734 20.972 21.191 22.827 23.987 25.773 29.174 35.067 49.395 31
32 21.312 21.580 21.823 22.048 23.725 24.914 26.746 30.237 36.295 51.056 32

Page 7 of 3