Pure Aloha Part-2

Duration: 19 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-7-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 the course: About the Course
  2. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…