IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v2y2011i4p29-40.html
   My bibliography  Save this article

A Hybrid Meta-Heuristic Algorithm for Dynamic Spectrum Management in Multiuser Systems: Combining Simulated Annealing and Non-Linear Simplex Nelder-Mead

Author

Listed:
  • Hernan X. Cordova

    (Free University of Brussels, Belgium)

  • Leo Van Biesen

    (Free University of Brussels, Belgium)

Abstract

One of the major sources of performance degradation of current Digital Subscriber Line systems is the electromagnetic coupling among different twisted pairs within the same cable bundle (crosstalk). Several algorithms for Dynamic Spectrum management have been proposed to counteract the crosstalk effect but their complexity remains a challenge in practice. Optimal Spectrum Balancing (OSB) is a centralized algorithm that optimally allocates the available transmit power over the tones making use of a Dual decomposition approach where Lagrange multipliers are used to enforce the constraints and decouple the problem over the tones. However, the overall complexity of this algorithm remains a challenge for practical DSL environments. The authors propose a low-complex algorithm based on a combination of simulated annealing and non-linear simplex to find local (almost global) optimum spectra for multiuser DSL systems, whilst significantly reducing the prohibitive complexity of traditional OSB. The algorithm assumes a Spectrum Management Center (at the cabinet side) but it neither relies on own end-user modem calculations nor on messaging-passing for achieving its performance objective. The approach allows furthering reducing the number of function evaluations achieving further reduction on the convergence time (up to ~27% gain) at reasonable payoff (weighted data rate sum).

Suggested Citation

  • Hernan X. Cordova & Leo Van Biesen, 2011. "A Hybrid Meta-Heuristic Algorithm for Dynamic Spectrum Management in Multiuser Systems: Combining Simulated Annealing and Non-Linear Simplex Nelder-Mead," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 2(4), pages 29-40, October.
  • Handle: RePEc:igg:jamc00:v:2:y:2011:i:4:p:29-40
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2011100103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:2:y:2011:i:4:p:29-40. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.