1 / 22

Ali Al- Saihati ID# 200350130

King Fahd University of Petroleum & Minerals  Electrical Engineering Department EE 578 Simulation of Wireless Systems Multiple Access Protocols Assignment # 6 . Ali Al- Saihati ID# 200350130. Outline. Introduction. Classification of Multiple Access Protocol. Random Access Protocols.

camila
Download Presentation

Ali Al- Saihati ID# 200350130

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. King Fahd University of Petroleum & Minerals Electrical Engineering DepartmentEE 578 Simulation of Wireless SystemsMultiple Access Protocols Assignment # 6 Ali Al-Saihati ID# 200350130

  2. Outline • Introduction. • Classification of Multiple Access Protocol. • Random Access Protocols. • Packet Communication System.

  3. Introduction • Multiple access protocol. • Efficient use of sources. • Multiplexers are used for users.

  4. Properties • Share common transmission channel. • Perform allocation. • Fairness. • Flexibility. • Stability. • Robust. • Wireless: hidden terminal- near far effect- multipath fading- cochannel interference.

  5. Classification of Multiple Access Protocol

  6. Scheduling • Two types of scheduling: 1) Fixed assignment scheduling: fixed slots for each user. 2) Demand assignment scheduling: active users are only allowed to transmit. • Two approaches of demand assignment scheduling: 1) Centralized control like polling. 2) Decentralized control like token ring.

  7. Contention • Two types: • 1) Repeated random: ALOHA- slotted ALOHA. • 2) Reservation: rALOHA- PRMA.

  8. Random Access Protocols • ISMA: has different types. • Non-persistent. • 1-persistent. • P-persistent.

  9. Packet Communication System

  10. Access terminal: same for all users – has buffer (FIFO)- finite and infinite buffer. • Communication channel: wired (no errors) & wireless (propagation loss- shadowing). • Packet generation: independency- constancy- rareness. • Collision: wired( same power)- wireless ( attenuated power). • Offered traffic: G = T/R • Throughput: S = T x n/R

  11. Characteristics of G, S and D

  12. ALOHA • S = Ge-2G • Max: G= 0.5 , S= 0.184

  13. Slotted ALOHA • S = Ge-G • Max: G= 1 , S= 0.368

  14. Nonpersistence CSMA

  15. Slotted Nonpersistence Slotted ISMA

  16. Thank You

More Related