Download presentation

Presentation is loading. Please wait.

Published byAlysa Musslewhite Modified over 2 years ago

1
Miraz Al-Mamun, Gour C. Karmakar, and Joarder Kamruzzaman Gippsland School Information Technology, Monash University, VIC 3842, Australia E-mail: {miraz.mamun, gour.karmakar, joarder.kamruzzaman}@infotech.monash.edu.au

2
. 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
.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
. As CW dictates latency, it needs to be optimized as well. Optimization technique has been used to satisfy success probability and latency simultaneously.

5
Requires: N= initially estimated contender number K= CW size α= Common ratio of geometric function Define: variable i, array N i For (i=1; i

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

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

8
mirazmamun@yahoo.com

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google