Pure Aloha Part-2

Duration: 19 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-COMPLETE-COURSE/computer-network/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. Section A: General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, History, Geography, Indian Economy, GK- Current Affairs, Evolution of Indian Banking (Banking & Financial Awareness), Environment
  3. Section A: General Intelligence & Reasoning ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analytical Reasoning (Counting Figures Reasoning), Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Directions (Direction Test), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  4. Section A: Arithmetical & Numerical Ability: 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, Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Powers and Exponents (Surds and Indices), Algebra, Probability, Mental Ability, Age Problems, Partnership, Statistics, Arithmetic, Speed Mathematics and Basic Mathematics, Miscellaneous
  5. Section A: English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Articles, Sentence Construction, Preposition, Direct and Indirect Speech, Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Modals, Active Passive Voice (Voice), Sentence Correction (Error Correction), Adverb, Conjunction, Cloze Test (Cloze Passage)
  6. Section A: Hindi Language & Comprehension: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  7. Section B: Programming, Data Structures, OOP & Java: 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, Java, OOPS with C++, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  8. Section B: Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  9. Section B: Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  10. Section B: Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section B: Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  12. Section B: Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  13. Section B: Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  14. Section B: Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  15. Section B: Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  16. Section B: Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  17. Section B: Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  18. Section B: Mathematics: Linear Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  19. Section B: Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  20. Section B: Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  21. DSSSB Previous Year Paper:
  22. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
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…