Data Transmission: Principles, Methods, Error Detection, and Cryptography

Fundamentals of Data Packets

• Definition of Data Packets:

  • Information transmitted across networks and the internet is split into manageable units known as data packets (frequently termed datagrams).

  • These packets are generated by the Transmission Control Protocol (TCP), which coordinates and organizes the transmission of data over digital networks.

  • Routing smaller segments of information is significantly faster and less prone to resource bottlenecking than transmitting large, contiguous data blocks.

  • Network routing represents the process of identifying the most efficient, optimal path for a packet to traverse across interconnected nodes.

  • Payloads can consist of any digital data format, including plain text, images, digital audio, video, animations, or composite multimedia streams.

• Analogy to Postal Letters:

  • Data packets function identically to conventional postal letters.

  • Delivery Address: Equivalent to the destination IP address.

  • Return Address: Equivalent to the sender or source IP address.

  • Letter Contents: Equivalent to the data payload.

• Three Primary Structural Components of a Packet:

  • Packet Header:

  • Source IP Address: The numerical network address identifying the transmitting device.

  • Destination IP Address: The numerical network address identifying the recipient device.

  • Packet Sequence Number: The specific index of the packet within the overall transmission stream (for example, packet $31$ out of $100$), enabling correct reassembly.

  • Packet Size: The specified total volume of the data chunk being transmitted.

  • Payload:

  • The actual raw data contents being communicated from sender to receiver.

  • Trailer (Footer):

  • Error-Checking Mechanism: Typically incorporates a Cyclic Redundancy Check (CRC) to identify transmission-induced bit changes.

  • End of Packet Notification: An agreed sequence of bits confirming the packet boundary.

• Cyclic Redundancy Check (CRC) Operational Steps:

  • The transmitting computer calculates the mathematical sum of all $1\text{-bits}$ within the payload.

  • This computed value is converted to a hexadecimal representation and appended directly into the packet trailer prior to transmission.

  • Upon arrival, the receiving computer independently recalculates the total count of $1\text{-bits}$ present in the received payload.

  • The receiving terminal compares its derived total with the hexadecimal value embedded in the trailer.

  • If both values match identically, the packet is accepted as intact; if a discrepancy is detected, the packet is rejected and flagged for retransmission.

Packet Switching and Network Routing

• The Process of Packet Switching:

  • Packet switching is a communication method wherein discrete data blocks are transmitted independently across a network mesh containing numerous routing nodes.

  • As a packet journeys from node to node, it is intercepted by a router.

  • The router evaluates the control data stored in the packet header to establish the most suitable forwarding path available at that exact millisecond.

  • Each packet within the same overall message can traverse an entirely distinct physical or logical path across the network.

• Routing Path Determination:

  • Path selection is dynamic and dictated by real-time queue lengths and processing loads at intermediate router nodes.

  • While the shortest available path is consistently chosen, congestion, temporary latency, or damaged transmission lines can divert packets along longer physical routes.

  • Because independent packets travel across divergent paths at variable transmission velocities, they frequently arrive at the receiving terminal out of chronological order.

  • Once the terminal detects the receipt of the final sequence component, the recipient device uses the packet sequence numbers from the headers to reorder the fragmented payload into the original data block.

• Advantages of Packet Switching:

  • High Transmission Rates: Maximizes network bandwidth by allowing multiple conversations to share transmission channels.

  • Shared Infrastructure: Eliminates dedicated lines; no single transmission channel is monopolized by a single user or connection.

  • High Fault Tolerance: Busy, damaged, or unresponsive transmission lines will not halt delivery, as routers dynamically route packets around network faults.

  • Scalable Expansion: Adding new network nodes and routing infrastructure is straightforward and does not require re-engineering existing channels.

• Disadvantages of Packet Switching:

  • Retransmission Latency: Dropped or corrupt packets require individual retransmission requests, which introduces system overhead.

  • Reassembly Delays: Sorting out-of-order packets back into sequence introduces small temporal delays at the destination terminal.

  • Streaming Degradation: The inherent jitter and variable arrival latency make packet switching prone to errors and buffering issues during real-time, live streaming.

• Packet Bouncing and the Hopping Solution:

  • Packets risk entering infinite network loops where routing errors cause them to continuously bounce between routers without reaching the destination.

  • Left unchecked, accumulating lost packets saturate available bandwidth and can grind network throughput to a complete halt.

  • To eliminate this risk, a process known as hopping is enforced.

  • Each packet is assigned a preconfigured maximum hop number (or Time To Live / TTL) inside its header.

  • Every time a packet exits an intermediate router, its hop count is decremented by exactly $1$.

  • If the hop count reaches $0$ before the packet arrives at its destination address, the router currently handling it drops and permanently deletes the packet.

  • The receiving host flags the missing sequence number and initiates a formal request for that specific packet to be resent.

