Inter-cell scheduling in wireless data networks

Over the past few years, the design and performance of channel-aware scheduling strategies have attracted huge interest. In the present paper we examine a different notion of scheduling, namely coordination of transmissions among base stations, which has received little attention so far. The inter-cell coordination comprises two key elements: (i) interference avoidance; and (ii) load balancing. The interference avoidance involves coordinating the activity phases of interfering base stations so as to increase transmission rates. The load balancing aims at diverting traffic from heavily-loaded cells to lightly-loaded cells. We consider a dynamic scenario where users come and go over time as governed by the arrival and completion of random data transfers, and evaluate the potential capacity gains from inter-cell coordination in terms of the maximum amount of traffic that can be supported for a given spatial traffic pattern. Numerical experiments demonstrate that inter-cell scheduling may provide significant capacity gains, the relative contribution from interference avoidance vs. load balancing depending on the configuration and the degree of load imbalance in the network.

[1]  Matthew S. Grob,et al.  CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users , 2000, IEEE Commun. Mag..

[2]  Nabil Kahale,et al.  Dynamic global packet routing in wireless networks , 1997, Proceedings of INFOCOM '97.

[3]  Richard J. La,et al.  Class and channel condition based weighted proportional fair scheduler , 2001 .

[4]  Sem C. Borst,et al.  Dynamic rate control algorithms for HDR throughput optimization , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[6]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[7]  Sem C. Borst,et al.  Wireless data performance in multi-cell scenarios , 2004, SIGMETRICS '04/Performance '04.

[8]  Sarvar Patel,et al.  Downlink scheduling in CDMA data networks , 2000, MobiCom '00.

[9]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[10]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[11]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[12]  G. Michailidis,et al.  Queueing and scheduling in random environments , 2004, Advances in Applied Probability.

[13]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[14]  Alexandre Proutière,et al.  Insensitive load balancing , 2004, SIGMETRICS '04/Performance '04.

[15]  Alexander L. Stolyar,et al.  On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation , 2005, Oper. Res..

[16]  Leandros Tassiulas,et al.  Exploiting wireless channel State information for throughput maximization , 2004, IEEE Transactions on Information Theory.

[17]  A. Jalali,et al.  Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[18]  Alexandre Proutière,et al.  Wireless downlink data channels: user performance and cell dimensioning , 2003, MobiCom '03.

[19]  Sem C. Borst.  User-level performance of channel-aware scheduling algorithms in wireless data networks , 2005, IEEE/ACM Transactions on Networking.

[20]  Alexander L. Stolyar,et al.  Scheduling algorithms for a mixture of real-time and non-real-time data in HDR , 2001 .

[21]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[22]  Jack M. Holtzman,et al.  A scheme for throughput maximization in a dual-class CDMA system , 1998, IEEE J. Sel. Areas Commun..

[23]  Onno Boxma,et al.  Boundary value problems in queueing system analysis , 1983 .

[24]  Sem C. Borst,et al.  How mobility impacts the flow-level performance of wireless data systems , 2004, IEEE INFOCOM 2004.

[25]  Heng-Qing Ye,et al.  Stability of data networks under an optimization-based bandwidth allocation , 2003, IEEE Trans. Autom. Control..

[26]  Mor Armony,et al.  Queueing networks with interacting service resources , 1999 .

[27]  Seeram Ramakrishna.  Optimal Scheduling of CDMA Systems , 1996 .

[28]  Ness B. Shroff,et al.  A framework for opportunistic scheduling in wireless networks , 2003, Comput. Networks.

[29]  Harish Viswanathan,et al.  Dynamic load balancing through coordinated scheduling in packet data systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).