Slotted Aloha

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/WIPRO-PREPARATION/computer-networks/dll-access-control/aloha-protocols/asset-slotted-aloha after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Number System, Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Mixture and Alligation, Data Interpretation, Permutation and Combination, Probability, Logarithm, Powers and Exponents (Surds and Indices), Age Problems, Divisibility Rules, Partnership, HCF LCM, Algebra, Pipe and Cistern
  2. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Analogy, Coding Decoding, Blood Relations, Directions (Direction Test), Syllogisms, Logical Sequence Of Words, Data Sufficiency, Seating Arrangements, Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement
  3. English Language: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Active Passive Voice (Voice), Direct and Indirect Speech, Cloze Test (Cloze Passage), Tenses, Subject Verb Agreement (Verb Noun Agreement), Preposition, Articles, Conjunction, Adverb
  4. Written English Test: English Writing Ability
  5. Coding: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir
  6. Communication Round: Communication Assessment
  7. DBMS (Technical Interview): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Big Data Systems, NoSQL, Data Warehousing & Mining
  8. SQL (Technical Interview): SQL
  9. Operating Systems (Technical Interview): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  10. Computer Networks (Technical Interview): 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, Network Security, Cloud Computing and IoT, Cyber and Info Security
  11. OOPs (Technical Interview): Object Oriented Programming (OOPS)
  12. HR Interview: MR & HR Interview Preparation
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture provides a detailed explanation of the Slotted ALOHA protocol, a medium access control method used in computer networks. The instructor contrasts this with Pure ALOHA to demonstrate how efficiency is improved. The core of the lesson revolves around the concept of "vulnerable time," which is the period during which a transmitted frame can collide with another frame. The instructor uses a slide containing a timeline diagram with four stations (Station 1 through Station 4) and six time slots to visually demonstrate transmission and collision scenarios. He actively writes on the digital whiteboard to derive and display the mathematical formulas associated with the vulnerable time for both protocols.

Chapters

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

    The instructor begins by discussing the inefficiency of Pure ALOHA, noting that a station can send data at any time, which creates a vulnerable period of $2 imes T_{fr}$. He points to the diagram where Station 1 is transmitting a frame in Slot 1. He writes "250" and "3 Duration" near the top left of the diagram, possibly indicating specific time values or frame durations for a hypothetical example. He highlights the grey shaded regions labeled "Collision duration" to show where overlapping transmissions occur. He explains that in Pure ALOHA, a collision can happen if another station starts transmission just before the current one finishes, leading to a longer vulnerable window.

  2. 2:00 – 4:03 02:00-04:03

    The instructor shifts focus to Slotted ALOHA, explaining that time is divided into discrete slots of length $T_{fr}$. He writes the formula $V_T = 2 imes T_{fr}$ for Pure ALOHA and then writes $T_V = T_{fr}$ for Slotted ALOHA, emphasizing the reduction in vulnerable time. He points to the diagram showing Station 2 and Station 3 transmitting in subsequent slots to illustrate how the protocol prevents collisions that would happen in Pure ALOHA. He explains that a collision only occurs if two stations attempt to transmit in the exact same slot, effectively halving the vulnerable period and improving channel utilization.

The lecture successfully connects the theoretical definition of vulnerable time with practical network behavior. By visually mapping out the transmissions of four stations across six time slots, the instructor clarifies how Slotted ALOHA restricts transmission to slot boundaries. The handwritten formulas $V_T = 2 imes T_{fr}$ and $T_V = T_{fr}$ serve as the mathematical proof of the protocol's efficiency. The diagram clearly shows that while Pure ALOHA allows collisions over a wider window, Slotted ALOHA confines potential collisions to the duration of a single frame transmission. This reduction in vulnerable time is the primary advantage of the Slotted ALOHA protocol, making it a more efficient method for shared channel access.

Loading lesson…