Directional Modes of Data Transmission

• Transmission Agreement Parameters:

  • Successful data communication between digital devices requires mutual agreement across three primary parameters prior to transfer:

  • Direction: Whether data travels unidirectionally, bidirectionally alternating, or bidirectionally simultaneous.

  • Method: The volume of bits transmitted concurrently over the medium.

  • Synchronization: The method used to keep the sender and receiver synchronized in time.

• Simplex Data Transmission:

  • Data is transferred exclusively in one direction (from sender to receiver).

  • There is no capability for the receiving node to send data back along the same communication line.

  • Example: Transmission of data from a personal computer to a standalone printer.

• Half-Duplex Data Transmission:

  • Data moves in both directions, but strictly across alternating periods—never simultaneously.

  • When one terminal transmits, the other terminal must solely act as a receiver until the channel clears.

  • Example: Walkie-talkie radio systems or telephone interactions where parties speak alternately.

  • Analogy: Comparable to a single-lane road passage at a road construction site or a single-track railway, where opposing traffic flows must take turns traversing the shared passage.

• Full-Duplex Data Transmission:

  • Data transfers in both directions simultaneously across the same physical or logical communication channel.

  • Example: A high-speed broadband internet connection operating over optical fiber or telephone cabling, permitting concurrent upstream and downstream data transmission.

Methods of Data Transmission: Serial vs. Parallel

• Serial Data Transmission:

  • Data is transmitted sequentially, one bit at a time, along a single conductive channel or wire.

  • Bits are aligned into a continuous stream, following one after the other.

  • Transmission Range: Highly reliable over long physical distances.

  • Data Transfer Speed: Operates at a slower overall bit rate compared to parallel lines.

  • Synchronization Integrity: Because all bits travel sequentially along a single pathway, bits cannot arrive out of alignment, eliminating skewing entirely.

  • Example: Communication link from a personal computer to a telephone modem, or through Universal Serial Bus (USB) interfaces.

• Parallel Data Transmission:

  • Multiple bits (typically $1\text{ byte}$ or $8\text{ bits}$) are broadcast concurrently across multiple separate wires or physical channels.

  • Each individual wire is dedicated to carrying a specific bit of the byte simultaneously.

  • Transmission Range: Strictly limited to very short physical distances.

  • Data Transfer Speed: Offers much faster data transfer rates compared to serial communication over the same duration.

  • The Problem of Bit Skewing: Over extended cable runs, transmission characteristics across individual wires vary slightly due to minor physical differences. Bits travel at slightly different speeds and arrive out of synchronization (bit skewing), corrupting the byte sequence.

  • Example: Internal ribbon cables connecting a motherboard to an internal disk drive, or legacy parallel cables connecting a computer to a dot-matrix printer.

• Comparison Summary of Serial vs. Parallel Transmission:

  • Transmission Distance: Serial is ideal for long distances; parallel is restricted to short runs.

  • Number of Channels: Serial uses a single wire for data; parallel uses multiple wires ($8$, $16$, $32$, or $64$).

  • Cost: Serial requires fewer wires and connectors (low cost); parallel requires complex, multi-wire cabling (higher cost).

  • Bit Skew Risk: Serial completely avoids bit skewing; parallel suffers from severe bit skewing over longer distances.

  • Crosstalk/Interference: Serial minimizes electromagnetic interference between wires; parallel experiences crosstalk between closely packed adjacent conductors.

• Parallel Transmission in Integrated Circuits:

  • Internal computer hardware architectures demand maximum throughput over minuscule physical distances (measured in millimeters or centimeters).

  • Parallel architecture is standard for internal computer buses connecting the Central Processing Unit (CPU) to Random Access Memory (RAM).

  • Bus architectures utilizing $8\text{-bit}$, $16\text{-bit}$, $32\text{-bit}$, and $64\text{-bit}$ parallel pathways enable massive data throughput rates.

  • High-frequency internal clock signals regulate bus cycles, ensuring synchronous transfers where bit skewing is negligible due to the extremely short path lengths.

Synchronization Methods and the Universal Serial Bus (USB)

• Asynchronous Data Transmission:

  • Data is grouped into discrete, prearranged bit patterns rather than an unbroken continuous stream.

  • Each data group is encapsulated between control bits (specifically, a start bit and one or more stop bits).

  • The control bits signal the receiving device when a byte begins and when it terminates.

  • Without control bits, the receiving hardware cannot distinguish where one byte ends and the subsequent byte begins, leading to severe framing errors.

