1 / 11

Sidevõrgud IRT 4060/ IRT 0020 vooruloeng 6 / 20. okt 2004

Sidevõrgud IRT 4060/ IRT 0020 vooruloeng 6 / 20. okt 2004. Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst. avo.ots@ttu.ee. Random Access Protocols. When node has packet to send transmit at full channel data rate R. no a priori coordination among nodes

dyani
Download Presentation

Sidevõrgud IRT 4060/ IRT 0020 vooruloeng 6 / 20. okt 2004

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. SidevõrgudIRT 4060/ IRT 0020 vooruloeng 6 / 20. okt 2004 Avo Otstelekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.avo.ots@ttu.ee

  2. Random Access Protocols • When node has packet to send • transmit at full channel data rate R. • no a priori coordination among nodes • two or more transmitting nodes -> “collision”, • random access MAC protocol specifies: • how to detect collisions • how to recover from collisions (e.g., via delayed retransmissions) • Examples of random access MAC protocols: • slotted ALOHA • ALOHA • CSMA, CSMA/CD, CSMA/CA

  3. Summary of MAC protocols • What do you do with a shared media? • Channel Partitioning, by time, frequency or code • Time Division,Code Division, Frequency Division • Random partitioning (dynamic), • ALOHA, S-ALOHA, CSMA, CSMA/CD • carrier sensing: easy in some technologies (wire), hard in others (wireless) • CSMA/CD used in Ethernet • Taking Turns • polling from a central site, token passing

  4. Assumptions all frames same size time is divided into equal size slots, time to transmit 1 frame nodes start to transmit frames only at beginning of slots nodes are synchronized if 2 or more nodes transmit in slot, all nodes detect collision Operation when node obtains fresh frame, it transmits in next slot no collision, node can send new frame in next slot if collision, node retransmits frame in each subsequent slot with prob. p until success Slotted ALOHA

  5. Pros single active node can continuously transmit at full rate of channel highly decentralized: only slots in nodes need to be in sync simple Cons collisions, wasting slots idle slots nodes may be able to detect collision in less than time to transmit packet Slotted ALOHA

  6. Suppose N nodes with many frames to send, each transmits in slot with probability p prob that 1st node has success in a slot = p(1-p)N-1 prob that any node has a success = Np(1-p)N-1 For max efficiency with N nodes, find p* that maximizes Np(1-p)N-1 For many nodes, take limit of Np*(1-p*)N-1 as N goes to infinity, gives 1/e = .37 Slotted Aloha efficiency Efficiency is the long-run fraction of successful slots when there’s many nodes, each with many frames to send At best: channel used for useful transmissions 37% of time!

  7. Throughput 0.368 Slotted Aloha S 0.184 Aloha G

  8. Channel Sharing Techniques Static Channelization Channel Sharing Techniques Scheduling Dynamic Medium Access Control Random Access

  9. Classification of Multiple Access Protocols Multiple access protocols Contention-based Conflict-free Collision resolution Random access TREE, WINDOW, etc ALOHA, CSMA, BTMA, ISMA, etc FDMA, TDMA, CDMA, Token Bus, DQDB, etc BTMA: Busy Tone Multiple Access ISMA: Internet Streaming Media Alliance DQDB: Distributed Queue Dual Bus

  10. RTS/CTS Node A Node B RTS Propagation delay CTS Data ACK

  11. http://www.isi.edu/nsnam/ns/

More Related