Fair Scheduling in Wireless Packet Data Networks

Retransmission Strategies for Cyclic Polling Over Wireless Channels in the Presence of Interference

“…Wireless fair scheduling schemes discussed in [12], [13] exploit the fading nature of the wireless channel to serve different nodes when the channel towards the current node becomes bad (see also [14] for an early facet of this idea). These schemes have some similarities to the queueing-based schemes proposed in this paper, but most of the publications regarding wireless fair queueing concentrate on aggregated throughput (possibly subject to fairness constraints) and do not consider packet deadlines.…”

Batch delivery in wireless sensor networks

“…However, it is wellknown that on fading channels the feedback can be used to avoid transmissions during bad channel states in favor of transmitting over other wireless channels [4]- [6]. The channel feedback is used to compute a packet error rate (PER) for a specific receiver, defined as the fraction of unacknowledged packet slots with respect to the total number of packet slots so far allocated to this receiver.…”

“…This fits very well with MAC protocols like S-MAC [3] where a neighborhood coordinates its wakeup times, exchanges data and goes back to sleep for long time. In some respects the setting assumed in the paper is similar to the one considered in wireless fair scheduling or channel-state dependent scheduling approaches [4]- [6], but instead of maximizing sum throughput subject to short-and long-term fairness constraints, the work presented here focuses on the energy consumption and sleeping activities of the neighbours (including the receivers), and the number of packets that are not successfully delivered to the receivers after exhausting their retransmission budget. We present a protocol framework for batch-delivery, in which different scheduling policies and signaling schemes can be cast.…”

Fair scheduling in wireless ad-hoc networks of location dependent channel errors

“…The studies mentioned above have assumed error free channel. However, in the wireless domain, a packet flow may experience channel errors and hence may not be able to complete transmission [8]. The bursty channel errors and location-dependent channel capacity and errors can render the studies above inapplicable.…”

“…Nandagopal and Gao in [8] developed a generic framework for wireless fair queueing to handle channel errors. They identified the common components of most wireless queueing algorithms.…”