Weighted sum-rate maximization in singlecast and multicast wireless networks - Global optimum via branch and bound

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Volumn , Issue , 2011, Pages 2274-2278

  Codreanu, M ^a   Weeraddana, P C ^a   Latva Aho, M ^a   Ephremides, A ^b  

^a UNIVERSITY OF OULU   (Finland)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

branch and bound; global (nonconvex) optimization; multicast networks; wireless singlecast

Indexed keywords

ACHIEVABLE RATE REGION; BOUNDING TECHNIQUES; BRANCH AND BOUNDS; GLOBAL OPTIMUM; LINK SCHEDULING; MULTICAST NETWORK; MULTICASTS; NONCONVEX; NP-HARD; OPTIMALITY; SOLUTION METHODS; WEIGHTED SUM-RATE;

LINEAR PROGRAMMING; OPTIMIZATION;

MULTICASTING;

EID: 84857593203     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PIMRC.2011.6139923     Document Type: Conference Paper

References (17)

1. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automat. Contr., vol. 37, no. 12, pp. 1936-1949, Dec. 1992.
2. M. J. Neely, Stochastic Network Optimization with Application to Communication and Queueing Systems, vol. 7 of Synthesis Lectures on Communication Networks, Morgan & Claypool, San Rafael, CA, 2010.
3. X. Lin and N. B. Shroff, "Joint rate control and scheduling in multihop wireless networks," Tech. rep., Purdue University, 2004, [Online]. Available: http://cobweb.ecn.purdue.edu/"linx/papers.html.
4. M. J. Neely, E. Modiano, and C. E. Rohrs, "Dynamic power allocation and routing for time varying wireless networks," IEEE J. Select. Areas Commun., vol. 23, no. 1, pp. 89-103, Jan. 2005. (Pubitemid 40088660)
5. A. L. Stolyar, "Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm," Queue. Sys., vol. 50, no. 4, pp. 401-457, Aug. 2005.
6. A. Eryilmaz, R. Srikant, and J. R. Perkins, "Stable scheduling policies for fading wireless channels," IEEE/ACM Trans. Networking, vol. 13, no. 2, pp. 411-424, Apr. 2005. (Pubitemid 40690835)
7. A. L. Stolyar, "Greedy primal-dual algorithm for dynamic resource allocation in complex networks," Queue. Sys., vol. 54, no. 3, pp. 203-220, Nov. 2006.
8. G. Sharma, R. R. Mazumdar, and N. B. Shroff, "On the complexity of scheduling in wireless networks," in Proc. ACM int. conf. on Mobile comp. and net., Los Angeles, CA, USA, Sept. 24-29 2006, pp. 227-238.
9. Z. Luo and S. Zhang, "Dynamic spectrum management: Complexity and duality," IEEE J. Select. Areas Commun., vol. 2, no. 1, pp. 57-73, Feb. 2008. (Pubitemid 351392288)
10. P. C. Weeraddana, M. Codreanu, M. Latva-aho, and A. Ephremides, "Weighted sum-rate maximization for a set of interfering links via branch and bound," in Proc. Annual Asilomar Conf. Signals, Syst., Comp., Pacific Grove, CA, USA, Nov. 7-10 2010, [Online]. Available: http://www.ee.oulu.fi/ "codreanu/WSRmax BB Asilomar2010.pdf.
11. S. Boyd, "Branch-and-bound methods," [Online]. Available: http://www. stanford.edu/class/ee364b/lectures/bb slides.pdf, 2007.
12. S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004.
13. P. C. Weeraddana, M. Codreanu, M. Latva-aho, and A. Ephremides, "Weighted sum-rate maximization for a set of interfering links via branch and bound," IEEE Trans. Signal Processing, to appear, 2011.
14. I. C. Abou-Faycal, M. D. Trott, and S. Shamai, "The capacity of discrete-time memoryless Rayleigh-fading channels," IEEE Trans. Inform. Theory, vol. 47, no. 4, pp. 1290-1301, May 2001. (Pubitemid 32508474)
15. T. M. Cover and J. A. Thomas, Elements of Information Theory, New York: Wiley, second edition, 2006.
16. S. V. Hanly and D. N. Tse, "Multiaccess fading channels-part II: Delay limited capacities," IEEE Trans. Inform. Theory, vol. 44, no. 7, pp. 2816-2831, Nov. 1998.
17. M. Chiang, "Geometric programming for communication systems," Foundations and Trends in Commun. and Inform. Theory, vol. 2, no. 1-2, pp. 1-154, July 2005.