Subscribe

Issue No.04 - April (2012 vol.11)

pp: 577-590

Hyang-Won Lee , Kotlkuk Univ., Seoul, South Korea

E. Modiano , Massachusetts Inst. of Technol., Cambridge, MA, USA

Long Bao Le , INRS Energie, Mater. et Telecommun., Univ. of Quebec, Montreal, QC, Canada

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2011.58

ABSTRACT

We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying optimization problems that prohibits an efficient solution even in a centralized setting. By generalizing the randomization framework originally proposed for input queued switches to SINR rate-based interference model, we characterize the throughput-optimality conditions that enable efficient and distributed implementation. Using gossiping algorithm, we develop a distributed power allocation algorithm that satisfies the optimality conditions, thereby achieving (nearly) 100 percent throughput. We illustrate the performance of our power allocation solution through numerical simulation.

INDEX TERMS

radiofrequency interference, numerical analysis, optimisation, radio networks, numerical simulation, distributed throughput maximization, wireless networks, random power allocation, optimization, SINR rate-based interference model, gossiping algorithm, Resource management, Interference, Throughput, Signal to noise ratio, Wireless networks, Power control, Stability analysis, SINR-based interference model., Throughput-optimal power allocation, randomization framework

CITATION

Hyang-Won Lee, E. Modiano, Long Bao Le, "Distributed Throughput Maximization in Wireless Networks via Random Power Allocation",

*IEEE Transactions on Mobile Computing*, vol.11, no. 4, pp. 577-590, April 2012, doi:10.1109/TMC.2011.58REFERENCES

