Lecture 6

6,414 views

Published on

mobile communication

Published in: Education
1 Comment
2 Likes
Statistics
Notes
  • I m very much thankful for your great job.
       Reply 
    Are you sure you want to  Yes  No
    Your message goes here
No Downloads
Views
Total views
6,414
On SlideShare
0
From Embeds
0
Number of Embeds
4
Actions
Shares
0
Downloads
254
Comments
1
Likes
2
Embeds 0
No embeds

No notes for slide

Lecture 6

  1. 1. Medium Access Control <ul><li>Can we apply media access methods from fixed networks? </li></ul><ul><li>Example CSMA/CD </li></ul><ul><ul><li>C arrier S ense M ultiple A ccess with C ollision D etection </li></ul></ul><ul><ul><li>send as soon as the medium is free, listen into the medium if a collision occurs (original method in IEEE 802.3) </li></ul></ul><ul><li>Problems in wireless networks </li></ul><ul><ul><li>signal strength decreases proportional to the square of the distance </li></ul></ul><ul><ul><li>the sender would apply CS and CD, but the collisions happen at the receiver </li></ul></ul><ul><ul><li>it might be the case that a sender cannot “hear” the collision, i.e., CD does not work </li></ul></ul><ul><ul><li>furthermore, CS might not work if, e.g., a terminal is “hidden” </li></ul></ul>
  2. 2. Hidden Terminals
  3. 3. Hidden & Exposed Terminals <ul><li>Hidden terminals </li></ul><ul><ul><li>A sends to B, C cannot receive A </li></ul></ul><ul><ul><li>C wants to send to B, C senses a “free” medium (CS fails) </li></ul></ul><ul><ul><li>collision at B, A cannot receive the collision (CD fails) </li></ul></ul><ul><ul><li>A is “hidden” for C </li></ul></ul>
  4. 4. <ul><li>Exposed terminals </li></ul><ul><ul><li>B sends to A, C wants to send to another terminal (not A or B) </li></ul></ul><ul><ul><li>C has to wait, CS signals a medium in use </li></ul></ul><ul><ul><li>but A is outside the radio range of C, therefore waiting is not necessary </li></ul></ul><ul><ul><li>C is “exposed” to B </li></ul></ul>
  5. 5. Near & Far Terminals
  6. 6. Near & Far Terminals <ul><li>Terminals A and B send, C receives </li></ul><ul><ul><li>signal strength decreases proportional to the square of the distance </li></ul></ul><ul><ul><li>the signal of terminal B therefore drowns out A’s signal </li></ul></ul><ul><ul><li>C cannot receive A </li></ul></ul>
  7. 7. Near & Far Terminals If C for example was an arbiter for sending rights, terminal B would drown out terminal A already on the physical layer Also severe problem for CDMA-networks - precise power control needed!
  8. 8. Access methods SDMA/FDMA/TDMA <ul><li>SDMA (Space Division Multiple Access) </li></ul><ul><ul><li>segment space into sectors, use directed antennas </li></ul></ul><ul><ul><li>cell structure </li></ul></ul><ul><li>FDMA (Frequency Division Multiple Access) </li></ul><ul><ul><li>assign a certain frequency to a transmission channel between a sender and a receiver </li></ul></ul><ul><ul><li>permanent (e.g., radio broadcast), slow hopping (e.g., GSM), fast hopping (FHSS, Frequency Hopping Spread Spectrum) </li></ul></ul><ul><li>TDMA (Time Division Multiple Access) </li></ul><ul><ul><li>assign the fixed sending frequency to a transmission channel between a sender and a receiver for a certain amount of time </li></ul></ul>
  9. 9. Fixed FDMA Example GSM f t 124 1 124 1 20 MHz 200 kHz 890.2 MHz 935.2 MHz 915 MHz 960 MHz
  10. 10. TDMA <ul><li>The receiver is tuned to the same frequency all the time </li></ul><ul><li>The receiver listens to many channels separated in time. </li></ul><ul><li>A time slot is allocated to a channel. </li></ul><ul><li>The channel accesses the medium at the designated time </li></ul>
  11. 11. Fixed TDM <ul><li>The Base station assigns the fixed time pattern to all the mobile stations </li></ul><ul><li>The mobiles synchronize to the base station and wait for its turn to access the medium </li></ul>
  12. 12. Fixed Duplex TDMA : Example DECT 1 2 3 11 12 1 2 3 11 12 t downlink uplink 417 µs
  13. 13. Fixed Duplex TDMA <ul><li>The channels is made of 24 time slots </li></ul><ul><li>Uplink – 12 time slots are allocated for the mobiles to access the Base station </li></ul><ul><li>Downlink – 12 time slots are allocated for the base station to access mobiles </li></ul><ul><li>Each connection is allocated its uplink-downlink pair </li></ul><ul><li>The pattern repeats every 10 msec. So, every time slot is for 10msec/24 = 417 μ sec </li></ul>
  14. 14. Fixed Duplex TDMA <ul><li>Merits : </li></ul><ul><li>Every user gets a fixed bandwidth </li></ul><ul><li>Very efficient for constant data rates </li></ul><ul><li>Demerit: </li></ul><ul><li>Not very suitable if the data is bursty </li></ul><ul><li>Some slots may be unused if the user does not transmit data in a time slot. </li></ul>
  15. 15. Classical Aloha <ul><li>TDM is applied without any access control </li></ul><ul><li>Aloha does not coordinate the medium </li></ul><ul><li>It does not resolve contention on MAC layer </li></ul>
  16. 16. Classical Aloha sender A sender B sender C collision t
  17. 17. Classical Aloha <ul><li>Users access the medium in a random fashion </li></ul><ul><li>If there is a collision, the MAC protocol does not resolve </li></ul><ul><li>It is for the higher layers to resolve </li></ul><ul><li>Throughput is only 18%. </li></ul><ul><li>Useful only for light loads </li></ul>
  18. 18. Slotted Aloha sender A sender B sender C collision t
  19. 19. Slotted Aloha <ul><li>The time for medium access is divided into slots </li></ul><ul><li>There is no coordination of users to access the medium </li></ul><ul><li>Users can access the medium only at the beginning of the time slots </li></ul><ul><li>Time synchronization is very important </li></ul><ul><li>The throughput is now 36% with the introduction of slots </li></ul><ul><li>UMTS uses this slotted Aloha MAC. </li></ul>
  20. 20. Carrier Sense Multiple Access (CSMA) Sender MEDIUM FOR TRANSMISSION Check if carrier is free Wait for a set duration
  21. 21. CSMA <ul><li>Since the medium is accessed to check if it is idle and then the transmission is initiated, probability of collision is reduced. </li></ul><ul><li>This scheme can not still solve the Hidden Terminal problem. </li></ul><ul><li>A variant : station tries for a slot with probability p. If not successful, it moves on to the next slot </li></ul>
  22. 22. Demand Assigned Multiple Access with Reservation <ul><li>Contention Phase : </li></ul><ul><li>Fixed Aloha slots (very short duration slots) are used reserve future slots </li></ul><ul><li>The satellite for example, sends a list of approved users and the slots. </li></ul><ul><li>The users have to perfectly synchronize and use the medium exactly as per the approved list. </li></ul>
  23. 23. Demand Assigned Multiple Access with Reservation Aloha reserved Aloha reserved Aloha reserved Aloha collision t <ul><ul><li>two modes: </li></ul></ul><ul><ul><ul><li>ALOHA mode for reservation: competition for small reservation slots, collisions possible </li></ul></ul></ul><ul><ul><ul><li>reserved mode for data transmission within successful reserved slots (no collisions possible) </li></ul></ul></ul>
  24. 24. Demand Assigned Multiple Access with Reservation <ul><ul><li>it is important for all stations to keep the reservation list consistent at any point in time and, therefore, all stations have to synchronize from time to time </li></ul></ul>
  25. 25. Implicit reservation (PRMA - Packet Reservation MA): <ul><li>Implicit reservation (PRMA - Packet Reservation MA): </li></ul><ul><ul><li>a certain number of slots form a frame, frames are repeated </li></ul></ul><ul><ul><li>stations compete for empty slots according to the slotted aloha principle </li></ul></ul><ul><ul><li>once a station reserves a slot successfully, this slot is automatically assigned to this station in all following frames as long as the station has data to send </li></ul></ul><ul><ul><li>competition for this slots starts again as soon as the slot was empty in the last frame </li></ul></ul>
  26. 26. Implicit reservation (PRMA - Packet Reservation MA): frame 1 frame 2 frame 3 frame 4 frame 5 1 2 3 4 5 6 7 8 time-slot collision at reservation attempts A C D A B A F A C A B A A B A F A B A F D A C E E B A F D t ACDABA-F ACDABA-F AC-ABAF- A---BAFD ACEEBAFD
  27. 27. PRMA - Packet Reservation MA <ul><li>A Base station (for ex., a satellite) broadcasts the status of slots (for example, ACDABA-F) to all mobiles. </li></ul><ul><li>The mobiles know which all slots are allocated to them in this frame. </li></ul><ul><li>All stations needing a slot will contend for the free slot (Slot F in this case). </li></ul><ul><li>There is a collision here since more than one mobile is trying for the free slot F. </li></ul><ul><li>Slot F is not allocated since there is a collision. In the next frame, stations can compete for this and any released slots. </li></ul>
  28. 28. Reservation TDMA <ul><li>Reservation Time Division Multiple Access </li></ul><ul><ul><li>every frame consists of N mini-slots and x data-slots </li></ul></ul><ul><ul><li>every station has its own mini-slot and can reserve up to k data-slots using this mini-slot (i.e. x = N * k). </li></ul></ul><ul><ul><li>other stations can send data in unused data-slots according to a round-robin sending scheme (best-effort traffic) </li></ul></ul>N mini-slots N * k data-slots reservations for data-slots other stations can use free data-slots based on a round-robin scheme e.g. N=6, k=2
  29. 29. MACA : Multiple Access with Collision Avoidance <ul><li>MACA (Multiple Access with Collision Avoidance) uses short signaling packets for collision avoidance </li></ul><ul><ul><li>RTS (request to send): a sender request the right to send from a receiver with a short RTS packet before it sends a data packet </li></ul></ul><ul><ul><li>CTS (clear to send): the receiver grants the right to send as soon as it is ready to receive </li></ul></ul><ul><li>Signaling packets (RTS and CTS) contain </li></ul><ul><ul><li>sender address </li></ul></ul><ul><ul><li>receiver address </li></ul></ul><ul><ul><li>packet size </li></ul></ul>
  30. 30. MACA : Multiple Access with Collision Avoidance B RTS CTS CTS B RTS CTS RTS <ul><li>MACA avoids the problem of hidden terminals </li></ul><ul><ul><li>A and C want to send to B </li></ul></ul><ul><ul><li>A sends RTS first </li></ul></ul><ul><ul><li>C waits after receiving CTS from B </li></ul></ul><ul><li>MACA avoids the problem of exposed terminals </li></ul><ul><ul><li>B wants to send to A, C to another terminal </li></ul></ul><ul><ul><li>now C does not have to wait for it cannot receive CTS from A </li></ul></ul>A C A C
  31. 31. MACA –State Diagram idle wait for the right to send wait for ACK sender receiver packet ready to send; RTS time-out; RTS CTS; data ACK RxBusy idle wait for data RTS; RxBusy RTS; CTS data; ACK time-out  data; NAK ACK: positive acknowledgement NAK: negative acknowledgement RxBusy: receiver busy time-out  NAK; RTS
  32. 32. Polling Mechanisms <ul><li>If one terminal can be heard by all others, this “central” terminal (a.k.a. base station) can poll all other terminals according to a certain scheme </li></ul><ul><ul><li>now all schemes known from fixed networks can be used (typical mainframe - terminal scenario) </li></ul></ul><ul><li>Example: Randomly Addressed Polling </li></ul><ul><ul><li>base station signals readiness to all mobile terminals </li></ul></ul><ul><ul><li>terminals ready to send can now transmit a random number without collision with the help of CDMA or FDMA (the random number can be seen as dynamic address) </li></ul></ul><ul><ul><li>the base station now chooses one address for polling from the list of all random numbers (collision if two terminals choose the same address) </li></ul></ul><ul><ul><li>the base station acknowledges correct packets and continues polling the next terminal </li></ul></ul><ul><ul><li>this cycle starts again after polling all terminals of the list </li></ul></ul>
  33. 33. ISMA (Inhibit Sense Multiple Access) <ul><li>Current state of the medium is signaled via a “busy tone” </li></ul><ul><ul><li>the base station signals on the downlink (base station to terminals) if the medium is free or not </li></ul></ul><ul><ul><li>terminals must not send if the medium is busy </li></ul></ul><ul><ul><li>terminals can access the medium as soon as the busy tone stops </li></ul></ul><ul><ul><li>the base station signals collisions and successful transmissions via the busy tone and acknowledgements, respectively (media access is not coordinated within this approach) </li></ul></ul><ul><ul><li>mechanism used, e.g., for CDPD (USA, integrated into AMPS) </li></ul></ul>

×