Модель розрахунку множини маршрутів, що не перетинаються, з максимальною пропускною здатністю в MANET

Abstract

A mathematical model for calculation of the set of disjoint paths oriented to the maximum bandwidth in multipath routing in MANET is presented. The task of calculating the set of disjoint paths was reduced to solving the optimization problem of integer linear programming focused on the bandwidth maximum in the presence of linear constraints since the routing variables are Boolean, and variables that determine the number of routes used take only integer values. The model can be used in the development of appropriate routing protocols for MANET providing Quality of Service,resilience, and network security.