22-Elec-B4 Information Technology Networks · May 2015
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
Paper format. Professional Engineers of Ontario annual examination, 07-Elec-B4 Information Technology Networks, May 2015. Three hours, closed book, one PEO-approved non-programmable calculator permitted. Marks are printed in the left margin; the cover page states that there are five questions of 25 marks each and that any four constitute a complete paper worth 100 marks. All five questions and every sub-part are answered below, because this set is intended as a study resource rather than as a sat examination.
Reference texts. A. Leon-Garcia and I. Widjaja, Communication Networks: Fundamental Concepts and Key Architectures, 2nd ed. — the text listed by the Engineers Canada syllabus for this examination code; J. F. Kurose and K. W. Ross, Computer Networking: A Top-Down Approach, 8th ed.; A. S. Tanenbaum and D. J. Wetherall, Computer Networks, 5th ed.; W. Stallings, Wireless Communications and Networking, 2nd ed.; T. S. Rappaport, Wireless Communications: Principles and Practice, 2nd ed. Normative documents cited: ISO/IEC 7498-1 (the OSI reference model), IEEE 802.3 (CSMA/CD), IEEE 802.5 (token ring), IEEE 802.11 (wireless LAN), 3GPP TS 23.401 (the LTE Evolved Packet Core), RFC 793 (TCP), RFC 768 (UDP) and RFC 5681 (TCP congestion control).
Question text not reproduced: the examination questions are © Engineers and Geoscientists BC. Open the official past paper (linked at the top of this page) to read the question, then follow the worked solution below.
Part (a) — spatial reuse of frequencies. Spatial reuse is the practice of using the same radio channel simultaneously at two locations that are far enough apart that path loss attenuates each transmitter's signal, at the other's receiver, to below the level that would interfere with it. It is what converts a fixed and legally scarce block of spectrum into a capacity that grows with the number of base stations rather than being fixed by the bandwidth.
The mechanism is a tiling. The service area is modelled as a lattice of hexagonal cells; the cells are grouped into clusters of $N$ cells; the whole spectrum is divided into $N$ channel groups and one group is assigned to each cell of the cluster, so that no two cells of a cluster share a channel; the cluster pattern is then repeated over the coverage area. Every channel group therefore appears once per cluster, and the number of times the whole spectrum is reused equals the number of clusters that fit the service area.
The separation this achieves is fixed by the geometry. For hexagonal cells of circumradius $R$ and cluster size $N$, the distance between the centres of two co-channel cells is
$$D = R\,\sqrt{3N}, \qquad Q \;=\; \frac{D}{R} \;=\; \sqrt{3N}$$where $Q$ is the co-channel reuse ratio. Taking the numbers this paper supplies in part (d) as the example — a cell of area 1 km2 and a cluster size of 7 — the hexagon's circumradius follows from $A = \tfrac{3\sqrt{3}}{2}R^{2}$, giving $R = 0.620$ km, and hence $D = 0.620\sqrt{21} = 2.84$ km with $Q = 4.583$. Two cells only 2.84 km apart therefore transmit on the identical 7 MHz of spectrum at the same instant. The capacity consequence is the point of the exercise: the 28 km2 city holds four complete clusters, so the operator's 49 MHz is reused four times over and the system carries four times the traffic that a single high-power transmitter on the same licence could carry. Shrinking the cells (cell splitting) multiplies that gain again, which is why urban capacity is added by adding sites rather than by acquiring spectrum.
Part (b) — co-channel interference and where it is worst. Co-channel interference is the interference suffered by a receiver from transmitters in other cells that are using the same channel group, and it is the price paid for spatial reuse — unlike thermal noise it cannot be overcome by raising transmit power, because raising every cell's power raises the interference in proportion.
It is worst at the cell edge, on the boundary facing the nearest co-channel cell, because that is simultaneously the point of lowest wanted signal (the subscriber is at maximum range $R$ from the serving base station) and of highest unwanted signal (the subscriber is at the minimum possible distance $D-R$ from the nearest co-channel transmitter), so the signal-to-interference ratio takes its minimum there. With a path-loss exponent $n$ and six first-tier co-channel cells the worst-case ratio is approximately
$$\frac{S}{I} \;\approx\; \frac{R^{-n}}{6\,(D-R)^{-n}} \;=\; \frac{(Q-1)^{n}}{6}$$which is the relation used to choose $N$: a larger cluster pushes $Q$ up and fixes an inadequate margin, at the cost of giving each cell fewer channels.
Part (c) — multipath propagation and signal loss. A transmitted signal reaches the receiver over several paths of different lengths — a direct ray plus reflections from buildings, ground and vehicles — and because the path-length differences translate into phase differences, the components can add destructively and produce a deep fade even though the total radiated power has not changed.
The example worth giving is how little movement it takes. At the 1.9 GHz PCS frequency the wavelength is $\lambda = c/f = 15.8$ cm, so a path-length difference of $\lambda/2 = 7.9$ cm inverts the phase of a reflected ray relative to the direct ray; a handset that moves only $\lambda/4 = 3.9$ cm can therefore travel from a fade to a peak, which is exactly the rapid Rayleigh fading heard as a flutter when a subscriber walks past a building. The same mechanism produces a second, distinct impairment: because the echoes are also delayed, the delay spread smears each symbol into its neighbour and causes intersymbol interference once the spread approaches a symbol period, which is why GSM specifies an adaptive equaliser and why LTE uses OFDM with a cyclic prefix.
Part (d) — how many simultaneous calls?
Given.
| Quantity | Symbol | Value |
|---|---|---|
| City area | $A_{\text{city}}$ | 28 km2 |
| Cell area | $A_{\text{cell}}$ | 1 km2 |
| Reuse cluster size | $N$ | 7 cells |
| System bandwidth | $B_{\text{sys}}$ | 49 MHz |
| Bandwidth per user (incl. guardband) | $B_{u}$ | 25 kHz |
Find. The number of users who can be in a call at the same instant across the whole system, and the number per cell.
Approach. Divide the spectrum into channels, divide those channels among the $N$ cells of one cluster to obtain the per-cell figure, then multiply the per-cell figure by the number of cells covering the city.
| Result | Value |
|---|---|
| Cells covering the city | 28 (four clusters of seven) |
| Channels in the full 49 MHz | 1960 |
| Bandwidth per cell | 7 MHz |
| Simultaneous calls per cell | 280 |
| Simultaneous calls system-wide | 7840 |
Check: this is a raw channel count, not an offered-traffic figure. It assumes every channel is usable for traffic, i.e. that control and signalling channels, guard bands between operators and any sectorisation overhead have already been accounted for inside the 25 kHz allocation. It also assumes frequency-division duplex bandwidth is quoted one-way; if the 49 MHz were a paired total, the traffic capacity would halve.
Part (e) — peak bit rate of a GSM user.
Given. A TDM frame of duration $T_f = 4.615$ ms shared by $n = 8$ users; each user transmits a burst of $b = 148$ bits in its slot; a guard time of $T_g = 0.030$ ms separates one burst from the next.
Find. The peak bit rate at which a user's transmitter must run — that is, the instantaneous rate during the burst, not the average over the frame.
Approach. Divide the frame into eight equal slots, remove the guard time to obtain the interval in which bits are actually radiated, then divide the burst length by that interval.
| Result | Value |
|---|---|
| Slot duration | 576.875 µs |
| Burst duration (slot less guard) | 546.875 µs |
| Peak bit rate per user | 270.6 kbit/s |
| Published GSM channel rate (check) | 270.833 kbit/s (0.08 per cent apart) |
| Average rate over the frame (context) | 32.07 kbit/s |