Pure Aloha Part-2

Duration: 19 min

This video lesson is available to enrolled students.

Return to /learn/UP-LT-GRADE-ASSISTANT-TEACHER-2025/cs-08-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. CS | 01 | Digital Logic and Circuits and Discrete Mathematical Structures: Digital Systems & Boolean Basics, Number System, Number Representation, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Permutation and Combination / क्रमचय और संचय
  3. CS | 02 | Computer Organization and Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Multiprocessors
  4. CS | 03 | Data Structures and Algorithm: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Complexity Theory, Advanced Algorithms
  5. CS | 04 | Problem Solving through C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. CS | 05 | Object Oriented Techniques: Object Oriented Technology, Java
  7. CS | 06 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Unix OS
  8. CS | 07 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Query Processing & Optimization, File Organization & Indexing
  9. CS | 08 | 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
  10. CS | 09 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. CS | 10 | Internet Technology, Web Design and Web Technology: Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, JavaScript-Basics, HTML Basics
  12. CS | 11 | System Analysis And Design: Fundamentals of Systems and Information Systems, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance
  13. CS | 12 | Information Security and Cyber Laws: Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security
  14. CS | 13 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  15. GS Paper | 01 | Indian and World Geography / भारत एवं विश्व का भूगोल: Geography / भूगोल
  16. GS Paper | 02 | History / इतिहास: History / इतिहास
  17. GS Paper | 03 | Indian Economy & Social Development / भारतीय अर्थव्यवस्था एवं सामाजिक विकास: Indian Economy / भारतीय अर्थव्यवस्था
  18. GS Paper | 04 | General Science / सामान्य विज्ञान: Biology / जीव विज्ञान, Chemistry / रसायन विज्ञान, Scientific Achievements and Research / वैज्ञानिक उपलब्धियाँ और अनुसंधान
  19. GS Paper | 05 | Elementary Maths / प्रारंभिक गणित: Number System / संख्या पद्धति, Divisibility Rules / विभाज्यता के नियम, HCF and LCM / महत्तम समापवर्तक और लघुत्तम समापवर्त्य, Percentage / प्रतिशत, Profit, Loss and Discount / लाभ, हानि और बट्टा, Simple and Compound Interest / साधारण और चक्रवृद्धि ब्याज, Ratio and Proportion / अनुपात और समानुपात, Average / औसत, Time and Work / समय और कार्य, Time, Speed and Distance / समय, चाल और दूरी, Algebra / बीजगणित, Solid Mensuration / घन क्षेत्रमिति, Data Interpretation / आँकड़ा निर्वचन, Arithmetic / अंकगणित, Statistics / सांख्यिकी, Probability / प्रायिकता, Sequences, Series and Combinatorics / अनुक्रम, श्रेणी और संयोजन, Mixture and Alligation / मिश्रण और एलिगेशन, Calculus / कलन, Trigonometry / त्रिकोणमिति, Vectors / सदिश, Number Systems and Number Theory / संख्या पद्धति और संख्या सिद्धांत, Euclidean Geometry and Mensuration / यूक्लिडीय ज्यामिति और क्षेत्रमिति, Statistics and Probability / सांख्यिकी और प्रायिकता, Coordinate Geometry, Vectors and 3D Geometry / निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति, Polynomials, Equations and Complex Numbers / बहुपद, समीकरण और सम्मिश्र संख्याएँ, Plane Mensuration / समतल क्षेत्रमिति, Simplification, Indices and Surds / सरलीकरण, घातांक और करणी, Sets, Relations, Functions and Discrete Mathematics / समुच्चय, संबंध, फलन और विविक्त गणित
  20. GS Paper | 06 | Indian Polity and Governance / भारतीय राजव्यवस्था एवं शासन: Polity / राजव्यवस्था
  21. GS Paper | 07 | Current Events / समसामयिक घटनाएँ: Current Affairs / समसामयिकी
  22. UPLT Live Classes Notes: UPLT Live Classes
  23. UPLT Full Mock Tests Tier 1:
  24. UPLT Full Mock Tests Tier 2:
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…