Distributed scheduling and dynamic pricing in a communication network
Wireless Networks
Uplink scheduling in CDMA packet-data systems
Wireless Networks
Cooperative caching in mobile ad hoc networks based on data utility
Mobile Information Systems
Distributed scheduling via pricing with partial orthogonality
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia
Adaptive and fuzzy approaches for nodes affinity management in wireless ad-hoc networks
Mobile Information Systems
IEEE Transactions on Information Theory
Convergence of proportional-fair sharing algorithms under general conditions
IEEE Transactions on Wireless Communications
Unified collision-free coordinated distributed scheduling (CF-CDS) in IEEE 802.16 mesh networks
IEEE Transactions on Wireless Communications
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Multiuser scheduling via dynamic optimization
WWIC'10 Proceedings of the 8th international conference on Wired/Wireless Internet Communications
| Hi-index | 0.00 |
This paper studies opportunistic distributed scheduling in an ad hoc wireless network, assuming partial orthogonality among multiple transmitters. The approach is based on game theory. A fair distributed scheduling scheme in a time-correlated channel is defined using a synchronous game for highly orthogonal transmitters and using an asynchronous game based on one-at-a-time transmission otherwise. Distributed game heuristics only require local node level information but still achieve a significant portion (at least 80 % in example cases) of the sum of rates obtained using coalitional uplink proportional fair scheduling for a wide range of orthogonality factors. An asynchronous game based on one-at-a-time transmission performs well relative to PFS for non-orthogonal transmitters. In addition to noncooperative game models, a cooperative game model for threshold-based scheduling is studied.