IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v8y2011i1p346163.html
   My bibliography  Save this article

Distributed Algorithm for Real-Time Energy Optimal Routing Based on Dual Decomposition of Linear Programming

Author

Listed:
  • Jiří TrdliÄ ka
  • ZdenÄ›k Hanzálek

Abstract

This work proposes a novel in-network distributed algorithm for real-time energy optimal routing in ad hoc and sensor networks for systems with linear cost functions and constant communication delays. The routing problem is described as a minimum-cost multicommodity network flow problem by linear programming and modified by network replication to a real-time aware form. Based on the convex programming theory we use dual decomposition to derive the distributed algorithm. Thanks to the exact mathematical derivation, the algorithm computes the energy optimal real-time routing. It uses only peer-to-peer communication between neighboring nodes and does not need any central node or knowledge about the whole network structure. Each node knows only the produced and collected data flow and the costs of its outgoing communication links. According to our knowledge, this work is the first, which solves the real-time routing problem with linear cost functions and constant communication delays, using the dual decomposition.

Suggested Citation

  • Jiří TrdliÄ ka & ZdenÄ›k Hanzálek, 2011. "Distributed Algorithm for Real-Time Energy Optimal Routing Based on Dual Decomposition of Linear Programming," International Journal of Distributed Sensor Networks, , vol. 8(1), pages 346163-3461, September.
    • Handle: RePEc:sae:intdis:v:8:y:2011:i:1:p:346163
    DOI: 10.1155/2012/346163
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/346163
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/346163?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
    ---><---

    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:sae:intdis:v:8:y:2011:i:1:p:346163. 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: SAGE Publications (email available below). General contact details of provider: .

    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.