Simulation of the Slotted Aloha Protocol

Slides:



Advertisements
Similar presentations
Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.
Advertisements

EECC694 - Shaaban #1 lec #5 Spring Data Link In Broadcast Networks: The Media Access Sublayer Broadcast networks with multi-access (or random.
12.1 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Fundamentals of Computer Networks ECE 478/578
5/5/20151 Mobile Ad hoc Networks COE 549 Transmission Scheduling II Tarek Sheltami KFUPM CCSE COE
David Ripplinger, Aradhana Narula-Tam, Katherine Szeto AIAA 2013 August 21, 2013 Scheduling vs Random Access in Frequency Hopped Airborne.
LECTURE 11 CT1303 LAN. DYNAMIC MAC PROTOCOL No fixed assignment for transmission media or any network resources.. It allows transmission when needed.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
12.1 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Communication Networks Lecture 5 NETW 501-L5: NETW 501-L5: Medium Access Control Dr.-Ing. Khaled Shawky Hassan Room: C3-222, ext: 1204,
A New Approach for Accurate Modelling of Medium Access Control (MAC) Protocols Presenter: Moshe Zukerman ARC Centre for Ultra Broadband Information Networks.
Evaluate IEEE e EDCA Performance Tyler Ngo CMPE 257.
CS 5253 Workshop 1 MAC Protocol and Traffic Model.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
Teknik Akses Jaringan Carrier Sense Pertemuan 12 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
7C Cimini-9/97 RANDOM ACCESS TECHNIQUES ALOHA Efficiency Reservation Protocols Voice and Data Techniques - PRMA - Variable rate CDMA.
A combinational media access protocol for multicast traffic in single-hop WDM lans Student : T.H Lin Teacher : H.T Wu Date : 7.28.
7C Cimini-9/97 RANDOM ACCESS TECHNIQUES ALOHA Carrier-Sense Techniques Reservation Protocols PRMA.
Studying Local Area Networks Via Media Access Control (MAC) SubLayer
ECE358: Computer Networks Spring 2012
CS 5253 Workshop 1 MAC Protocol and Traffic Model.
Networks: Local Area Networks1 LANs Studying Local Area Networks Via Media Access Control (MAC) SubLayer.
Shashank Srivastava Motilal Nehru National Institute Of Technology, Allahabad Medium Access Control.
Model and tools. Traffic Model Poisson law – Napoléon worries about the statistics of horse accidents of his generals – Poisson confirms these are unfrequent.
Chap 4 Multiaccess Communication (Part 1)
Multiple Access Protocols Chapter 6 of Hiroshi Harada Book
Wireless Application Protocol
1 SenMetrics’05, San Diego, 07/21/2005 SOSBRA: A MAC-Layer Retransmission Algorithm Designed for the Physical-Layer Characteristics of Clustered Sensor.
2014 YU-ANTL Lab Seminar Performance Analysis of the IEEE Distributed Coordination Function Giuseppe Bianchi April 12, 2014 Yashashree.
McGraw-Hill © The McGraw-Hill Companies, Inc., 2004 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.
LECTURE9 NET301. DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies the absence of other.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
“Local Area Networks” - Gerd Keiser Copyright © The McGraw-Hill Companies srl Local Area Networks Gerd Keiser.
Propagation Delay and Receiver Collision Analysis in WDMA Protocols I.E. Pountourakis, P.A. Baziana and G. Panagiotopoulos School of Electrical and Computer.
Energy-Conserving Access Protocols for Identification Networks By Imrich Chlamtac, Chiara Petrioli, and Jason Redi IEEE/ACM TRANSACTIONS ON NETWORKING,
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs K.Murugan, B.Dushyanth, E.Gunasekaran S.Arivuthokai, RS.Bhuvaneswaran, S.Shanmugavel.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.
جلسه یازدهم شبکه های کامپیوتری به نــــــــــــام خدا.
R ANDOM A CCESS N ETWORKS CSMA F AMILIES 1. References Chapter 9 of the book. Throughput Analysis for Persistent CSMA Systems, HIDEAKI TAKAGI AND LEONARD.
Utility Maximization for Delay Constrained QoS in Wireless I-Hong Hou P.R. Kumar University of Illinois, Urbana-Champaign 1 /23.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Unit-II Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Providing End-to-End Delay Guarantees for Multi-hop Wireless Sensor Networks I-Hong Hou.
Medium Access Control Sub Layer
7-1 Introduction to Queueing Theory l Components of a queueing system n probability density function (pdf) of interarrival times n pdf of service times.
Chapter 6 Multiple Radio Access
X. Li, W. LiuICC May 11, 2003A Joint Layer Design Smart Contention Resolution Random Access Wireless Networks With Unknown Multiple Users: A Joint.
Medium Access Control Protocols, Local Area Networks, and Wireless Local Area Networks Lecture Note 9.
Giuseppe Bianchi Random Access Performance the case of Aloha.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter Four LAN Access Techniques.
STUMP: Exploiting Position Diversity in the Staggered TDMA Underwater MAC Protocol Kurtis Kredo II, Petar Djukic, Prasant Mohapatra IEEE INFOCOM 2009.
An Overview of the Aloha protocols J.-F. Pâris University of Houston.
Turkmen Canli ± and Ashfaq Khokhar* Electrical and Computer Engineering Department ± Computer Science Department* The University of Illinois at Chicago.
ECEN 621, Prof. Xi Zhang ECEN “ Mobile Wireless Networking” Course Materials: Papers, Reference Texts: Bertsekas/Gallager, Stuber, Stallings, etc.
實驗三 媒體存取協定模擬 教師: 助教: 1998/10/19 High Speed Network Lab. Department of Computer Information Science, NCTU.
Performance Improvement in Ad hoc Wireless Networks with Consideration to Packet Duplication Takayuki Yamamoto Department of Informatics and Mathematical.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
Medium Access Control Protocols, Local Area Networks, and Wireless Local Area Networks Lecture Note 10.
Exercises on Data Link Layer.
UNIT 3 MULTIPLE ACCESS Adapted from lecture slides by Behrouz A. Forouzan © The McGraw-Hill Companies, Inc. All rights reserved.
5: DataLink Layer5-1 Slotted ALOHA Assumptions r all frames same size r time is divided into equal size slots, time to transmit 1 frame r nodes start to.
ECEN “Mobile Wireless Networking”
DTMC Applications Ranking Web Pages & Slotted ALOHA
Make Random Access Contentions Transparent by Orthogonal Complementary Codes in Wireless Communications Xiaohua (Edward) Li Department of Electrical and.
Services of DLL Framing Link access Reliable delivery
He Xiaoben Further study of multi-hop communications - modeling the hidden terminal problem He Xiaoben
of the IEEE Distributed Coordination Function
Chapter 6 Multiple Radio Access.
Satellite Packet Communications A UNIT -V Satellite Packet Communications.
Presentation transcript:

