Optimal Control of Wireless Networks with Finite

This paper considers network control for wireless networks with finite buffers. We investigate the performance of joint flow control, routing, and scheduling algorithms which achieve high network utility and deterministically bounded back- logs inside the network. Our algorithms guarantee that buffers inside the network never overflow. We study the tradeoff between buffer size and network utility and show that if internal buffers have size (N − 1)/� then a high fraction of the maximum utility can be achieved, wherecaptures the loss in utility and N is the number of network nodes. The underlying scheduling/routing component of the considered control algorithms requires ingress queue length information (IQI) at all network nodes. However, we show that these algorithms can achieve the same utility performance with delayed ingress queue length information. Numerical results reveal that the considered algorithms achieve nearly optimal network utility with a significant reduction in queue backlog compared to the existing algorithm in the litera- ture. Finally, we discuss extension of the algorithms to wireless networks with time-varying links.

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

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

[3]  Eytan Modiano,et al.  Delay analysis of maximum weight scheduling in wireless Ad Hoc networks , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

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

[5]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

[6]  M.J. Neely,et al.  Order Optimal Delay for Opportunistic Scheduling in Multi-User Wireless Uplinks and Downlinks , 2008, IEEE/ACM Transactions on Networking.

[7]  Alexander L. Stolyar,et al.  Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..

[8]  Ness B. Shroff,et al.  Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks , 2008, IEEE/ACM Transactions on Networking.

[9]  Eytan Modiano,et al.  Distributed Throughput Maximization in Wireless Networks via Random Power Allocation , 2012, IEEE Transactions on Mobile Computing.

[10]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

[11]  Aleksandr Stolyar.  Large deviations of queues under qos scheduling algorithms , 2006 .

[12]  Michael J. Neely,et al.  Delay Analysis for Maximal Scheduling in Wireless Networks with Bursty Traffic , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[13]  Alexander L. Stolyar,et al.  Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing , 2009, IEEE INFOCOM 2009.

[14]  Ness B. Shroff,et al.  Delay Analysis for Multi-Hop Wireless Networks , 2009, IEEE INFOCOM 2009.

[15]  Lei Ying,et al.  Scheduling in Mobile Ad Hoc Networks With Topology and Channel-State Uncertainty , 2012, IEEE Transactions on Automatic Control.

[16]  Eytan Modiano,et al.  Dynamic power allocation and routing for time-varying wireless networks , 2005 .

[17]  Xiaojun Lin,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[18]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[19]  R. Srikant,et al.  Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control , 2007, TNET.

[20]  Lei Ying,et al.  On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks , 2009, IEEE INFOCOM 2009.

[21]  Eytan Modiano,et al.  Autonomous routing algorithms for networks with wide-spread failures , 2009, MILCOM 2009 - 2009 IEEE Military Communications Conference.

[22]  R. Srikant,et al.  Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling , 2008, TNET.

[23]  Prasanna Chaporkar,et al.  Throughput Guarantees Through Maximal Scheduling in Wireless Networks , 2008 .

[24]  Eytan Modiano,et al.  Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[25]  Ness B. Shroff,et al.  Performance of Random Access Scheduling Schemes in Multi-hop Wireless Networks , 2006 .

[26]  Atilla Eryilmaz,et al.  A Unified Approach to Optimizing Performance in Networks Serving Heterogeneous Flows , 2009, INFOCOM.

[27]  Ran Ginosar,et al.  The Capacity Allocation Paradox , 2009, IEEE INFOCOM 2009.

[28]  Eytan Modiano,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2008 .

[29]  Eytan Modiano,et al.  Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.