Enlarged Diagram
Interactive Study Environment • APJ Abdul Kalam Technological University
📄 Open Notes Reader ↗
KTU 2024 SCHEME 9 CONTACT HOURS THEORY MASTERCLASS

Module 4: Physical Layer & Network Management

Exhaustive masterclass covering Network Management (SNMP, SMI, MIB, FCAPS), ASN.1 & BER Encoding, Data & Signals, Theoretical Data Rate Limits (Nyquist & Shannon), Digital Transmission (Line Coding, Scrambling, PCM), Analog Transmission (ASK, FSK, PSK, QAM), Bandwidth Utilization (FDM, TDM, FHSS, DSSS), and Transmission Media (Twisted Pair, Coaxial, Fiber Optics, Wireless Bands).

54 Pages
Official PDF Notes Synthesized
89 Figures
High-Res Diagrams Embedded
12 Parts
Step-by-Step Learning Progression
100% Theory
Zero Omissions
PART 01 CORE THEORY • 3M / 6M

Network Management: The Triad (SNMP, SMI, MIB) & FCAPS

PDF Pages: 1 – 4
💡 What is Network Management?

In a large enterprise network with thousands of heterogeneous routers, switches, and servers from different vendors, network administrators need a standardized way to monitor device health, configure parameters, detect link failures, and enforce security policies. SNMP is the universal framework for network management.

1. The Five Functional Areas of Network Management (FCAPS)

ISO defines five core functional areas of network management (remembered by the acronym FCAPS):

AreaAcronymPrimary Purpose & Responsibility
Fault Management F Detects, isolates, logs, and corrects abnormal network component failures (e.g., link down, interface error). Automatically alerts administrators via trap alarms.
Configuration Management C Tracks and manages hardware/software settings, port configurations, IP addresses, firmware versions, and topology inventory across all managed devices.
Accounting Management A Monitors user and department resource consumption (bandwidth, connection time) for billing, capacity planning, and quota enforcement.
Performance Management P Monitors and analyzes network health metrics: throughput, packet drop rates, interface utilization, latency, and CPU load to prevent bottlenecks.
Security Management S Controls access to network devices, enforces firewall rules, manages encryption keys, authenticates administrators, and logs security breaches.

2. The Triad of Network Management: SNMP, SMI & MIB

Network management in the Internet is divided into three distinct, cooperative standards:

ComponentFull NameRole & Analogy
SMI Structure of Management Information The Language / Grammar: Defines rules for naming objects, defining object data types, and specifying how objects are encoded.
MIB Management Information Base The Database / Dictionary: The actual collection of managed objects and variables (e.g., packets in, packets out, interface status) stored inside each device.
SNMP Simple Network Management Protocol The Messenger / Protocol: Defines the message formats, request/response syntax, and communication procedures between managers and agents.
SNMP, SMI and MIB Triad
Figure 1.1: The Three Pillars of Network Management: SNMP, SMI, and MIB (Page 3)
PART 02 VERY HIGH PRIORITY • 5M / 9M ESSAY

SMI Object Naming, OID Trees & Basic Encoding Rules (BER)

PDF Pages: 5 – 8

1. SMI Object Identifier (OID) Hierarchy

SMI names all managed objects hierarchically using an Object Identifier (OID) Tree. Each node has a name and an integer number:

iso(1) . org(3) . dod(6) . internet(1) . mgmt(2) . mib-2(1) \(\implies\) 1.3.6.1.2.1

SMI Object Identifier Tree
Figure 2.1: The Global SMI Object Identifier (OID) Tree Hierarchy (Page 7)

The 10 Core MIB-II Groups:

