Distributed scheduling and dynamic pricing in a communication network
Wireless Networks
Uplink scheduling in CDMA packet-data systems
Wireless Networks
A potential game approach to distributed power control and scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Distributed scheduling in a time-varying ad hoc network
Journal of Mobile Multimedia
Multiuser scheduling via dynamic optimization
WWIC'10 Proceedings of the 8th international conference on Wired/Wireless Internet Communications
| Hi-index | 0.00 |
This paper addresses distributed scheduling in a self-organizing wireless network, assuming partial orthogonality of multiple transmitters. Previous work suggests that the optimal scheduling scheme depends on the degree of orthogonality of the interfering users. A fair efficient distributed scheduling scheme can be defined using a synchronous game for highly orthogonal transmitters (with orthogonality factor less than 0.5) and using an asynchronous game based on one-at-a-time transmission for orthogonality factors above 0.5. The distributed game heuristic only requires local node level information but still achieves a sum of rates at least 90 % of that obtained using the better of proportional fair scheduling and simultaneous transmission for a wide range of orthogonality factors. Assuming a slowly varying Rayleigh channel, an asynchronous scheduling game based on one-at-a-time transmission achieves the same sum of rates as proportional fair scheduling but only requires local node-level information.