- [1] H.-W. Lee, E. Modiano, and L.B. Le, “Distributed Throughput Maximization in Wireless Networks via Random Power Allocation,”
Proc. Int'l Conf. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2009.- [2] X. Lin, N.B. Shroff, and R. Srikant, “A Tutorial on Cross-Layer Optimization in Wireless Networks,”
IEEE J. Selected Areas in Comm., vol. 24, no. 8, pp. 1452-1463, Aug. 2006.- [3] G. Sharma, N.B. Shroff, and R.R. Mazumdar, “On the Complexity of Scheduling in Wireless Networks,”
Proc. ACM MobiCom, Sept. 2006.- [4] E. Modiano, D. Shah, and G. Zussman, “Maximizing Throughput in Wireless Networks via Gossiping,”
Proc. Joint Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS/Performance), June 2006.- [5] A. Eryilmaz, A. Ozdaglar, and E. Modiano, “Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks,”
Proc. IEEE INFOCOM, May 2007.- [6] S. Sanghavi, L. Bui, and R. Srikant, “Distributed Link Scheduling with Constant Overhead,”
Proc. ACM SIGMETRICS Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS), June 2007.- [7] A. Gupta, X. Lin, and R. Srikant, “Low-Complexity Distributed Scheduling Algorithms for Wireless Networks,”
Proc. IEEE INFOCOM, May 2007.- [8] R. Cruz and A. Santhanam, “Optimal Routing, Link Scheduling and Power Control in Multihop Wireless Networks,”
Proc. IEEE INFOCOM, June 2006.- [9] T. ElBatt and A. Ephremides, “Joint Scheduling and Power Control for Wireless Ad Hoc Networks,”
IEEE Trans. Wireless Comm., vol. 3, no. 1, pp. 74-85, Jan. 2004.- [10] M. Chiang, “Balancing Transport and Physical Layers in Wireless Multihop Networks: Jointly Optimal Congestion Control and Power Control,”
IEEE J. Selected Areas Comm., vol. 23, no. 1, pp. 104-116, Jan. 2005.- [11] B. Radunovic and J. Le Boudec, “Optimal Power Control, Scheduling, and Routing in UWB Networks,”
IEEE J. Selected Areas Comm., vol. 22, no. 7, pp. 1252-1270, Sept. 2004.- [12] S.A. Borbash and A. Ephremides, “Wireless Link Scheduling with Power Control and SINR Constraints,”
IEEE Trans. Information Theory, vol. 52, no. 11, pp. 5106-5111, Nov. 2006.- [13] L. Tassiulas and A. Ephremides, “Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks,”
IEEE Trans. Automatic Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.- [14] M.J. Neely, E. Modiano, and C.E. Rohrs, “Power Allocation and Routing in Multibeam Satellites with Time-Varying Channels,”
IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 138-152, Feb. 2003.- [15] M. Neely, E. Modiano, and C. Rohrs, “Dynamic Power Allocation and Routing for Time Varying Wireless Networks,”
IEEE J. Selected Areas Comm., vol. 23, no. 1, pp. 89-103, Jan. 2005.- [16] M. Neely and E. Modiano, “Fairness and Optimal Stochastic Control for Heterogeneous Networks,”
IEEE/ACM Trans. Networking, vol. 16, no. 2, pp. 396-409, Apr. 2008.- [17] X. Lin and N. Shroff, “The Impact of Imperfect Scheduling on Cross-Layer Congestion Control in Wireless Networks,”
IEEE/ACM Trans. Networking, vol. 14, no. 2, pp. 302-315, Apr. 2006.- [18] A. Eryilmaz and R. Srikant, “Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control,”
IEEE/ACM Trans. Networking, vol. 15, no. 6, pp. 1333-1344, Dec. 2007.- [19] P. Charporkar, K. Kar, and S. Sarkar, “Throughput Guarantees through Maximal Scheduling in Wireless Networks,”
IEEE Trans. Information Theory, vol. 54, no. 2, pp. 572-594, Feb. 2008.- [20] G. Zussman, A. Brzezinski, and E. Modiano, “Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks,”
Proc. IEEE INFOCOM, Apr. 2008.- [21] C. Joo, X. Lin, and N.B. Shroff, “Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks,”
Proc. IEEE INFOCOM, Apr. 2008.- [22] G. Sharma, N. Shroff, and R. Mazumdar, “Joint Congestion Control and Distributed Scheduling for Throughput Guarantees in Wireless Networks,”
Proc. IEEE INFOCOM, May 2007.- [23] S. Hayashi and Z.-Q. Luo, “Spectrum Management for Interference-Limited Mul-Tiuser Communication Systems,”
IEEE Trans. Information Theory, vol. 55, no. 3, pp. 1153-1175, Mar. 2009.- [24] Z.-Q. Luo and S. Zhang, “Dynamic Spectrum Management: Complexity and Duality,”
IEEE J. Selected Topics Signal Processing, vol. 2, no. 1, pp. 57-73, Feb. 2008.- [25] L. Tassiulas, “Linear Complexity Algorithms for Maximum Throughput in Radio Networks and Input Queued Switches,”
Proc. IEEE INFOCOM, Mar. 1998.- [26] Y. Yi, G. de Veciana, and S. Shakkottai, “On Optimal Mac Scheduling with Physical Interference,”
Proc. IEEE INFOCOM, May 2007.- [27] T. Moscibroda, Y. Oswald, and R. Wattenhofer, “How Optimal Are Wireless Scheduling Protocols?”
Proc. IEEE INFOCOM, 2007.- [28] O. Goussevskaia, R. Wattenhofer, M. Halldorsson, and E. Welzl, “Capacity of Arbitrary Wireless Networks,”
Proc. IEEE INFOCOM, 2009.- [29] M. Andrews and M. Dinitz, “Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory,”
Proc. IEEE INFOCOM, 2009.- [30] J. Kim, X. Lin, and N. Shroff, “Locally Optimized Scheduling and Power Control Algorithms for Multi-Hop Wireless Networks under SINR Interference Models,”
Proc. Int'l Symp. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshop (WiOpt), 2007.- [31] H.-W. Lee, E. Modiano, and L.B. Le, “Distributed Throughput Maximization in Wireless Networks via Random Power Allocation,”
Proc. Seventh Int'l Conf. Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, http://web.mit.edu/hwlee/www/papersTR1_randpow.pdf , 2009.- [32] S. Boyd et al. “Randomized Gossip Algorithms,”
IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2508-2530, June 2006.- [33] D. Shah, D.N.C. Tse, and J.N. Tsitsiklis, “Hardness of Low Delay Network Scheduling,” submitted to
IEEE Trans. Info. Theory.- [34] R. Olfati-Saber, J.A. Fax, and R. Murray, “Consensus and Cooperation in Networked Multi-Agent Systems,”
Proc. IEEE, vol. 95, no. 1, pp. 215-233, Jan. 2007.- [35] A. Olshevsky and J.N. Tsitsiklis, “Convergence Speed in Distributed Consensus and Averaging,”
SIAM J. Control and Optimization, vol. 48, no. 1, pp. 33-55, 2009.- [36] H.J. Landau and A.M. Odlyzko, “Bounds for Eigenvalues of Certain Stochastic Matrices,”
Linear Algebra and Its Applications, vol. 38, pp. 5-15, 1981.- [37] A. Dimakis, A. Sarwate, and M. Wainwright, “Geographic Gossip: Efficient Averaging for Sensor Networks,”
IEEE Trans. Signal Processing, vol. 56, no. 3, pp. 1205-1216, Mar. 2008.- [38] F. Benezit, A. Dimakis, P. Thiran, and M. Vetterli, “Order-Optimal Consensus through Randomized Path Averaging,”
Proc. Allerton Conf., 2007. |