MIB udp Group and udpTable
Figure 2.2: The MIB-II udp Group and 4-tuple Indexed udpTable (Page 8)
📋 SMI Data Types: Simple, Structured & Application-Wide
CategoryType NameSizeBehavior & Purpose
ASN.1 Simple TypesINTEGER4 bytesPositive, zero, or negative integer values.
OCTET STRINGVariableSequence of 0 to 65535 raw bytes (text strings, MAC addresses).
OBJECT IDENTIFIERVariableHierarchical sequence of numbers identifying an object in MIB tree.
BITSVariableBit string where each bit represents a specific flag or boolean status.
ASN.1 StructuredSEQUENCEVariableOrdered combination of fields (like a C struct or table row).
SEQUENCE OFVariableArray of identical SEQUENCE objects (defines a complete table).
SMI Application-WideIPAddress4 bytes32-bit IPv4 address expressed as four octets.
Counter324 bytesMonotonically increasing counter (\(0\) to \(2^{32}-1\)); wraps back to zero when maxed. Used for cumulative traffic (packets/octets).
Counter648 bytes64-bit high-capacity counter for high-speed Gigabit interfaces.
Gauge324 bytesNon-wrapping metric that can increase or decrease; upon reaching maximum (\(2^{32}-1\)), it latches at max until reset. Used for current temperature or active connections.
TimeTicks4 bytesMeasures time elapsed in hundredths of a second (\(1/100\text{ s}\)) since device reboot or fixed epoch.
🏛️ MIB-II Object Structure: Scalar vs. Tabular Objects
  • Scalar Objects: Define a single distinct variable instance. In MIB-II notation, every scalar instance is addressed by appending .0 to its object identifier (e.g. udpInDatagrams.0 has OID 1.3.6.1.2.1.7.1.0).
  • Tabular Objects: Define multi-row database tables (like udpTable with OID 1.3.6.1.2.1.7.5). Each row is an entry with multiple columnar variables, indexed by a primary key (e.g., local IP and port).

2. Basic Encoding Rules (BER) — TLV Format

SMI uses ISO Basic Encoding Rules (BER) to convert abstract data types into machine-independent byte streams for network transmission. Every data item is encoded using Tag, Length, Value (TLV):

FieldFormatDescription
Tag (T)1 byteIdentifies data type (e.g., 0x02 = INTEGER, 0x04 = OCTET STRING, 0x06 = OID, 0x30 = SEQUENCE).
Length (L)1 or more bytesSpecifies length of Value in bytes.
Value (V)\(L\) bytesThe actual data value encoded in binary / two's complement.
📐 High-Frequency KTU Numerical: BER TLV Encoding Examples
  • Encode INTEGER 14:
    Tag for INTEGER = 02 (hex).
    Length = 1 byte \(\implies\) 01 (hex).
    Value = 14 in hex is 0E.
    \(\implies\) Encoded BER: 02 01 0E.
  • Encode OCTET STRING "HI":
    Tag for OCTET STRING = 04 (hex).
    Length = 2 bytes \(\implies\) 02 (hex).
    ASCII values: 'H' = 72 = 48 (hex), 'I' = 73 = 49 (hex).
    \(\implies\) Encoded BER: 04 02 48 49.
📦 BER Tag Field Architecture & Concrete Encodings

In Basic Encoding Rules (BER), every object is encoded into Tag, Length, Value (TLV) octets. The Tag Byte consists of three subfields:

Real BER Encoding Examples (from Notes Page 7)

Object / TypeValueBER Hex EncodingDetailed Byte Breakdown
INTEGER1402 04 00 00 00 0ETag = 02 (INTEGER), Length = 04 bytes, Value = 00 00 00 0E (hex for 14). (Or short form 02 01 0E).
OCTET STRING"HI"04 02 48 49Tag = 04 (OCTET STRING), Length = 02 bytes, Value = 48 49 ('H'=0x48, 'I'=0x49).
OBJECT IDENTIFIER1.3.6.106 04 01 03 06 01Tag = 06 (OID), Length = 04, Sub-identifiers = 01 03 06 01.
IPAddress131.21.14.840 04 83 15 0E 08Tag = 40 (Application class), Length = 04, Octets = 83 15 0E 08 (hex for 131, 21, 14, 8).
PART 03 VERY HIGH PRIORITY • 5M / 9M ESSAY

SNMP Protocol: Manager-Agent Architecture, PDUs & Ports

PDF Pages: 9 – 12

1. SNMP Manager and Agent Architecture

Network management follows a client-server paradigm with specialized roles:

SNMP Manager and Agent Interaction
Figure 3.1: SNMP Manager-Agent Query and Trap Interaction (Page 2)

2. The Eight SNMP PDU Types (PDF Page 9)

