MPABMaine Project against Bullying
MPABMichigan Plum Advisory Board
Copyright 1988-2018, All rights reserved.
References in periodicals archive ?
In MPAB algorithm, every node in the network maintains a diagram for the backoff stage transition, as shown in Fig.
In order to avoid the CW oscillations caused by the abrupt change of the node backoff stage, the MPAB algorithm controls that the backoff stages can only transit to the adjacent ones, as shown in Fig.
The backoff stage transition in MPAB algorithm is shown in Fig.
In this section, we will adopt the discrete 2-dimensional Markov chain to model the MPAB algorithm.
In this section, we will show the MPAB performance from the following three aspects.
In this part, we will give the numerical calculations of MPAB algorithm performance, and compare them with the BEB mechanism.
Firstly, we show the analytical results of the MPAB algorithm performance.
6 shows the MPAB algorithm performance under different values of [u.sub.k] and [v.sub.k] when m = 5 and [W.sub.0] = 32.
In this part, we will simulate the MPAB and BEB algorithm in NS-2.32 platform, and compare the results with the above numerical calculations from mathematical models, validating the correctness of the theoretical derivation.
The MAC-layers of the two schemes both adopt the IEEE 802.11 DCF, and the unique difference between both schemes lies in the backoff algorithm, i.e., one scheme adopts the MPAB algorithm, and the other one uses the traditional BEB algorithm.
6.3 Example of the Multi-priority Service Differentiation in MPAB
In the final part, we will give an example of the multi-priority service differentiation in the MPAB algorithm.