• Synchronous Data Transmission:

  • Data travels as an unbroken, continuous stream of binary digits accompanied by precise timing pulses.

  • Timing signals are generated by an internal hardware clock to maintain exact temporal synchronization between transmitter and receiver.

  • The receiving terminal counts the incoming bits based on the clock intervals and reassembles them into bytes.

  • Because control bits are eliminated, synchronous transmission achieves significantly higher throughput than asynchronous transmission, making it the preferred method for high-speed local and wide area network links.

• Universal Serial Bus (USB) Specification:

  • An industry-standard interface utilizing asynchronous serial data transmission between computers and peripheral devices.

  • Standard USB cabling consists of a four-wire shielded construction:

  • Two conductors provide electrical power: $V_{\text{bus}}$ ($+5\text{ V}$ power line) and ground ($\text{Earth}$).

  • Two conductors facilitate differential data transmission: Data Plus ($D+$) and Data Minus ($D-$).

• Device Connection and Enumeration Sequence:

  • When a peripheral connects to a host USB port, the computer detects the hardware via a small voltage change on the data signal lines.

  • The host operating system automatically recognizes the device class and loads the appropriate device driver to establish communication.

  • If a matched local driver is not found, the operating system prompts the user to download and install the required device driver software.

• Benefits of the USB Interface:

  • Devices are automatically detected, configured, and initialized upon connection (Plug and Play).

  • Connectors are keyed, making incorrect physical insertion impossible.

  • Recognized as a universal hardware standard, ensuring broad compatibility across manufacturers.

  • Supports multiple transmission speeds ranging from low-bandwidth input devices to high-bandwidth storage.

  • Backwards compatibility is maintained across different USB specification generations.

  • Supplies direct electrical power through the cable, eliminating separate external power supplies for low-power peripherals.

• Drawbacks of the USB Interface:

  • Maximum physical cable run is relatively restricted (typically limited to $< 5\,m$ without active repeaters).

  • Data transmission speed is lower than internal bus architectures (such as PCIe) or specialized networking standards.

  • Legacy USB standards (e.g., USB 1.1 or USB 2.0) offer significantly reduced throughput compared to modern high-speed peripheral interconnects.

Error Detection Techniques: Parity Checks

• Need for Error Detection:

  • During transmission across any medium, electrical noise, physical damage, or electromagnetic interference can corrupt bit states.

  • Data corruption manifests in three ways:

  • Data Loss: Bits are dropped or fail to register at the destination.

  • Data Gain: Spurious noise spikes are incorrectly interpreted as incoming bits.

  • Data Change: An intended $0\text{-bit}$ flips to a $1\text{-bit}$, or a $1\text{-bit}$ flips to a $0\text{-bit}$.

  • Computers cannot determine context or linguistic intent; they cannot distinguish an accidental typo from intentional input without formal mathematical verification systems.

• Single Parity Checks:

  • A single parity bit is allocated to a byte prior to transmission, typically as the most significant bit (MSB).

  • Even Parity: The parity bit is set to $0$ or $1$ to ensure the total number of $1\text{-bits}$ in the byte is an even number.

  • Odd Parity: The parity bit is set to $0$ or $1$ to ensure the total number of $1\text{-bits}$ in the byte is an odd number.

  • Worked Example:

  • Assume a 7-bit data pattern: 1 1 0 1 1 0 0 (contains four $1\text{-bits}$, an even quantity).

  • If configured for even parity, the parity bit must be set to 0, producing: 0 1 1 0 1 1 0 0 (total remains $4$).

  • If configured for odd parity, the parity bit must be set to 1, producing: 1 1 1 0 1 1 0 0 (total becomes $5$, an odd quantity).

  • Severe Limitation of Simple Parity:

  • If an even number of bits flip during transmission (for example, two bits simultaneously invert from 1 to 0 or 0 to 1), the total parity count remains unchanged.

  • The parity check algorithm registers the corrupted byte as valid, allowing errors to bypass detection.

• Parity Blocks (2D Parity Checks):

  • To overcome the limitation of single-bit parity checks, data is transmitted in two-dimensional rectangular blocks.

  • A parity bit is computed horizontally for every individual byte in the block.

  • An additional byte, called the parity byte, is computed vertically down every column of the block and appended to the transmission.

  • Upon arrival, parity checks are executed horizontally across each row and vertically down each column.

  • If a bit inverts, the specific row and the specific column showing parity violations intersect precisely at the corrupted bit.

  • This identifies that an error occurred, pinpoints its exact location, and allows automatic error correction by inverting the corrupted bit without requiring retransmission.

