Flow rank based probabilistic fair scheduling for wireless ad hoc networks |
| |
Authors: | Md Mamun-Or-Rashid Muhammad Mahbub Alam Md Abdul Hamid Choong Seon Hong |
| |
Affiliation: | (1) Networking Lab, Kyung Hee University, Seocheon, Giheung, Yongin, Geyonggi, 446-701, Korea |
| |
Abstract: | Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows
in a network. It is particularly challenging for ad hoc networks due to infrastructure free operation and location dependent
contentions. As there is no entity to serve coordination among nodes, we need a mechanism to overcome inherent unreliability
of the network to provide reduced collision and thereby higher throughput and adequate fair allocation of the shared medium
among different contending flows. This paper proposes a flow rank based probabilistic fair scheduling technique. The main
focus is to reduce the collision probability among the contending flows while maintaining the prioritized medium access for
those flows, which ensures a weighted medium access control mechanism based on probabilistic round robin scheduling. Each
flow maintains a flow-table upon which the rank is calculated and backoff value is assigned according to the rank of the flow, i.e., lower backoff interval
to lower ranked flow. However, flow-table instability due to joining of a new flow, partially backlogged flow, hidden terminal and partially overlapped region exhibits
a challenging problem that needs to be mitigated for our mechanism to work properly. We take appropriate measures to make
the flow-table stabilized under such scenarios. Results show that our mechanism achieves better throughput and fairness compared to IEEE
802.11 MAC and existing ones. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|