Pure Aloha Part-2

Duration: 19 min

This video lesson is available to enrolled students.

Return to /learn/SSC-JE-IMD-SCIENTIFIC-ASSISTANT-COMPUTER-SCIENCE/computer-networks/dll-access-control/aloha-protocols/asset-pure-aloha-part-2 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. General Intelligence & Reasoning: Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Logical Sequence Of Words, Syllogisms, Venn Diagram, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Data Sufficiency, Puzzle Solving (Puzzles), Data Arrangement, Cubes & Dices, Calendar, Clock, Arithmetic, Number System, HCF LCM, Verbal Analogy (Word Based Analogy), Visual Recognition and Figure Completion, Paper Folding and Cutting, Transformation of Shapes, Clocks and Calendars, Direction Sense, Cubes and Dice, Patterns in Two-Dimensional Figures, Seating Arrangements, Analogy and Classification, Logical Deduction and Induction, Alphabet and Word Tests, Mathematical Operations, Series Completion, Simplification and Approximation, Coding and Decoding, Numerical Reasoning, Assembling and Grouping of Shapes, Three-Dimensional Patterns and Visualization, Vocabulary, Number System, Averages, Mixtures and Alligation, Simple and Compound Interest, Percentages, Algebra, Speed, Time and Distance, Seating and Arrangement Puzzles, Traverse Surveying, Order, Ranking and Sequence, Constraint Puzzles, Syllogisms and Venn Diagrams, Reading Comprehension, Critical Reasoning, Permutations and Combinations, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Ratio and Proportion, Time and Work, Mensuration, Data Interpretation, Powers, Surds and Logarithms, Sequences and Series, Articles and Determiners, Sentence Completion, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Mixture and Alligation, Sequence and Series (Series), Speed Time and Distance, Algebra, Profit and Loss, Powers and Exponents (Surds and Indices), Permutation and Combination
  2. General Awareness: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, Environment, Static General Knowledge, GK- Current Affairs, Artificial Intelligence, MS Office Applications, Terms & Abbreviations, Keyboard Shortcuts, Evolution of Indian Banking (Banking & Financial Awareness), Emerging Tech Trends
  3. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics
  4. Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Number Systems and Codes, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, 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, Latches and Flip-Flops, Finite State Machines, Sequential Circuits and State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Latches and Flip-Flops, Number Systems and Codes, Registers and Counters
  5. Computer Organisation & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Register Transfer and Microoperations, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Registers and Counters
  6. 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, HTML Basics, OOPS with C++, Java, Object Oriented Technology
  7. Databases: 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, Database Recovery, Database Security & Authorization
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. 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, Complexity Theory
  10. 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
  11. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Security, Windows OS, Distributed Systems, Unix OS, Linux OS
  12. Computer Networks: Introduction to CN, 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, Data Communication, Website, Browser & Services, Web Design & Development, Network Security, Cyber Threats and Malware Attacks, Cyber Safety and Security
  13. Full Length Mock Tests:
  14. Sectional Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Pure ALOHA, the earliest random-access protocol developed at the University of Hawaii around 1970 for wireless LANs but applicable to any shared medium. The instructor explains that each station transmits a frame whenever it has one, creating collision risk. A timeline diagram with frames A, B, and C is used to define vulnerable time as 2 x Tf: if station A sends at time t, any frame from B sent between t - Tf and t collides with A's beginning, and frames overlapping the end of A or beginning of subsequent frames also collide. The lecture then presents a flowchart for the Pure ALOHA procedure, defining K (number of attempts), Tp (maximum propagation time), Tf (average transmission time), and Tb (back-off time). The algorithm starts with K = 0, sends the frame, waits a timeout of 2 x Tp, and checks for an ACK. If no ACK is received, K increments, a random number R between 0 and 2^K - 1 is chosen, the station waits Tb = R x Tp or R x Tf, and retries. If K exceeds Kmax (normally 15), the attempt is aborted. Handwritten margin notes illustrate how the random range grows with K: K=1 gives 0-1, K=2 gives 0-3, K=3 gives 0-7.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The lecture opens with a slide titled 'Aloha' stating it is the earliest random-access method, developed at the University of Hawaii around 1970 for a radio (wireless) LAN but usable on any shared medium. The original protocol is called pure ALOHA, described as simple and elegant: each station sends a frame whenever it has one. The instructor begins annotating the slide, drawing a rectangle labeled 'A' with handwritten letters B and C to its right, introducing the collision scenario.

  2. 2:00 – 5:00 02:00-05:00

    The instructor explains vulnerable time using a Time-axis diagram with stacked bars for frames A, B, and C. On-screen text reads 'Vulnerable time = 2 x Tf' with ticks at t - Tf and t + Tf. A bullet states 'Station A sends a frame at time t' and that B's frame sent between t - Tf and t collides with A's beginning. The instructor points to the diagram, drawing arrows inside frame boxes to indicate duration and clarifying collision windows.

  3. 5:00 – 10:00 05:00-10:00

    The timing diagram continues with annotations reading 'A's end collides with B's beginning' and 'B's end collides with C's beginning,' reinforcing that Pure ALOHA vulnerable time equals 2 x Tf. The lecture transitions to a flowchart titled 'Procedure for Pure ALOHA protocol,' defining K (number of attempts), Tp (maximum propagation time), Tf (average transmission time for a frame), and Tb (back-off time). Hand-drawn annotations illustrate transmission time Tf and propagation time Tp alongside the wait timeout period.

  4. 10:00 – 15:00 10:00-15:00

    The full flowchart is shown running from a Start oval through K = 0, Send the frame, Wait time-out time (2 x Tp), an ACK received? diamond, then to Success or back through K = K + 1. The back-off box states 'Wait Tb time (Tb = R x Tp or R x Tf)' and the random box states 'Choose a random number R between 0 and 2^K - 1.' Red pen annotations circle K = 0 and the random-number box, with a note near the K = Kmax diamond stating 'Kmax is normally 15.'

  5. 15:00 – 18:46 15:00-18:46

    The instructor stands before the flowchart slide, with handwritten margin notes tracking K values: K=1 gives 0-1, K=2 gives a red-circled 0-3, K=3 gives 0-7, and K=n gives a range up to 16. Red circles mark margin values such as 10, 5, and 3. The slide reiterates 'ALOHA vulnerable time = 2 x Tf,' connecting the back-off randomization to the earlier collision analysis.

The lecture builds from protocol history to collision mechanics and finally to the retry algorithm. Pure ALOHA's core vulnerability is that a frame sent at time t can collide with any frame transmitted during the preceding Tf (overlapping its start) or following Tf (overlapping its end), yielding a total vulnerable time of 2 x Tf. The flowchart operationalizes this: after each failed attempt, the station increases K, selects a random back-off R in [0, 2^K - 1], waits Tb proportional to Tp or Tf, and retries until success or Kmax (typically 15) is reached. The growing random range with each attempt reduces the probability of repeated collisions among contending stations.

Loading lesson…