Simulation of the Slotted Aloha Protocol Course Project Simulation of the Slotted Aloha Protocol Esa Alghonaim COE543 , 2003-2

Simulation flow. Reference results (The analytical equations & curves). Simulation Results & Graphs. Conclusion

Iteration > Max_Iter Simulation flow. (programmed using Delphi) Start Simulation Slot = 0 , Iteration = 0 , Tot_delay = 0 , Tot_attempts = 0 , Tot_succ = 0 Schedule time Arrival for each terminal Iteration > Max_Iter No inc Iteration Slot = Minimum arrival/retransmit time for terminals. N = Number of terminals that has arrival/retransmit time = Slot Yes G = Tot_attempts / Slot S = Tot_succ / Slot Delay = Tot_Delay Schedule new arrival time for the terminal No Yes N > 1 Successful Slot Collision Slot inc Tot_attempts inc Tot_succ Tot_Delay = Tot_Delay + (Slot-Arrival) Schedule new arrival time for the terminal Tot_attempts = Tot_attempts + N Assign a random Backlog time for the N colliding packets. If first collision for a packet, schedule new arrival time for the terminal. Stop Simulation 4/1 Section

Analytical Results, S vs. G Throughput Offered Load BackLog Constant Probability of successful transmission / new packet Probability of successful transmission / retransmitted packet Average Number of retransmission cycles 4/2 Section

Using the symbolic toolbox in the Matlab to generate Analytical Results, S vs. G Using the symbolic toolbox in the Matlab to generate equations and solve them for different values of G & K. 4/2 Section

r: collision detection slot Analytical Results, Delay vs. S a: normalized delay r: collision detection slot 4/2 Section

Simulation Results, S vs. G Fig.1 Analytical and Simulation results for Throughput (S) vs. Offered Traffic (G). 4/3 Section

Analytical and Simulation results for Delay vs. Offered Traffic. Simulation Results, Delay vs. S Fig.2 Analytical and Simulation results for Delay vs. Offered Traffic. 4/3 Section

Analytical and simulation results are very near to each other Conclusion Analytical and simulation results are very near to each other Both analytical and simulation results indicate that there is an optimum point where the value of the throughput (S) becomes maximum, equal to 0.36 Increasing the offered traffic beyond this value, both Throughput and Delay becomes worse. 4/4 Section