Pure Aloha Part-2

Duration: 19 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/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. About Course: About the Course
  2. 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
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. 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, Unix OS, Linux OS
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
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…