Winner determination in combinatorial auction generalizations
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Proceedings of the 9th annual international conference on Mobile computing and networking
Management Science
Auctioning for downlink transmission power in CDMA cellular systems
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
IEEE Transactions on Mobile Computing
Scheduling real-time traffic in ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
WCFQ: an opportunistic wireless scheduler with statistical fairness bounds
IEEE Transactions on Wireless Communications
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Opportunistic transmission scheduling with resource-sharing constraints in wireless networks
IEEE Journal on Selected Areas in Communications
MPEG-4 and H.263 video traces for network performance evaluation
IEEE Network: The Magazine of Global Internetworking
QoS based scheduling in the downlink of multiuser wireless systems
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
QoS based scheduling in the downlink of multi-user wireless systems (extended)
Computer Communications
An auction-based strategy for distributed task allocation in wireless sensor networks
Computer Communications
Auction-based task allocation with trust management for shared sensor networks
Security and Communication Networks
| Hi-index | 14.98 |
Opportunistic scheduling algorithms are effective in exploiting channel variations and maximizing system throughput in multi-rate wireless networks. However, most scheduling algorithms ignore the per-user quality of service (QoS) requirements and try to allocate resources (e.g., the time slots) among multiple users. This leads to a phenomenon commonly referred to as the exposure problem wherein the algorithms fail to satisfy the minimum slot requirements of the users due to substitutability and complementarity requirements of user slots. To eliminate this exposure problem, we propose a novel scheduling algorithm based on two-phase combinatorial reverse auction with the primary objective to maximize the number of satisfied users in the system. We also consider maximizing the system throughput as a secondary objective. In the proposed scheme, multiple users bid for the required number of time slots, and the allocations are done to satisfy the two objectives in a sequential manner. We provide an approximate solution to the proposed scheduling problem which is NP-complete. The proposed algorithm has an approximation ratio of (1 + logm) with respect to the optimal solution, where m is the number of slots in a schedule cycle. Simulation results are provided to compare the proposed scheduling algorithm with other competitive schemes.