A strongly fair schedule is one in which tasks that are enabled infinitely often are also executed infinitely often. When tasks execute atomically, a strongly fair scheduler can...
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Abstract—This paper focuses on designing a distributed medium access control algorithm that aims at achieving time fairness among contending stations and throughput maximization ...
Yuan Le, Liran Ma, Wei Cheng, Xiuzhen Cheng, Biao ...
—WiMAX mesh mode, recently standardized, enables direct communications between subscriber stations without referring to the base station (BS). It can be a great solution for prov...