Maximum flow in buffer-limited delay tolerant networks. The static approach

Abstract

Delay Tolerant Networks (DTNs), such as Internet, ad hoc networks, satellite networks and sensor networks, have attracted considerable attention. The maximum flow problem has a vital importance for routing and service scheduling in networks. For delay tolerant networks there are no permanent end-to-end paths since the topology and links characteristics are time-varying. In these instances, to account properly for the evolution of the underlying system over time, we need to use dynamic network flow models. When time is considered as a discrete variable, these problems can be solved by constructing an equivalent static time expanded network. This is a static approach. In this paper we study the maximum flow in a buffer-limited delay tolerant network, with static approach.

Data Delivery in a Disaster or Quarantined Area Divided into Triangles Using DTN-Based Algorithms for Unmanned Aerial Vehicles

“…In the literature there are several variations of these algorithms. In buffer-limited delay-tolerant networks, maximum flow with a static approach can be considered [ 22 ]. The classic dynamic network can be adapted to the time-expanded network [ 23 ].…”

Algorithms for Delivery of Data by Drones in an Isolated Area Divided into Squares

“…Comparisons between classical flood-based protocols, such as Epidemic [ 17 ], Spray and Wait [ 18 ], PRoPHET [ 19 ], and MaxProp [ 20 ], were undertaken in [ 15 ]. Maximum flow with the static approach in buffer-limited delay tolerant networks was investigated in [ 21 , 22 ].…”