Dynamic power allocation and routing for time-varying wireless networks

We consider dynamic routing and power allocation for a wireless network with time-varying channels. The network consists of power constrained nodes that transmit over wireless links with adaptive transmission rates. Packets randomly enter the system at each node and wait in output queues to be transmitted through the network to their destinations. We establish the capacity region of all rate matrices (/spl lambda//sub ij/) that the system can stably support-where /spl lambda//sub ij/ represents the rate of traffic originating at node i and destined for node j. A joint routing and power allocation policy is developed that stabilizes the system and provides bounded average delay guarantees whenever the input rates are within this capacity region. Such performance holds for general arrival and channel state processes, even if these processes are unknown to the network controller. We then apply this control algorithm to an ad hoc wireless network, where channel variations are due to user mobility. Centralized and decentralized implementations are compared, and the stability region of the decentralized algorithm is shown to contain that of the mobile relay strategy developed by Grossglauser and Tse (2002).

[1]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Stavros Toumpis,et al.  Some Capacity Results for Ad Hoc Networks , 2000 .

[3]  Elif Uysal-Biyikoglu,et al.  Energy-efficient transmission over a wireless link via lazy packet scheduling , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Andrea J. Goldsmith,et al.  Capacity and optimal resource allocation for fading broadcast channels - Part I: Ergodic capacity , 2001, IEEE Trans. Inf. Theory.

[5]  Peter Marbach,et al.  Priority service and max-min fairness , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Peter Marbach,et al.  Downlink resource allocation and pricing for wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Jean-Yves Le Boudec,et al.  Joint Scheduling, Power Control and Routing in Symmetric, One-dimensional, Multi-hop Wireless Networks , 2002 .

[8]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[9]  MarbachPeter.  Priority service and max-min fairness , 2003 .

[10]  Vincent W. S. Chan,et al.  Predicting and adapting satellite channels with weather-induced impairments , 2002 .

[11]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[12]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation for wireless networks , 2001 .

[13]  Sean P. Meyn,et al.  Stability of queueing networks and scheduling policies , 1995, IEEE Trans. Autom. Control..

[14]  Edmund M. Yeh,et al.  Throughput and delay optimal resource allocation in multiaccess fading channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[15]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[17]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[18]  David Tse,et al.  Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities , 1998, IEEE Trans. Inf. Theory.

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

[20]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

[21]  Eytan Modiano,et al.  Optimal energy allocation for delay-constrained data transmission over a time-varying channel , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[22]  Leandros Tassiulas,et al.  Scheduling and performance limits of networks with constantly changing topology , 1997, IEEE Trans. Inf. Theory.

[23]  Stephen P. Boyd,et al.  QoS and fairness constrained convex optimization of resource allocation for wireless cellular and ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[24]  Elif Uysal-Biyikoglu,et al.  Energy-efficient scheduling of packet transmissions over wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[25]  Fillia Makedon,et al.  Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..

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

[27]  Matthew Andrews,et al.  Providing quality of service over a shared wireless link , 2001, IEEE Commun. Mag..

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

[29]  Michael L. Honig,et al.  Design and analysis of downlink utility-based schedulers , 2002 .

[30]  R. Johari,et al.  Network resource allocation and a congestion game: the single link case , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[31]  Tamer A. ElBatt,et al.  Joint scheduling and power control for wireless ad hoc networks , 2002, IEEE Transactions on Wireless Communications.

[32]  Michael J. Neely,et al.  Dynamic power allocation and routing for satellite and wireless networks with time varying channels , 2003 .

[33]  S. Fischer.  Selfish Routing , 2002 .

[34]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[35]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[36]  J. V. Mieghem.  Dynamic Scheduling with Convex Delay Costs: The Generalized CU Rule , 1995 .

[37]  A. Banerjee.  Convex Analysis and Optimization , 2006 .

[38]  Eytan Modiano,et al.  Power and server allocation in a multi-beam satellite with time varying channels , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[39]  Marco Ajmone Marsan,et al.  Bounds on average delays and queue size averages and variances in input-queued cell-based switches , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[40]  Ness B. Shroff,et al.  Downlink power allocation for multi-class CDMA wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[41]  Elif Uysal-Biyikoglu,et al.  Energy-efficient packet transmission over a wireless link , 2002, TNET.

[42]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[43]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[44]  Rayadurgam Srikant,et al.  Pathwise optimality and state space collapse for the exponential rule , 2002, Proceedings IEEE International Symposium on Information Theory,.