• English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • English 
    • English
    • Ελληνικά
    • Deutsch
    • français
    • italiano
    • español
  • Login
View Item 
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
  •   University of Thessaly Institutional Repository
  • Επιστημονικές Δημοσιεύσεις Μελών ΠΘ (ΕΔΠΘ)
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ.
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
All of DSpace
  • Communities & Collections
  • By Issue Date
  • Authors
  • Titles
  • Subjects

Convex approximation techniques for joint multiuser downlink beamforming and admission control

Thumbnail
Author
Matskani, E.; Sidiropoulos, N. D.; Luo, Z. Q.; Tassiulas, L.
Date
2008
DOI
10.1109/twc.2008.070104
Keyword
downlink beamforming
admission control
scheduling
convex
approximation
semidefinite relaxation
OPTIMIZATION
NETWORKS
Engineering, Electrical & Electronic
Telecommunications
Metadata display
Abstract
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network operator's perspective (e.g., UNITS, 802.16e). When there are many co-channel users and/or the service constraints are stringent, the problem becomes infeasible and some form of admission control is necessary. We advocate a cross-layer approach to joint multiuser transmit beamforming and admission control, aiming to maximize the number of users that can be served at their desired QoS. It is shown that the core problem is NP-hard, yet amenable to convex approximation tools. Two computationally efficient convex approximation algorithms are proposed: one is based on semidefinite relaxation of an equivalent problem reformulation; the other takes a penalized second-order cone approach. Their performance is assessed in a range of experiments, using both simulated and measured channel data. In all experiments considered, the proposed algorithms work remarkably well in terms of the attained performance-complexity trade-off, consistently exhibiting close to optimal performance at an affordable computational complexity.
URI
http://hdl.handle.net/11615/30782
Collections
  • Δημοσιεύσεις σε περιοδικά, συνέδρια, κεφάλαια βιβλίων κλπ. [15730]
Η δικτυακή πύλη της Ευρωπαϊκής Ένωσης
Ψηφιακή Ελλάδα
ΕΣΠΑ 2007-2013
 

 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister (MyDspace)
Help Contact
DepositionAboutHelpContact Us
Choose LanguageAll of DSpace
EnglishΕλληνικά
Η δικτυακή πύλη της Ευρωπαϊκής Ένωσης
Ψηφιακή Ελλάδα
ΕΣΠΑ 2007-2013