Abstract
One of the problems in wireless mesh networks includes the HOL (Head of Line) blocking at relay nodes. To overcome that problem, packet scheduling schemes using the MRTS (Multicast RTS) frame, an extension of the RTS frame, have been proposed. The sender first multicasts an MRTS frame to multiple receiver candidates. Then the sender transmits the data packet to the candidate which earliest returns a CTS frame. That mechanism could solve the HOL blocking. In principle, as the number of receiver candidates increases, the transmission successful rate increases, however the overhead also increases. Under the existing scheduling schemes, the sender always arranges more than two candidates. That would increase the overhead. In this paper, to reduce the overhead, we propose a scheduling scheme which restricts the number of candidates is up to two in any time. Via simulation, in comparison with the existing scheme, our scheme provides higher throughput and fairness.
