A Graph Theory Based Opportunistic Link Scheduling for Wireless Ad Hoc Networks

IEEE Trans. on Wireless Communications, vol. 8, no. 10, oct. 2009
Published Date:2009-10-01
Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condition and thus increase the spectrum utilization efficiency of wireless networks. So far, most proposed opportunistic scheduling policies for ad hoc networks exploit local multiuser diversity, i.e., each transmitter selects its best receiver independently. However, due to co-channel interference, the decisions of neighboring transmitters are highly correlated. Furthermore, the neighboring links without a common sender also experience independent channel fading. Taking the contention relationship and the channel diversity among links into account, we extend the concept of multi-user diversity to a more generalized one, by which a set of senders cooperatively schedule the instantaneously and globally best out-going links, thus the spatial diversity of the channel variation can be further exploited. In this paper, we formulate the opportunistic scheduling problem with fairness requirements into an optimization problem and present its optimal solution, i.e., the optimal scheduling policy. We also propose GOS, a distributed Graph theory based and Opportunistic Scheduling algorithm, which modifies IEEE 802.11 protocol to implement the optimal scheduling policy. Theoretical analysis and simulation results both verify that our implementation achieves higher network throughput and provides better fairness support than the existing algorithms.
Wireless ad hoc networks, multiuser diversity, opportunistic scheduling, proportional fairness, graph theory, maximum we

This entry was posted in Publications and tagged , , , . Bookmark the permalink.

Leave a Reply