This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Combinatorial Reverse Auction based Scheduling in Multi-Rate Wireless Systems
October 2007 (vol. 56 no. 10)
pp. 1329-1341
ASCII Text
x 
 
Sourav Pal, Sumantra Kundu, Mainak Chatterjee, Sajal Das, "Combinatorial Reverse Auction based Scheduling in Multi-Rate Wireless Systems," IEEE Transactions on Computers, vol. 56, no. 10, pp. 1329-1341, October, 2007.
 
 
BibTex
x
 
@article{ 10.1109/TC.2007.1082,
author = {Sourav Pal and Sumantra Kundu and Mainak Chatterjee and Sajal Das},
title = {Combinatorial Reverse Auction based Scheduling in Multi-Rate Wireless Systems},
journal ={IEEE Transactions on Computers},
volume = {56},
number = {10},
issn = {0018-9340},
year = {2007},
pages = {1329-1341},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.1082},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Combinatorial Reverse Auction based Scheduling in Multi-Rate Wireless Systems
IS - 10
SN - 0018-9340
SP1329
EP1341
EPD - 1329-1341
A1 - Sourav Pal,
A1 - Sumantra Kundu,
A1 - Mainak Chatterjee,
A1 - Sajal Das,
PY - 2007
KW - Scheduling
KW - multi-rate wireless system
KW - reverse auction
KW - performance optimization
VL - 56
JA - IEEE Transactions on Computers
ER -
 
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.

