An Analytic Latency Model for a Next-Hop Data-Ferrying Swarm on Random Geometric Graphs

Abstract

Next-hop data-ferrying is a data-driven approach to ferrying data between graph components of a disconnected network. In contrast to pre-planned routing methods like the Traveling Salesman tour, only the next-hop is planned, allowing the ferry to be reactive to the data flows within the network. When multiple ferries are used, explicit coordination between them is difficult due to the data-driven approach of the algorithm, and the distributed and disconnected nature of the problem. However, coordinated behavior can still be produced through swarm intelligent means and while this is a useful pragmatic result, mathematical models describing system properties are difficult to develop. This generally results in algorithm correctness being demonstrated through simulation. In this article, we describe the development of a mathematical model of such a next-hop ferrying swarm. We show that the closed-form expression for user data latency is a close match to simulation results for Random Geometric Graphs under the assumption of a zero expected degree. In non-zero degree graphs, a near constant offset between the model and simulation is observed.INDEX TERMS Data ferrying, emergent behavior, MANET, random geometric graph.

Distributed Average Consensus Algorithms in d-Regular Bipartite Graphs: Comparative Study

“…In this paper, we model MASs as simple finite undirected unweighted graphs determined by the vertex set V and the edge set E (i.e., G = (V,E)) [71,72]. We assume that both sets are of finite size and time-invariant in our experiments.…”

Comparative Study of Distributed Consensus Gossip Algorithms for Network Size Estimation in Multi-Agent Systems

“…In this paper, MASs are modeled as simple finite undirected unweighted graphs labeled as G and determined by two time-invariant sets, namely the vertex set V and the edge set E (G = (V, E)) [43,44]. The vertex set V consists of all the graph vertices representing the agents in MAS.…”

“…In this paper, we examine the chosen algorithms over RGGs, graphs that represent spatial MASs with n randomly deployed agents [43,44] (see Figure 4 for an example of RGGs (one of 100 RGGs applied in our research is shown in this figure to illustrate what the network topology of the used graphs looks like) and Table 1 containing the graph parameters (the average value of each parameter of 100 applied graphs is shown)). In these graphs, the agents are placed uniformly at random over a square area of finite size.…”