A Maximum Concurrent Flow Technique for Optimized Data Routing in IoT Architectures

Maximum Concurrent Flow techniques try to combine a maximum flow graph resolution and the satisfaction of queries on this graph. They are proven to give better performance over classical heuristic data-source placement methods combined with greedy query resolution. A new version of the MCF approach is proposed and examined. It is tailored to provide MCF properties for large IoT networks. The results found from evaluation and comparison with other algorithms show that it has high efficiency and outperforms many recent solutions.

[1]  Saadi Boudjit,et al.  Distributed interference management in medical wireless sensor networks , 2016, 2016 13th IEEE Annual Consumer Communications & Networking Conference (CCNC).

[2]  Gary L. Miller,et al.  Flow in Planar Graphs with Multiple Sources and Sinks , 1995, SIAM J. Comput..

[3]  Ahmed E. Kamal,et al.  Scalable and Cost Efficient Algorithms for Virtual CDN Migration , 2016, 2016 IEEE 41st Conference on Local Computer Networks (LCN).

[4]  Walid Ben-Ameur,et al.  Efficient algorithms for the maximum concurrent flow problem , 2015, Networks.

[5]  Ahmed Mehaoua,et al.  Interference avoidance algorithm (IAA) for multi-hop wireless body area network communication , 2015, 2015 17th International Conference on E-health Networking, Application & Services (HealthCom).

[6]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.