[1] IS-856 cdma2000 high rate packet data air interface specification, 3GPP2 C.SO024 version 4.0, http:/www.3gpp2.org, Oct. 2002.
[2] P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushayana, and A. Viterbi, “CDMA/HDR: A Bandwidth-Efficient High-Speed Wireless Data Service for Nomadic Users,” IEEE Comm. Magazine, pp. 70-77, July 2000.
[3] General Packet Radio Services (GPRS) service description, 3GPP TS 03.60, http:/www.3gpp.org, 2007.
[4] A. Jalali, R. Padovani, and R. Pankaj, “Data Throughput of CDMA-HDR: A High-Efficiency High Data Rate Personal Communication Wireless System,” Proc. 51st IEEE Vehicular Technology Conf. (VTC '00 Spring), vol. 3, pp. 1854-1858, 2000.
[5] A. Pekec and M.H. Rothkopf, “Combinatorial Auction Design,” Management Science, vol. 49, pp. 1485-1503, 2003.
[6] A. Tarello, E. Modiano, J. Sun, and M. Zafer, “Minimum Energy Transmission Scheduling Subject to Deadline Constraints,” Proc. Third IEEE Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT '05), pp. 67-76, 2005.
[7] F. Fitzek and M. Reisslein, “MPEG-4 and H.263 Video Traces for Network Performance Evaluation,” IEEE Network, vol. 15, no. 6, pp. 40-54, 2001.
[8] H. Lin, M. Chatterjee, S.K. Das, and K. Basu, “ARC: An Integrated Admission and Rate Control Framework for CDMA Data Networks Based on Non-Cooperative Games,” Proc. MobiCom 2003, pp. 326-338, 2003.
[9] H. Lin, M. Chatterjee, S.K. Das, and K. Basu, “ARC: An Integrated Admission and Rate Control Framework for Competitive Wireless CDMA Data Networks Using Non-Cooperative Games,” IEEE Trans. Mobile Computing, vol. 4, no. 3, pp. 243-258, May/June 2005.
[10] Int'l Telecommunication Union, G.114, “One-Way Transmission Time,” May 2000.
[11] J. Hastad, “Clique Is Hard to Approximate within $n^{1-\epsilon}$ ,” Acta Mathemitica, vol. 182, pp. 105-142, 1999.
[12] J. Sun, L. Zheng, and E. Modiano, “Wireless Channel Allocation Using an Auction Algorithm,” Proc. 41st Allerton Conf. Comm., Control, and Computing, vol. 24, pp. 1085-1096, Oct. 2003.
[13] J. Sun, E. Modiano, and L. Zheng, “A Novel Auction Algorithm for Fair Allocation of a Wireless Fading Channel,” Proc. 38th Ann. Conf. Information Sciences and Systems (CISS '04), Mar. 2004.
[14] P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushayana, and A. Viterbi, “CDMA/HDR: A Bandwidth-Efficient High-Speed Wireless Data Service for Nomadic Users,” IEEE Comm. Magazine, pp. 70-77, July 2000.
[15] P. Maille, “Auctioning for Downlink Transmission Power in CDMA Cellular Systems,” Proc. Seventh ACM Int'l Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM '04), pp. 293-296, Oct. 2004.
[16] P. Maille and B. Tuffin, “Multi-Bid Auctions for Bandwidth Allocation in Communication Networks,” Proc. IEEE INFOCOM '04, Mar. 2004.
[17] S.S. Kulkarni and C. Rosenberg, “Opportunistic Scheduling Policies for Wireless Systems with Short-Term Fairness Constraints,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '03), vol. 1, pp. 533-537, Dec. 2003.
[18] S. Pal, M. Chatterjee, and S.K. Das, “User-Satisfaction Based Differentiated Services for Wireless Data Networks,” Proc. IEEE Int'l Conf. Comm. (ICC '05), vol. 2, pp. 1174-1178, May 2005.
[19] T. Sandholm, S. Suri, A. Gilpin, and D. Levine, “Winner Determination in Combinatorial Auction Generalizations,” Proc. First Int'l Joint Conf. Autonomous Agents and Multiagent Systems (AAMAS '02), pp. 69-76, July 2002.
[20] T. Ling and N. Shroff, “Scheduling Real-Time Traffic in ATM Networks,” Proc. IEEE INFOCOM '96, vol. 1, pp. 198-205, 1996.
[21] V. Bharghavan, S. Lu, and T. Nandagopal, “Fair Queuing in Wireless Networks: Issues and Approaches,” IEEE Personal Comm., vol. 6, pp. 44-53, Feb. 1999.
[22] V. Krishna, Auction Theory. Academic Press, 2002.
[23] X. Liu, E.K.P. Chong, and N.B. Shroff, “Transmission Scheduling for Efficient Wireless Utilization,” Proc. IEEE INFOCOM '00, vol. 3, pp. 776-785, 2000.
[24] X. Liu, E.K.P. Chong, and N.B. Shroff, “Optimal Opportunistic Scheduling in Wireless Networks,” Proc. 58th IEEE Vehicular Technology Conf. (VTC '03 Fall), vol. 3, pp. 1417-1421, Oct. 2003.
[25] X. Liu, K.P. Chong, and N.B. Shroff, “Opportunistic Transmission Scheduling with Resource-Sharing Constraints in Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 19, no. 10, pp. 2053-2064, Oct. 2001.
[26] Y. Liu, S. Gruhl, and E. Knightly, “WCFQ: An Opportunistic Wireless Scheduler with Statistical Fairness Bounds,” IEEE Trans. Wireless Comm., vol. 2, pp. 1017-1028, Sept. 2003.
[27] Y. Liu and E. Knightly, “Opportunistic Fair Scheduling over Multiple Wireless Channels,” Proc. IEEE INFOCOM '03, vol. 2, pp.1106-1115, 2003.

Index Terms:
Scheduling, multi-rate wireless system, reverse auction, performance optimization
Citation:
Sourav Pal, Sumantra Kundu, Mainak Chatterjee, Sajal Das, "Combinatorial Reverse Auction based Scheduling in Multi-Rate Wireless Systems," IEEE Transactions on Computers, vol. 56, no. 10, pp. 1329-1341, Oct. 2007, doi:10.1109/TC.2007.1082
Usage of this product signifies your acceptance of the Terms of Use.