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

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.

[1]  Sung-Ju Lee,et al.  Split multipath routing with maximally disjoint paths in ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[2]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[3]  Jean-Jacques Pansiot,et al.  Low Complexity Link State Multipath Routing , 2009, IEEE INFOCOM Workshops 2009.

[4]  Ariel Orda,et al.  Multipath routing algorithms for congestion minimization , 2007, IEEE/ACM Trans. Netw..

[5]  Yanhong Zhou,et al.  A novel MPR approach based on inverse-traversing of Multi-Labeled Tree , 2010, 2010 International Conference on Intelligent Computing and Integrated Systems.

[6]  Lynn Choi,et al.  DAG-based multipath routing for mobile sensor networks , 2011, ICTC 2011.

[7]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[8]  Nei Kato,et al.  Toward intelligent machine-to-machine communications in smart grid , 2011, IEEE Communications Magazine.

[9]  R. Nowak,et al.  Generalized binary search , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[10]  Networks Shio,et al.  A Survey of Energy-Efficient Hierarchical Cluster-Based Routing in Wireless Sensor , 2010 .

[11]  Antonio Pietrabissa,et al.  Multipath routing by network decomposition and traffic balancing , 2010, 2010 Future Network & Mobile Summit.

[12]  Olivier Bonaventure,et al.  An efficient algorithm to enable path diversity in link state routing networks , 2011, Comput. Networks.

[13]  Stavros D. Nikolopoulos,et al.  The Longest Path Problem is Polynomial on Cocomparability Graphs , 2010, WG.

[14]  Xinyu Yang,et al.  A Bandwidth Aware Multi-path Routing Protocol in Mobile Ad Hoc Networks , 2011 .