PDU NameDirectionPurpose & Role
GetRequestManager → AgentRetrieves the value of one or more specific MIB variables.
GetNextRequestManager → AgentRetrieves the next lexicographical variable in the MIB tree (table traversal).
GetBulkRequestManager → AgentRetrieves large blocks of tabular data in a single exchange (SNMPv2/v3).
SetRequestManager → AgentModifies or configures the value of a specific MIB variable on the agent.
ResponseAgent → ManagerReturns the requested variable values or confirms a successful set action.
TrapAgent → ManagerUnsolicited asynchronous alarm reporting an unexpected event (SNMPv1).
InformRequestManager → ManagerAlert message sent from one NMS to another NMS, requiring an acknowledgment.
SNMPv2-TrapAgent → ManagerModernized unsolicited notification reporting exceptional events (SNMPv2/v3).
SNMP PDU Directions
Figure 3.2: Direction of Flow for the 8 SNMP PDU Types (Page 9)

3. Transport Protocol & Port Numbers

SNMP operates over UDP because of its low overhead and ability to function even when network links are heavily congested:

PART 04 EXAM FAVORITE • 5M / 9M

Abstract Syntax Notation One (ASN.1)

PDF Pages: 13 – 16
💡 What is ASN.1?

ASN.1 is a standard formal notation used to define data structures and types independent of machine architecture, word size, or operating systems. SMI uses a subset of ASN.1 to define MIB objects.

1. ASN.1 Lexical Conventions & Syntax Rules

2. ASN.1 Data Types

CategoryASN.1 TypeDescription & Example Definition
Simple TypesBOOLEANContains values TRUE or FALSE.
INTEGERPositive or negative whole numbers; can have named values or range constraints.
BIT STRINGOrdered sequence of zero or more bits (e.g., '0110'B or '4F'H).
OCTET STRINGOrdered sequence of zero or more 8-bit bytes (text strings, binary).
Structured TypesSEQUENCEAn ordered list of heterogeneous fields (equivalent to a struct in C).
SEQUENCE OFAn ordered list of homogeneous elements (equivalent to an array in C).
⭐ High-Frequency KTU Question: Identifying Errors in ASN.1 Declarations

Sample Problem: Identify errors in the following declarations and correct them:

  1. studentAge INTEGER = 21
    Error: Used = instead of assignment operator ::=.
    Correct: studentAge INTEGER ::= 21
  2. classSize NumberOfStudents ::= 50 (where NumberOfStudents ::= INTEGER (1..40))
    Error: Value 50 violates the subrange constraint (1..40).
    Correct: Value must be between 1 and 40 (e.g., classSize NumberOfStudents ::= 35).
  3. EmployeeName ::= octet string
    Error: Built-in types must be written in ALL-CAPS: OCTET STRING.
    Correct: EmployeeName ::= OCTET STRING
📑 ASN.1 Structured Types & Subtyping Rules
PART 05 CORE FOUNDATION • 5M / 9M

Physical Layer: Signals, Impairments & Decibels

PDF Pages: 17 – 25
💡 Role of the Physical Layer

The Physical Layer is the only layer where data is converted into physical energy (voltages, light pulses, or electromagnetic waves) and transmitted across a physical medium.

1. Data & Signals: Analog vs. Digital, Time vs. Frequency Domain

Data can be analog (continuous, like human voice) or digital (discrete states, like computer data). To be transmitted across a physical medium, data must be converted into electromagnetic signals:

🌊 Sine Wave Parameters

A simple analog periodic signal is represented by a sine wave: \(s(t) = A \sin(2\pi f t + \phi)\), defined by three parameters:

  • Peak Amplitude (\(A\)): The absolute maximum value or highest intensity of the signal, measured in volts, amperes, or watts.
  • Frequency (\(f\)) & Period (\(T\)): Frequency is the number of complete cycles per second (\(\text{Hz}\)); Period is the time required to complete 1 cycle (\(T = 1/f\)).
  • Phase (\(\phi\)): The position of the waveform relative to time zero, measured in degrees or radians.
  • Wavelength (\(\lambda\)): The distance a signal propagates in one period: \(\lambda = v \times T = v / f\) (where \(v\) is propagation speed).

2. Transmission Impairments & Decibel Calculations

Signals experience three primary types of transmission impairments as they travel across physical media:

ImpairmentCause & MechanismEffect on SignalMitigation Technique
AttenuationResistance of medium dissipates electrical/optical energy as heat over distance.Loss of signal amplitude and strength.Amplifiers (analog) or Repeaters (digital). Formula: \(\text{dB} = 10 \log_{10}(P_2/P_1)\) (10 log power ratio formula).
DistortionDifferent frequency components travel at different speeds (delay distortion) in composite signals.Changes composite signal shape and phase relationships.Equalizers at receiver.
NoiseExternal unwanted electrical signals corrupting the transmitted waveform.Flipping bits, causing data errors.Shielding, differential signaling, higher SNR.

Categories of Noise in Communications

1. Nyquist Bit Rate (For Noiseless Channels)

Formulated by Harry Nyquist in 1928 for an ideal, noiseless channel of bandwidth \(B\) using \(L\) discrete signal levels:

\[\text{Bit Rate} = 2B \log_2(L) \quad \text{bps}\]

Standard formula: Bit Rate = 2B log2(L) bps (where \(B\) is bandwidth in Hertz, and \(L\) is the number of signal levels).

2. Shannon Capacity (For Noisy Channels)

Formulated by Claude Shannon in 1944. Defines the ultimate theoretical upper bound on channel capacity (\(C\)) in the presence of thermal white noise:

\[C = B \log_2(1 + \text{SNR}) \quad \text{bps}\]

Standard formula: Capacity C = B log2(1 + SNR) bps (theoretical upper limit in a noisy channel).

Crucial Insight: Notice that the Shannon formula has no signal level \(L\) term! No matter how many signal levels an engineer designs, the data rate can never exceed the Shannon capacity without increasing bandwidth or reducing noise.

📐 High-Frequency KTU Numerical Problem: Combining Shannon & Nyquist

Problem: A channel has a bandwidth of 1 MHz and a signal-to-noise ratio (\(\text{SNR}\)) of 63. Calculate:

  1. The theoretical maximum channel capacity (Shannon capacity).
  2. The number of signal levels \(L\) required to achieve a bit rate of 4 Mbps using the Nyquist formula.

Solution:

  1. Shannon Capacity: \[C = B \log_2(1 + \text{SNR}) = 1 \times 10^6 \times \log_2(1 + 63) = 10^6 \times \log_2(64)\] Since \(64 = 2^6\), \(\log_2(64) = 6\).
    \[C = 10^6 \times 6 = \mathbf{6 \text{ Mbps}}\] (The absolute physical ceiling of this channel is 6 Mbps).
  2. Signal Levels for 4 Mbps: We want \(\text{Bit Rate} = 4\text{ Mbps}\). By Nyquist formula: \[4 \times 10^6 = 2 \times B \times \log_2(L) = 2 \times (1 \times 10^6) \times \log_2(L)\] \[4 = 2 \log_2(L) \implies \log_2(L) = 2 \implies L = 2^2 = \mathbf{4 \text{ signal levels.}}\]
PART 07 VERY HIGH PRIORITY • 5M / 9M ESSAY

Digital Transmission: Line Coding, Block Coding & Scrambling

PDF Pages: 26 – 32
💡 What is Line Coding?

Line coding converts a sequence of binary digital bits (1s and 0s) into a digital voltage signal suitable for transmission over a wire. Desirable characteristics: self-synchronization (clock recovery), no DC component, noise immunity, and bandwidth efficiency.

1. Five Major Line Coding Schemes & Waveform Characteristics

Line coding converts a sequence of digital bits into a digital signal waveform. Schemes are broadly classified into:

