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

DAG Based Multipath Routing Algorithm for Load Balancing in Machine-to-Machine Networks

Author

Listed:
  • Liang Liu
  • Tao Zhang
  • Jun Zhang

Abstract

In M2M networks, most nodes are powered by battery; hence the overused nodes may easily be out of power, which causes the reduction of network lifetime. To solve this problem, it is helpful to balance network load into more nodes and links, so as to reduce network congestion. Multipath routing is a useful tool to reduce congestion, since data flow can be dispersed into multiple paths. However, most of the previous multipath routing algorithm is based on the path disjoint constraint, which leads to the lack of routing paths and the failure to disperse data flow into more links. In this paper, a directed acyclic graph based multipath routing algorithm for congestion minimization (DAGMR) is proposed, where different routing paths are confined in a directed acyclic graph (DAG) under time delay constraint. Furthermore, the data flow distribution is accomplished through partial capacity network to obtain the minimal multipath routing congestion factor. Simulation indicates that our algorithm can obtain lower congestion factor and formulates multipath routing graph with more nodes and links than algorithm with path disjoint constraint. In addition, our algorithm is a polynomial time complexity algorithm with nodes and links number of the entire network.

Suggested Citation

  • Liang Liu & Tao Zhang & Jun Zhang, 2013. "DAG Based Multipath Routing Algorithm for Load Balancing in Machine-to-Machine Networks," International Journal of Distributed Sensor Networks, , vol. 10(1), pages 457962-4579, December.
    • Handle: RePEc:sae:intdis:v:10:y:2013:i:1:p:457962
    DOI: 10.1155/2014/457962
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/457962
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/457962?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:10:y:2013:i:1:p:457962. 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.