Mathematicians create algorithm that could accelerate IoT by using optimal traffic division

iotroutingalgorithmnetwork-optimizationdynamic-programming

Abstraction: Dynamic programming multipath routing algorithm for dense IoT networks

Key points:

RUDN University researchers proposed a multipath routing algorithm using dynamic programming to optimally split traffic across multiple simultaneous paths in IoT networks.
Compared to random uniform distribution and classical methods, the new algorithm reduced intermediate node count by 34%, computational costs by 52%, and data delivery time by 40%.
Transmission rate improved by 40%; also outperformed classical methods in energy consumption, packet delivery delay, packet delivery ratio, and costs.
IoT networks lack uniform standards; multipath routing is established but optimal path selection is the key challenge for scalability and reliability.
Published in Mathematics journal (DOI: 10.3390/math11194168).

Connections: Rudn University · Multipath Routing · Internet Of Things · Dynamic Programming · Network Optimization