• Handshaking Definition:

  • Handshaking is the preliminary exchange of signals between two devices to establish an agreed communication protocol (such as parity type, baud rate, and duplex mode) before data transfer begins.

Error Detection Techniques: Checksums, Check Digits, and Echo Checks

• The Checksum Algorithm:

  • A mathematical checksum value is calculated from the entire block of data bytes and appended to the end of the block.

  • Assuming a standard $1\text{-byte}$ checksum, the maximum possible representation is $2^8 - 1 = 255$.

  • Algorithm Steps:

  • Calculate the arithmetic sum of all bytes within the block, denoted as $X$.

  • If $X \le 255$, the checksum equals $X$.

  • If $X > 255$, evaluate the checksum using the following steps:

    • Divide the total sum $X$ by $256$.

    • Round the quotient down to the nearest integer to find $Y$.

    • Multiply $Y$ by $256$ to compute $Z = Y \times 256$.

    • Subtract $Z$ from the original sum $X$: $\text{Checksum} = X - Z$.

  • Step-by-Step Worked Example:

  • Suppose the arithmetic sum of a data block is $X = 1185$.

  • Divide by $256$: $\frac{1185}{256} = 4.6289$

  • Round down to find $Y$: $Y = 4$

  • Multiply by $256$: $Z = 4 \times 256 = 1024$

  • Compute the difference: $\text{Checksum} = 1185 - 1024 = 161$

  • Verification:

  • The receiving computer recalculates the checksum from the received data block using the exact same algorithm.

  • The computed value is compared against the transmitted checksum byte.

  • If the values match, the transmission is verified as error-free; if they diverge, the receiver issues a retransmission request.

• Echo Checks:

  • The transmitting computer sends the data to the receiving terminal.

  • Upon arrival, the receiving terminal immediately re-transmits the received data back to the sender.

  • The sender compares the returned echo against the original dataset.

  • Reliability Flaw: If an error is detected, the sender cannot tell whether the corruption occurred during initial transmission to the receiver or during the return journey.

• Check Digits:

  • A check digit is an additional value appended to a numerical sequence (such as a barcode or account number) to verify data entry accuracy.

  • Designed to detect human input errors rather than electronic transmission noise.

  • Three Error Types Detected by Check Digits:

  • Transposition/Inversion Errors: Adjacent digits are swapped (e.g., typing 23459 instead of 23549).

  • Substitution Errors: An incorrect digit is typed (e.g., typing 23559 instead of 23549).

  • Omission/Oversight Errors: A digit is left out entirely (e.g., typing 2359 instead of 23549).

• ISBN-13 Check Digit Calculation:

  • Generates a single final verification digit for a 12-digit base code.

  • Calculation Rules:

  • Sum all digits in odd-numbered positions ($1^{\text{st}}, 3^{\text{rd}}, 5^{\text{th}}, \dots$).

  • Sum all digits in even-numbered positions ($2^{\text{nd}}, 4^{\text{th}}, 6^{\text{th}}, \dots$) and multiply that sum by $3$.

  • Add the odd sum and the scaled even sum together.

  • Divide this combined total by $10$ to determine the remainder.

  • If the remainder is $0$, the check digit is $0$.

  • Otherwise, subtract the remainder from $10$: $\text{Check Digit} = 10 - \text{Remainder}$.

  • Worked Example with ISBN 9 7 8 0 3 4 0 9 8 3 8 2:

  • Sum of odd digits: $9 + 8 + 3 + 0 + 8 + 8 = 36$

  • Sum of even digits multiplied by $3$: $3 \times (7 + 0 + 4 + 9 + 3 + 2) = 3 \times 25 = 75$

  • Combined total: $36 + 75 = 111$

  • Division by $10$: $\frac{111}{10} = 11\text{ with a remainder of } 1$

  • Final subtraction: $10 - 1 = 9$

  • The resulting check digit is $9$, yielding the complete 13-digit code: 9780340983829.

