05.01.2013 Views

Ad Hoc Networks : Technologies and Protocols - University of ...

Ad Hoc Networks : Technologies and Protocols - University of ...

Ad Hoc Networks : Technologies and Protocols - University of ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Framework <strong>and</strong> Mechanisms for Fair Access in IEEE 802.11 47<br />

Figure 2.11. Network configurations with two competing flows<br />

existence <strong>of</strong> each other‚ the h<strong>and</strong>shake between node 0 <strong>and</strong> node 1 will tend to<br />

dominate the channel‚ because node 3’s transmissions will mostly collide with<br />

either node 0 or node 1’s transmissions at node 2‚ <strong>and</strong> both node 0 <strong>and</strong> node<br />

1 may incorrectly perceive that node 0 <strong>and</strong> node 1 are the only active nodes<br />

in the network. Even though they may receive node 2’s packets sporadically<br />

<strong>and</strong> make some ad hoc adjustment‚ without a systematic way to obtain flow<br />

information‚ the fairness problem cannot be solved conclusively.<br />

The second component <strong>of</strong> our framework is an adaptive back<strong>of</strong>f scheme<br />

which is m<strong>and</strong>atory because the existing binary exponential back<strong>of</strong>f can aggravate<br />

the fairness problem as shown extensively in the literature [1] [14]<br />

[15]. Nodes should decide their channel access based on the information <strong>of</strong><br />

competing flows gathered through the first component.<br />

The third component <strong>of</strong> our framework is a hybrid channel access scheme<br />

that combines both sender-initiated <strong>and</strong> receiver-initiated collision h<strong>and</strong>shake.<br />

This is largely due to the advantage <strong>of</strong> distributing the burden <strong>of</strong> initiating<br />

collision avoidance h<strong>and</strong>shake between a pair <strong>of</strong> sending <strong>and</strong> receiving nodes<br />

depending on the different degrees <strong>of</strong> contention they experience. For example‚<br />

in the network configuration 4-1 shown in Figure 2.11‚ the flow from node 0 to<br />

node 1 will suffer severe throughput degradation if no proper action is taken‚<br />

because RTS from node 2 can always be received by node 3 successfully while<br />

node 0’s RTS collides with node 2’s transmissions at node 1 most <strong>of</strong> the time.<br />

In this case‚ if the collision avoidance is initiated by node 1‚ which transmits<br />

CTS to node 0 directly‚ then the channel b<strong>and</strong>width will be shared between<br />

these two flows more evenly‚ because node 1 <strong>and</strong> node 2 are direct neighbors<br />

<strong>and</strong> it is easier for them to coordinate their access to the channel.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!