Line Coding Schemes
Figure 7.1: Line Coding Waveforms: NRZ-L, NRZ-I, RZ, Manchester, and Differential Manchester (Page 27)
SchemeEncoding Rule for '0'Encoding Rule for '1'Self-Sync & DC Component
NRZ-L (Level) Positive voltage level (\(+V\)). Negative voltage level (\(-V\)). No self-sync during long runs of 0s or 1s. Has strong DC component.
NRZ-I (Invert) No transition at start of bit interval. Invert (transition) at start of bit interval. Self-syncs on 1s, but loses sync during long runs of 0s.
RZ (Return-to-Zero) Negative level returns to zero at midpoint. Positive level returns to zero at midpoint. Good sync, but uses 3 voltage levels and doubles bandwidth!
Manchester Transition from HIGH to LOW at midpoint. Transition from LOW to HIGH at midpoint. Perfect self-synchronization! (Used in 10 Mbps Ethernet). Zero DC component. Doubles bandwidth.
Differential Manchester Transition at the beginning of the bit interval. No transition at the beginning of bit interval. (Always transitions at midpoint). Excellent noise immunity and perfect self-sync. (Used in Token Ring).
Bipolar AMI Zero voltage (0 V). Alternating positive and negative voltages (\(+V, -V, +V...\)). Zero DC component. Long runs of 0s lose synchronization.
Bipolar AMI Scheme
Figure 7.2: Bipolar AMI: Zero Level for '0', Alternating Polarities for '1' (Page 29)
⚡ Line Coding Characteristics: Baseline Wandering & Baud Rate
  • Baseline Wandering: In decoding incoming digital signals, the receiver calculates a running average of received signal power called the baseline. Long sequences of consecutive 0s or 1s shift this baseline voltage (baseline wandering), causing the receiver to misinterpret signal thresholds and drop bits.
  • DC Component: When voltage levels remain on one side of zero for extended periods, low frequencies around zero (DC component) are created. Media with transformers or capacitors cannot pass DC components.
  • Baud Rate (Signal Rate \(S\)) vs. Bit Rate (\(N\)):
    • Bit Rate (\(N\)): Number of data bits transmitted per second (\(\text{bps}\)).
    • Baud Rate / Signal Rate (\(S\)): Number of signal element transitions (symbols) per second (\(\text{baud}\)).
    • Relationship: \(S_{\text{ave}} = c \times N \times \frac{1}{r}\) (where \(c\) is the case factor, typically \(1/2\), and \(r\) is data bits per signal element).

2. Scrambling: B8ZS and HDB3

Used with Bipolar AMI to eliminate long runs of zeros without increasing the transmission bit rate (unlike Manchester):

B8ZS Scrambling
Figure 7.3: B8ZS Substitution Pattern: 000VB0VB (Page 31)
PART 08 VERY HIGH PRIORITY • 5M / 9M ESSAY

Analog-to-Digital Conversion: Pulse Code Modulation (PCM)

PDF Pages: 32 – 35
💡 Why Digitize Analog Signals?

Human voice and music are continuous analog waveforms. Converting analog data to digital bits allows transmission over noise-immune digital networks, encryption, compression, and computer processing.

1. The Three Steps of Pulse Code Modulation (PCM)

  1. Step 1: Sampling: The continuous analog signal is sampled at periodic intervals of \(T_s\).
    Nyquist Sampling Theorem: The sampling frequency \(f_s\) must be at least twice the highest frequency component (\(f_{\text{max}}\)) of the analog signal: \[f_s \ge 2 \times f_{\text{max}}\]
  2. Step 2: Quantization: The continuous sampled voltage amplitudes are rounded to the nearest discrete quantization level. If \(n_b\) bits are used per sample, the number of quantization levels is: \[L = 2^{n_b}\] The difference between the actual sample and the rounded value is the Quantization Error (\(\Delta\)).
  3. Step 3: Encoding: Each quantized level is translated into an \(n_b\)-bit binary code word.
    Digital Bit Rate Formula: \[\text{Bit Rate} = f_s \times n_b = 2 \times f_{\text{max}} \times n_b \quad \text{bps}\]
Sampling Methods
Figure 8.1: Sampling: Ideal, Natural, and Flat-Top (Page 33)
Quantization and Encoding
Figure 8.2: Quantization Levels & Binary Encoding (Page 34)
📐 High-Frequency KTU Numerical Problem: PCM Telephone Voice Digitization

Problem: A human voice signal has a bandwidth of 4 kHz. It is digitized using PCM with 8 bits per sample (\(n_b = 8\)). Find:

  1. The Nyquist sampling rate.
  2. The resulting bit rate.
  3. The theoretical SNR in decibels (\(\text{SNR}_{\text{dB}}\)).

Solution:

  • \(f_{\text{max}} = 4\text{ kHz}\).
  • Sampling rate \(f_s = 2 \times 4\text{ kHz} = \mathbf{8000 \text{ samples/second}}\).
  • Bit Rate \(= f_s \times n_b = 8000 \times 8 = \mathbf{64 \text{ kbps}}\) (the universal digital telephone DS0 voice channel!).
  • \(\text{SNR}_{\text{dB}} = 6.02 \times n_b + 1.76 = 6.02(8) + 1.76 = \mathbf{49.92 \text{ dB}}\).