• Modulo 11 Check Digit Calculation:

  • Weights each digit position descending from left to right.

  • Calculation Rules:

  • For a 7-digit base number, assign positional weights: $8, 7, 6, 5, 4, 3, 2$.

  • Multiply each digit by its positional weight and calculate the total sum.

  • Divide the grand total by $11$ to obtain the remainder.

  • Subtract the remainder from $11$ to derive the check digit.

  • If the final value is $10$, the character X is used as the check digit.

  • Worked Example with 7-digit number 4 1 5 6 7 1 0:

  • Assign weights:

    • $4 \times 8 = 32$

    • $1 \times 7 = 7$

    • $5 \times 6 = 30$

    • $6 \times 5 = 30$

    • $7 \times 4 = 28$

    • $1 \times 3 = 3$

    • $0 \times 2 = 0$

  • Calculate sum: $32 + 7 + 30 + 30 + 28 + 3 + 0 = 130$

  • Division by $11$: $\frac{130}{11} = 11\text{ with a remainder of } 9$

  • Final subtraction: $11 - 9 = 2$

  • The resulting check digit is $2$, producing the complete 8-digit number: 41567102.

Automatic Repeat Request (ARQ)

• Core Architecture of ARQ:

  • ARQ combines error detection codes (typically a Cyclic Redundancy Check) with explicit communication acknowledgements and timers.

  • Positive Acknowledgement (ACK): A notification returned by the receiver indicating data arrived intact without detected errors.

  • Negative Acknowledgement (NAK): A notification returned by the receiver indicating data was corrupted during transit, prompting an immediate retransmission.

  • Timeout Interval: A predetermined threshold of elapsed time that the transmitting station waits to receive an acknowledgement.

• Detailed Protocol Operation:

  • The sender transmits a data packet containing a CRC error-detection trailer and simultaneously initializes an internal countdown timer.

  • The receiver evaluates the incoming packet against the CRC code:

  • If no error is identified, the receiver transmits a positive acknowledgement (ACK) back to the sender.

  • If an error is detected, the receiver discards the packet and transmits a negative acknowledgement (NAK).

  • When the sender receives a NAK, it immediately resends the data packet and resets the timer.

  • If network congestion or total packet loss prevents any acknowledgement (neither ACK nor NAK) from reaching the sender before the timeout interval expires, the sender automatically retransmits the packet.

  • This cycle repeats continuously until a positive ACK is successfully received, or until a predefined maximum retry limit is reached.

  • ARQ is widely deployed across cellular mobile phone networks to guarantee end-to-end data integrity over lossy wireless links.

Cryptography: Symmetric and Asymmetric Encryption

• The Purpose of Encryption:

  • Transmitting data across public, shared networks (both wired and wireless) exposes data to unauthorized interception by hackers (eavesdroppers).

  • Encryption transforms source data into an unreadable mathematical representation.

  • While encryption cannot physically prevent unauthorized interception, it ensures intercepted data is unintelligible without the proper decryption key.

  • Plaintext: The original, unencrypted, readable data before it enters an encryption algorithm.

  • Ciphertext: The scrambled, unreadable output produced by passing plaintext through an encryption algorithm using an encryption key.

• Symmetric Key Encryption:

  • Utilizes a single secret key to both encrypt the plaintext and decrypt the ciphertext.

  • Both the sender and the receiver must possess an identical copy of this secret key.

  • The Key Distribution Problem: To enable decryption, the sender must securely transmit the shared key to the receiver. If an eavesdropper intercepts the key during transmission, all encrypted messages can be decrypted.

  • Symmetric Shift Cipher Example:

  • Given a repetitive key sequence: 4 2 9 1 3 6 2 8 5 6

  • Each successive character in the plaintext shifts forward across the alphabet by the corresponding key integer ($+4, +2, +9, +1, \dots$).

  • Encrypting the plaintext string COMPUTER SCIENCE IS EXCITING with this key scrambles the text into meaningless ciphertext, which can only be deciphered by reversing the identical numeric shift.

• Asymmetric Key Encryption:

  • Eliminates the Key Distribution Problem by using an mathematically linked pair of keys:

  • Public Key: Freely distributed and accessible to anyone without secrecy.

  • Private Key: Kept secret and known exclusively to the owner/receiver.

  • Operational Workflow:

  • The process originates with the receiver, who generates a matched key pair (public key and private key).

  • The receiver shares their public key with the sender.

  • The sender encrypts the plaintext using the receiver's public key, producing ciphertext.

  • The sender transmits the ciphertext to the receiver.

  • The receiver decrypts the ciphertext using their private key.

  • Only the receiver's private key can decrypt data encrypted with their public key.

  • The public key can be published openly; third parties can encrypt messages, but cannot decrypt the resulting ciphertext.

  • Requirements for Bidirectional Communication:

  • If two parties require full two-way communication, both must generate their own independent key pairs.

  • Each party exchanges their public key with the other while keeping their private key strictly confidential.

  • Confidentiality Standards:

  • To prevent an adversary from deriving the private key from the public key, the underlying encryption algorithm must be mathematically complex and utilize large key lengths defined by a high number of bits.