• DocumentCode
    3509983
  • Title

    Optimal MaxWeight scheduling in a multihop wireless network via branch and bound

  • Author

    Weeraddana, P.C. ; Codreanu, M. ; Latva-aho, M. ; Ephremides, A.

  • Author_Institution
    Centre for Wireless Commun., Univ. of Oulu, Oulu, Finland
  • fYear
    2011
  • fDate
    July 31 2011-Aug. 5 2011
  • Firstpage
    2881
  • Lastpage
    2885
  • Abstract
    We consider the problem of MaxWeight scheduling in wireless multihop networks. This problem is known to be NP-hard. We propose a solution method, based on the branch and bound technique, which solves globally the MaxWeight scheduling problem with an optimality certificate. Efficient analytic bounding techniques are introduced as well.
  • Keywords
    computational complexity; radio networks; scheduling; NP-hard; analytic bounding techniques; branch and bound technique; multihop wireless network; optimal MaxWeight scheduling; Fading; Interference; Schedules; Signal to noise ratio; Spread spectrum communication; Upper bound; Wireless networks; MaxWeight scheduling; branch and bound; global (nonconvex) optimization; wireless multihop networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
  • Conference_Location
    St. Petersburg
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4577-0596-0
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2011.6034102
  • Filename
    6034102
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3509983