🎙️ Non-Linear Quantization: Companding (A-law & μ-law)

In human speech, soft sounds occur far more frequently than loud sounds. Linear uniform quantization produces large relative quantization errors for soft whisper signals. To optimize fidelity:

  • Companding (Compressing + Expanding): The analog input signal is non-linearly compressed at the transmitter (amplifying weak signals more than strong signals), uniformly quantized and encoded, and expanded at the receiver using the inverse logarithmic transfer curve.
  • Standard Companding Laws:
    1. μ-law (mu-law): Standard in North America and Japan (\(\mu = 255\)): \[y = \frac{\ln(1 + \mu |x|)}{\ln(1 + \mu)} \cdot \operatorname{sgn}(x)\]
    2. A-law: Standard in Europe and international ITU-T telecommunications (\(A = 87.6\)): \[y = \frac{1 + \ln(A |x|)}{1 + \ln A} \cdot \operatorname{sgn}(x) \quad \text{for } \frac{1}{A} \le |x| \le 1\]

2. Delta Modulation (DM)

Instead of sending full 8-bit values for each sample, DM sends only 1 bit per sample indicating whether the signal is increasing (1) or decreasing (0). Uses a simple staircase approximation.

PART 09 VERY HIGH PRIORITY • 5M / 9M ESSAY

Digital-to-Analog Modulation: ASK, FSK, PSK & QAM

PDF Pages: 36 – 42
💡 Why Carrier Modulation?

Bandpass channels (radio airwaves, cable TV, long-distance telephone lines) cannot transmit baseband square waves. Digital bits must modulate the amplitude, frequency, or phase of a high-frequency sinusoidal carrier wave.

1. Carrier Modulation & Digital-to-Analog Schemes

In analog transmission, digital data modulates a high-frequency sinusoidal Carrier Signal: \(c(t) = A_c \cos(2\pi f_c t + \phi)\), altering one or more of its characteristics:

ASK, FSK and PSK Waveforms
Figure 9.1: Waveforms for ASK, FSK, and PSK Aligned with Digital Data (Page 37)
TechniqueWhat ChangesWhat Remains ConstantBandwidth Formula
ASK (Amplitude Shift Keying) Carrier amplitude changes (bit 1 = high amplitude, bit 0 = zero amplitude in OOK). Frequency and Phase. \(B = (1 + d) \times S\)
FSK (Frequency Shift Keying) Carrier frequency changes (\(f_1\) for 1, \(f_2\) for 0). Amplitude and Phase. \(B = (1 + d) \times S + 2\Delta f\)
PSK (Phase Shift Keying) Carrier phase shifts (BPSK: 0° for bit 1, 180° for bit 0). Amplitude and Frequency. \(B = (1 + d) \times S\)
QAM (Quadrature Amplitude Modulation) Both amplitude AND phase vary simultaneously. Frequency. Same as PSK, but carries \(\log_2(L)\) bits per baud!

2. Constellation Diagrams & QAM

A constellation diagram plots signal states on a 2D polar plane: the horizontal \(X\)-axis represents the in-phase carrier, and the vertical \(Y\)-axis represents the quadrature carrier. A 16-QAM constellation has 16 points, carrying \(n = \log_2(16) = \mathbf{4 \text{ bits per signal element}}\)!

Constellation Diagrams and QAM
Figure 9.2: Constellation Diagrams for BPSK, QPSK, 8-QAM, and 16-QAM (Page 38)
PART 10 VERY HIGH PRIORITY • 5M / 9M ESSAY

Bandwidth Utilization: Multiplexing & Spread Spectrum

PDF Pages: 43 – 49
💡 What is Bandwidth Utilization?

A physical transmission line often has far more bandwidth than an individual communication flow requires. Multiplexing allows multiple low-rate channels to share a single high-capacity medium. Spread Spectrum expands a signal's bandwidth over a wide band to provide military-grade anti-jamming, privacy, and noise immunity.

1. Multiplexing Techniques: FDM, WDM & TDM

Frequency Division Multiplexing
Figure 10.1: Frequency-Division Multiplexing (FDM) with Guard Bands (Page 43)

Synchronous TDM vs. Statistical TDM (PDF Page 45 – 46)

