1 / 8

A Contender-Aware Backoff Algorithm for CSMA Based MAC Protocol for Wireless Sensor Network

This paper proposes a Contender-Aware Backoff Algorithm designed for CSMA-based MAC protocols in wireless sensor networks. With numerous nodes competing for access points, collision rates increase, necessitating a modification of the access mechanism. Our algorithm leverages non-uniform probability distributions to optimize access probabilities and estimate contender populations, aiming to enhance packet transmission success rates. We also address the crucial optimization of contention window (CW) size to balance latency and success probability. Performance evaluations demonstrate significant improvements in response time and throughput.

norm
Télécharger la présentation

A Contender-Aware Backoff Algorithm for CSMA Based MAC Protocol for Wireless Sensor Network

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. A Contender-Aware Backoff Algorithm for CSMA Based MAC Protocol for Wireless Sensor Network Miraz Al-Mamun, Gour C. Karmakar, and JoarderKamruzzaman Gippsland School Information Technology, Monash University, VIC 3842, Australia E-mail: {miraz.mamun, gour.karmakar, joarder.kamruzzaman}@infotech.monash.edu.au

  2. Why MAC needs to be modified? . Multitudes of wireless nodes need to access the same access points. . Collision increases as a result. . So, contending nodes need to choose access probability following non-uniform probability distribution. . Contenders also need to estimate contender population for optimal access probability

  3. How is the access probability calculated: .Each application requires a corresponding packet transmission success probability. . Based on this, access probability at each Time Slot(TS) in the Contention Window(CW) is calculated. . Each node accesses the medium with this probability.

  4. We need to optimize CW size: . As CW dictates latency, it needs to be optimized as well . Optimization technique has been used to satisfy success probability and latency simultaneously.

  5. Algorithm for calculating the optimal CW size:

  6. Some performance figures: Response Time Comparison for Different Numbers of Reports Required (R).

  7. Some performance figures: Throughput Comparison for N=32.

  8. Thank You All mirazmamun@yahoo.com

More Related