Topology control for heterogeneous connectivity requirements to sink in M2M networks

In this paper, topology control in machine-to-machine (M2M) networks is discussed. A new topology control algorithm, called topology adaption algorithm (TAA), is proposed to address the heterogeneous connectivity requirements from different classes of device nodes. The proposed algorithm uses network flow theory, introduces a fresh insight about how to perform topology control for M2M networks, and provides an energy-efficient solution with low computational complexity. Simulation results demonstrate the effectiveness of the proposed algorithm in terms of total network power consumption and success rate.

[1]  Geng Wu,et al.  M2M: From mobile to embedded internet , 2011, IEEE Communications Magazine.

[2]  Kun Yang,et al.  Multi-objective K-connected Deployment and Power Assignment in WSNs using a problem-specific constrained evolutionary algorithm based on decomposition , 2011, Comput. Commun..

[3]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[4]  J. L. Gao,et al.  Analysis of Energy Consumption for Ad Hoc Wireless Sensor Networks Using a Bit-Meter-per-Joule Metric , 2002 .

[5]  Jason Gao.  Analysis of Energy Consumption for Ad Hoc Wireless Sensor Networks Using a Bit-Meter-per-Joule Metric , 2002 .

[6]  Rodney Van Meter,et al.  MARA: Maximum Alternative Routing Algorithm , 2009, IEEE INFOCOM 2009.

[7]  Andrea E. F. Clementi,et al.  On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..

[8]  Deying Li,et al.  Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks , 2011, Theor. Comput. Sci..

[9]  Toshihide Ibaraki,et al.  Graph connectivity and its augmentation: applications of MA orderings , 2002, Discret. Appl. Math..

[10]  Boaz Patt-Shamir,et al.  Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds , 2005, SIAM J. Comput..

[11]  Ding-Zhu Du,et al.  Fault-Tolerant Topology Control for All-to-One and One-to-All Communication in Wireles Networks , 2008, IEEE Transactions on Mobile Computing.

[12]  Srinivasan Ramasubramanian,et al.  Independent Directed Acyclic Graphs for Resilient Multipath Routing , 2012, IEEE/ACM Transactions on Networking.

[13]  Santosh S. Vempala,et al.  Path splicing , 2008, SIGCOMM '08.