Comparison ParameterSynchronous TDMStatistical (Asynchronous) TDM
Slot Allocation Pre-allocated fixed slots to every input line in a round-robin cycle. Slots allocated dynamically on-demand only to input lines that currently have data to send.
Channel Efficiency Low. If an input line has no data, its allocated time slot goes empty and is wasted! High. Zero empty slots; bandwidth is fully packed.
Addressing Overhead No addressing needed; slot position implicitly identifies the sender. Every slot must carry an address tag identifying destination/source.
Buffer Requirements Minimal buffering required. Requires memory buffers at multiplexer during peak bursts.
Synchronous vs Statistical TDM
Figure 10.2: Synchronous TDM (Empty Wasted Slots) vs Statistical TDM (Dynamic Slots) (Page 45)

2. Spread Spectrum: FHSS vs. DSSS

📡 Spread Spectrum Mechanics: PN Code & Chipping Rate

Spread spectrum techniques intentionally expand the transmission bandwidth to achieve security, anti-jamming, and multi-user access:

  • Frequency Hopping Spread Spectrum (FHSS): The carrier frequency switches rapidly among \(M\) different channels guided by a pseudo-random sequence. The time spent at each frequency is the dwell time.
  • Direct Sequence Spread Spectrum (DSSS): Each original data bit is multiplied by an \(N\)-bit PN code (Pseudorandom Noise code) chip sequence.
    • Chipping Rate: The rate at which the PN code chips are generated (\(f_{\text{chip}} \gg f_{\text{data}}\)). The bandwidth expansion factor is given by the ratio of the chipping rate to the data bit rate.
FeatureFrequency Hopping Spread Spectrum (FHSS)Direct Sequence Spread Spectrum (DSSS)
Working Principle Signal modulates a carrier that hops rapidly between different frequencies according to a pseudo-random sequence. Each original data bit is multiplied by an \(n\)-bit high-rate pseudo-random Barker chip sequence.
Bandwidth Expansion Frequency band is divided into \(M\) hopping channels. Signal bandwidth is expanded by a factor of \(n\) (\(\text{Chip Rate} = n \times N\)).
Applications Bluetooth (1600 hops/second), military communications. Wi-Fi (802.11b), GPS, CDMA cellular networks.
Benefits Highly resistant to narrowband frequency jamming and eavesdropping. Immune to multi-path fading, allows simultaneous shared access (CDMA).
FHSS and DSSS Spread Spectrum
Figure 10.3: Spread Spectrum Principles: Frequency Hopping (FHSS) and Direct Sequence (DSSS) (Page 47)
PART 11 VERY HIGH PRIORITY • 5M / 9M ESSAY

Transmission Media: Guided (Cables) & Unguided (Wireless)

PDF Pages: 50 – 54

1. Guided Transmission Media (Guided media: Cables)

Guided media provide a physical conduit from one device to another:

Medium TypePhysical ConstructionBandwidth & AttenuationImmunity & Use Case
Twisted-Pair (UTP / STP)Two insulated copper conductors twisted in a helical spiral to cancel electromagnetic induction and crosstalk.10 Mbps – 10 Gbps depending on Category (Cat 5e, Cat 6, Cat 6a).Low cost; standard for Ethernet LAN drops (RJ-45 connectors).
Coaxial CableCentral solid copper core surrounded by dielectric insulator, braided foil/metal shield, and outer jacket.Higher bandwidth than twisted-pair; lower attenuation.Cable television (CATV), broadband internet, legacy 10Base5/10Base2.
Fiber-Optic CableGlass or plastic core surrounded by lower-density cladding and protective buffer jacket.Terabits/sec; extremely low attenuation over tens of kilometers.Immune to EMI, noise, and wiretapping; backbone Internet trunks.

Optical Physics: Refraction, Critical Angle & Total Internal Reflection

2. Unguided Transmission Media (Unguided media: Wireless)

Unguided media transport electromagnetic waves without using a physical conductor. Wireless propagation occurs through the atmosphere or free space across three primary frequency bands:

