1 / 13

Slotted Nonpersistent CSMA

Slotted Nonpersistent CSMA. Timeline divided into time slots, called mini slot, with length equal to maximum propagation delay t.

huey
Download Presentation

Slotted Nonpersistent CSMA

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. Slotted Nonpersistent CSMA • Timeline divided into time slots, called mini slot, with length equal to maximum propagation delay t. • Before attempting transmission, the user waits for the beginning of the next slot, and senses whether the channel is idle. If idle, he sends the packet for T time slots. • If the channel is busy, the packet is rescheduled to some randomly chosen time in the future.

  2. Throughput analysis • Idle period = 1 => arrival in first idle slot • Idle period = 2 => no arrival in first and arrival in second …

  3. Idle period • Following the above reasoning we get: • Giving us:

  4. Busy Period • Both successful and unsuccessful transmissions last T+t • A busy period will contain k transmission periods if there is at least one arrival in the last mini-slot of each of the first k-1 transmission periods, and no arrival in the last mini-slot of the kth transmission period: • And:

  5. Useful time • During the busy period, the number of transmission periods is: • When a transmission period is useful it carries information for T seconds • The useful part of the busy-idle cycle is then: Where Psuc denotes the success probability

  6. Success probability • We divide by the probability of “some arrivals” because we know there was at least one arrival, since a transmission period has been initiated

  7. Throughput

  8. BTP collision resolution • Given a MA channel with Trenary Feedback running BTP for collision resolution. • A node perform the following algorithm upon waking up: • If collision, wait for resolution and then transmit • Otherwise (if quiet or success), broadcast in the next time slot. • At time t, n nodes collided. At time T>t a new node woke up wishing to send a packet. Which of the following is true? • The node will transmit successfully only after all n nodes have successfully transmitted • The node will transmit during the collision resolution, and the result will be as if the node had collided with the n nodes in the first place • Either 1. or 2. depending on the place in the of the slot in the virtual tree • Either 1. or 2. according to the type of slot the node sensed • All the above answers are wrong

  9. Analysis

  10. BTP in a noisy channel • Consider a MA channel where BTP is applied and noise is present. The impact of noise is that there is a probability p1 that a slot which contains a single transmission is interpreted as a collision. • How will the CRIs (Collision Resolution Intervals) change?

  11. נפתור • How will the optimal probability p change:

More Related