Written Assignment Unit 3
University of the people
CS 2204 - Communications and Networking
Amedee Jacques (Instructor)
10/07/2024
The Hidden Node Problem
In wireless networks, the Hidden Node Problem arises when two nodes, A and C, are unable
to detect each other's signals because of obstructions or distance, yet they are both able to
communicate with a common node, B. The fact that A and C are not aware of each other's
transmissions puts node B at risk for data collisions.
Spatial Configurations:
Linear Configuration: Nodes B is positioned in the center of a straight line, with A and C at its
ends. Though they are unable to detect one another, A and C are able to speak with B.
Obstacle Configuration: To prevent their signals from being blocked, Nodes A and C are
positioned on opposite side of a sizable obstruction, such as a building. Both can still
communicate with node B, which is situated where the obstruction does not obstruct
communication.
4B/5B Encoding for “Sun”
To guarantee that there are enough transitions to keep the clock in sync, 4B/5B encoding is
utilized. A 5-bit code corresponds to each 4-bit group. "Sun" has the following ASCII values:
S: 0101 0011
u: 0111 0101
n: 0110 1110
For 4B/5B encoding, we map each 4-bit segment:
0101 -> 10101
0011 -> 00111
0111 -> 11110
0101 -> 10101
0110 -> 01101
1110 -> 11101
So, the 4B/5B encoded string for "Sun" is: 10101 00111 11110 10101 01101 11101.
16-bit Internet Checksum for Binary Message 00110001 00110010 00110011
The binary message corresponds to the ASCII characters "1", "2", "3":
00110001 (49 in decimal)
00110010 (50 in decimal)
00110011 (51 in decimal)
To calculate the checksum:
Sum the values: 49 + 50 + 51 = 150
Convert the sum to binary: 150 = 10010110
Since we need a 16-bit result, we pad it: 00000000 10010110
Compute the one's complement: 11111111 01101001
Thus, the 16-bit Internet checksum is: 11111111 01101001.
CRC Checksum for 11011000 Using Polynomial 1011
Append three zeros to the message: 11011000 -> 11011000000
Divide the augmented message by the polynomial 1011 using binary division:
11011000000
1011
-----
0110100000
1011
-----
010110000
1011
----
01101000
1011
----
0101000
1011
----
011000
1011
----
01000
The remainder is 000, so the 3-bit CRC checksum is 000.
Time Domain Reflectometry
By measuring reflections brought on by variations in impedance, Time Domain Reflectometry
(TDR) is a technique used to assess the properties of electrical lines. TDR is frequently used to
spot discontinuities, measure the length of cables, and detect problems in them. A fault or
impedance mismatch causes some of the signal to be reflected back; the location and type of
the fault can be ascertained by examining these reflections.
Reference:
Dordal, P. (2023). An introduction to computer
networks. https://my.uopeople.edu/pluginfile.php/1874554/mod_book/chapter/519481/Comp
uterNetworksText.pdf?time=1701076389874