Wireless BandFrequency RangePropagation ModeCharacteristics & Applications
Radio Waves3 kHz – 1 GHz 1. Ground wave: < 2 MHz follows Earth curvature.
2. Sky wave: 2 – 30 MHz reflects off the ionosphere.
3. Line-of-sight: > 30 MHz straight line between antennas.
Omnidirectional (sends in all directions); penetrates walls easily. Used in AM/FM radio, television, paging.
Microwaves1 GHz – 300 GHzLine-of-sight propagationUnidirectional (focused beams via parabolic dish or horn antennas); cannot penetrate solid walls well. Used in cellular, satellite, and Wi-Fi.
Infrared Waves300 GHz – 400 THzLine-of-sight propagationHigh frequency; cannot penetrate walls, preventing interference between adjacent rooms; no government frequency license required. Used in TV remote controls and short-range wireless peripherals.
PART 12 EXAM MASTERCLASS • NUMERICALS & QUESTION BANK

KTU Examination Masterclass & Solved Problems

📐 Master Waveform Question: Draw NRZ-L, NRZ-I and Manchester (KTU 6 Marks)

Problem: Draw the line coding waveforms for the bit sequence 1 0 1 1 0 0 1 for:

  1. NRZ-L (Non-Return-to-Zero, Level)
  2. NRZ-I (Non-Return-to-Zero, Invert on 1)
  3. Manchester

Waveform Guide:

  • Bit Sequence: 1 0 1 1 0 0 1
  • 1. NRZ-L: Bit 1 = Negative Voltage (\(-V\)); Bit 0 = Positive Voltage (\(+V\)).
    Voltages: \(-V, +V, -V, -V, +V, +V, -V\).
  • 2. NRZ-I: Transition at start of bit for '1'; No transition for '0'.
    Assume initial state before bit 1 is negative.
    • Bit 1: Inverts \(\rightarrow\) High.
    • Bit 0: No invert \(\rightarrow\) stays High.
    • Bit 1: Inverts \(\rightarrow\) Low.
    • Bit 1: Inverts \(\rightarrow\) High.
    • Bit 0: No invert \(\rightarrow\) stays High.
    • Bit 0: No invert \(\rightarrow\) stays High.
    • Bit 1: Inverts \(\rightarrow\) Low.
  • 3. Manchester: Midpoint transition: '0' = High-to-Low (\(\downarrow\)); '1' = Low-to-High (\(\uparrow\)).
    Midpoint transitions: \(\uparrow, \downarrow, \uparrow, \uparrow, \downarrow, \downarrow, \uparrow\).

KTU Module 4 Comprehensive Question Bank

Answer:

  • SMI (Structure of Management Information): Defines the grammar and rules for naming objects, defining object data types, and specifying how objects are encoded using ASN.1.
  • MIB (Management Information Base): The database holding the collection of managed objects, tables, and variables residing inside each managed network device.
  • SNMP (Simple Network Management Protocol): The application-layer communication protocol that defines the message formats (PDUs) exchanged between managers and agents over UDP ports 161 and 162.

Answer Blueprint:

  1. Introduction (1 Mark): Define PCM as the standard method for converting an analog waveform into digital bits.
  2. Step 1: Sampling & Nyquist Theorem (3 Marks): Draw analog curve with vertical sample pulses. State that sampling frequency must satisfy \(f_s \ge 2 f_{\text{max}}\) to prevent aliasing.
  3. Step 2: Quantization & Quantization Error (2.5 Marks): Explain dividing amplitude into \(L = 2^{n_b}\) discrete levels. Define quantization error \(\Delta\) and give \(\text{SNR}_{\text{dB}} = 6.02 n_b + 1.76\text{ dB}\).
  4. Step 3: Encoding & Bit Rate (2.5 Marks): Show converting levels into binary codewords. Give bit rate formula \(\text{Bit Rate} = f_s \times n_b\) and telephone voice 64 kbps example.
⚡ Module 4 Last-Minute Memory Mnemonics
  • Network Management Areas: FCAPS → Fault, Configuration, Accounting, Performance, Security.
  • SNMP UDP Ports: Agent listens on 161; Manager Trap listens on 162.
  • Shannon Capacity: \(C = B \log_2(1 + \text{SNR})\).
  • Nyquist Rate: \(\text{Bit Rate} = 2 B \log_2 L\).
  • PCM Telephone Bit Rate: \(8000 \text{ samples/s} \times 8 \text{ bits/sample} = \mathbf{64 \text{ kbps}}\).
  • Half-Power Loss: \(10 \log_{10}(0.5) = \mathbf{-3 \text{ dB}}\).