Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Exploiting medium access diversity in rate adaptive wireless LANs
Proceedings of the 10th annual international conference on Mobile computing and networking
On the capacity of wireless ad-hoc network basing on graph theory
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Approximation algorithms for the weighted independent set problem
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Queuing with adaptive modulation and coding over wireless links: cross-Layer analysis and design
IEEE Transactions on Wireless Communications
Fair scheduling in mobile ad hoc networks with channel errors
IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
A topology-independent wireless fair queueing model in ad hoc networks
IEEE Journal on Selected Areas in Communications
Cooperative and opportunistic transmission for wireless ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.02 |
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.