IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v67y2018i4d10.1007_s11235-017-0366-4.html
   My bibliography  Save this article

Crosstalk-aware dynamic spectrum management algorithm for green DSL systems

Author

Listed:
  • Chee Keong Tan

    (Multimedia University)

  • Teong Chee Chuah

    (Multimedia University)

  • Mohd Saiful Bahri

    (Telekom Research & Development Malaysia Sdn Bhd)

Abstract

Dynamic spectrum management (DSM) techniques mitigate crosstalk in digital subscriber line (DSL) networks by adapting the transmit spectra to the actual noise and channel conditions. Conventional DSM schemes are designed based on single-objective optimization, either belonging to the rate-adaptive or margin-adaptive category. In this paper, an efficient crosstalk-aware DSM (CA-DSM) algorithm which jointly considers both the data rate and power is proposed to search for the best rate-power tradeoff solution based on the network conditions. The crosstalk-aware power strategy prevents transmitters which contribute excessive crosstalk from being allocated high power, thereby reducing the aggregate crosstalk noise in the system. A convex cost function is used to formulate the DSM optimization problem wherein two coefficients are introduced to make the CA-DSM algorithm adaptive to different network conditions. An iterative power update strategy is proposed for the CA-DSM algorithm to minimize the cost function. Convergence properties of the CA-DSM algorithm along with existence and uniqueness of optimal power solutions are examined analytically and illustrated graphically. Simulation results show that the proposed CA-DSM algorithm can provide a significantly better rate-power tradeoff performance compared to existing spectrum management schemes.

Suggested Citation

  • Chee Keong Tan & Teong Chee Chuah & Mohd Saiful Bahri, 2018. "Crosstalk-aware dynamic spectrum management algorithm for green DSL systems," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 67(4), pages 717-732, April.
  • Handle: RePEc:spr:telsys:v:67:y:2018:i:4:d:10.1007_s11235-017-0366-4
    DOI: 10.1007/s11235-017-0366-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-017-0366-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11235-017-0366-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:telsys:v:67:y:2018:i:4:d:10.1007_s11235-017-0366-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.