Sciweavers

Share
WINET
2010

Flow rank based probabilistic fair scheduling for wireless ad hoc networks

8 years 3 months ago
Flow rank based probabilistic fair scheduling for wireless ad hoc networks
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, ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd
Added 31 Jan 2011
Updated 31 Jan 2011
Type Journal
Year 2010
Where WINET
Authors Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abdul Hamid, Choong Seon Hong
Comments (0)
books