Stop and Wait Protocol - ARQ
Duration: 13 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Access Technologies, Network Security
- Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
- Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Paper-2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
- Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
- Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
- Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
- Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
- Coal India Previous Year Paper:
- Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
- Coal India Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces error control for data communication over noisy channels, focusing on the Stop-and-Wait Automatic Repeat Request (ARQ) protocol. It begins by contrasting ideal noiseless channels with real-world noisy ones, stating that errors must either be ignored or handled by adding error control. The core of the lesson is a detailed walkthrough of Stop-and-Wait ARQ, which adds a simple error control mechanism to the basic Stop-and-Wait Protocol. A recurring sequence diagram illustrates how Sender A and Receiver B exchange frames: Frame 0 is sent, ACK 1 is received, then Frame 1 is lost or corrupted. The receiver silently discards the corrupted frame, and its silence triggers a timeout at the sender, which resends Frame 1. The lecture emphasizes that lost frames are more difficult to handle than corrupted ones and introduces frame numbering as the solution to detect duplicates. The final segment reinforces how sequence numbers allow the receiver to identify and discard duplicate frames, ensuring reliable delivery despite channel errors.
Chapters
0:00 – 2:00 00:00-02:00
The lecture opens with a slide titled 'NOISY CHANNELS,' explaining that while the Stop-and-Wait Protocol provides flow control, real-world channels are not noiseless. The instructor states that errors must either be ignored or handled by adding error control to the protocols, noting that three such protocols will be discussed. The slide transitions at 85s to a circled heading 'Stop-and-Wait Automatic Repeat Request,' introducing the first protocol. A timing diagram on the right shows Sender A and Receiver B exchanging Frame 0, ACK 1, a lost Frame 1, time-out restarts, and resent frames.
2:00 – 5:00 02:00-05:00
The presenter explains the Stop-and-Wait ARQ protocol, with the title circled in red. Left-column text states that a corrupted frame 'is silently discarded' and that error detection is manifested by the silence of the receiver. The right-side sequence diagram shows Sender A and Receiver B exchanging 'Frame 0,' 'ACK 1,' and 'Frame 1,' with a starburst marked 'Lost' and a 'Time-out restart' leading to 'Frame 1 (resent).' The instructor points to the diagram, emphasizing that when a frame arrives at the receiver site, it is checked and if corrupted, it is silently discarded. The solution to handle these errors is introduced as numbering the frames.
5:00 – 10:00 05:00-10:00
The lecture details how Stop-and-Wait ARQ adds a simple error control mechanism to the Stop-and-Wait Protocol. The timing diagram shows Sender A and Receiver B exchanging 'Frame 0,' 'ACK 1,' a crossed-out 'Frame 1 (Lost),' 'Frame 1 (resent),' 'ACK 0,' and a final 'Discard duplicate' note. The instructor uses a pen to draw a curved arrow near the top of the diagram and later a red rectangle around the receiver's region, marking the lost/corrupted frame path. Text explains that lost frames are more difficult to handle than corrupted ones, and the solution is to number the frames. The presenter re-enters pointing toward the diagram's middle section as he explains the duplicate detection process.
10:00 – 12:50 10:00-12:50
The final segment reinforces the Stop-and-Wait ARQ protocol with a vertical timing diagram labeled Sender A and Receiver B. The diagram traces 'Frame 0,' 'ACK 1,' a lost 'Frame 1,' a 'Time-out' and 'Frame 1 (resent),' plus annotations such as 'Lost' and 'Discard, duplicate.' Left-side text reads: 'When the frame arrives at the receiver site, it is checked and if it is corrupted, it is silently discarded.' A hand holding a marker points into the upper diagram area near the Frame 0 / ACK row. The lecture concludes by illustrating how sequence numbers allow the receiver to identify and discard duplicate frames, ensuring reliable delivery despite channel errors.
The lecture systematically builds understanding of error control in data communication, starting from the fundamental problem of noisy channels and culminating in a detailed protocol specification. The central idea is that Stop-and-Wait ARQ enhances the basic Stop-and-Wait Protocol by adding error detection and recovery mechanisms. Key concepts include silent discarding of corrupted frames, timeout-based retransmission, and frame numbering for duplicate detection. The recurring sequence diagram serves as the primary visual aid, illustrating the sender-receiver interaction step-by-step. The teaching flow moves from problem identification (noisy channels) to solution introduction (ARQ protocol), then to detailed mechanism explanation (timeout, retransmission, numbering), and finally to edge case handling (lost frames, duplicates). This progression ensures students understand both the 'why' and 'how' of error control in reliable data transmission.

