• DocumentCode
    3798508
  • Title

    On the Convexity of Feasible QoS Regions

  • Author

    Sawomir Stanczak;Holger Boche

  • Author_Institution
    Fraunhofer German-Sino Lab for Mobile Commun., Berlin
  • Volume
    53
  • Issue
    2
  • fYear
    2007
  • Firstpage
    779
  • Lastpage
    783
  • Abstract
    The feasible quality-of-service (QoS) region is the set of all QoS vectors that can be provided to the users by means of power control, with interference treated as noise. In an interference-limited scenario, this set is determined by the Perron root of some QoS-dependent nonnegative matrix. In a previous work, we showed that if the signal-to-interference ratio (SIR) is a log-convex function of the QoS, then the Perron root is a log-convex function. This implies convexity of the feasible QoS region. In this correspondence, we prove that the log-convexity property is also necessary for the Perron root to be convex for any choice of the (path) gain matrix. Interestingly, a significantly less restrictive property is sufficient when the gain matrix is confined to be symmetric positive semidefinite
  • Keywords
    "Interference","Upper bound","Stability","Network coding","Conferences","Graph theory","Multicast algorithms","Encoding","Throughput","USA Councils"
  • Journal_Title
    IEEE Transactions on Information Theory
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2006.889008
  • Filename
    4069161