## 2 Related Work  
Among the first studies on potential-based routing, [PERSON] _et al_. [1] proposed potential-based routing (PBR) as a traffic-aware routing method. The potential of each node and link is calculated from both distance and traffic volume information with a weighting factor. The authors showed that PBRworks well in a slowly varying traffic situation, but did not present any results on adaptation to dynamic traffic conditions. Following their work, several other researchers proposed slight variations of potential-based routing.  
[PERSON] _et al_. [3] proposed HEAT using anycast routing for wireless mesh networks. HEAT assumes a potential value analogous to thermal conductivity. This conductivity level is exchanged among neighboring nodes and used as an indicator for traffic routing. Similarly, [PERSON] and [PERSON] [4] proposed link-diversity routing using the finite difference method routing (FDMR) algorithm, which is also based on an analogy to heat levels, but has a more lightweight potential calculation scheme than HEAT. The nodes exchange their temperatures with their neighbors, and the temperature difference between source and destination node is propagated over the network. [PERSON] _et al_. [5] proposed potential management-based proactive routing (PMPR), where nodes update their potential on demand, leading to a reduction in signaling cost. [PERSON] _et al_. [6] proposed parameterized gradient-based routing (PGBR), where the potential gradient is calculated in a stochastic manner using the load of links and nodes. PGBR is considered for Internet Protocol Television (IPTV) services run by different operators on a single Internet Protocol (IP) network infrastructure.  
In terms of theoretical analysis, [PERSON] and [PERSON] [7] proposed \"packetostatics\" and analyzed potential routing, especially from the viewpoint of physics. They focused on traffic flows in a densely populated sensor network identical to an electrostatic field. The theoretical analysis of potential functions is discussed with electromagnetic field analysis. In addition, [PERSON] [8] also surveyed wireless sensor network management approaches based on an analogy with physics.  
Apart from the potential based routing in MANET, [PERSON] _et al_. [9, 10] proposed Delay Tolerant Firework Routing (DTFR) using an efficient flooding approach in delay tolerant networks (DTN). DTFR is a delay-tolerant version of geographic routing and therefore appears in a different context compared with our MTFR, using reliable paths calculated in a potential-based manner.  
As stated above, most of the potential routing methods have their benefits to achieving robustness, but usually, they are assumed and evaluated in slow or non-mobile conditions. We believe that mechanisms that operate well in highly dynamic traffic conditions, while improving data transmission reachability, are also very important for the future Internet infrastructure. As a first step to perform the above mission, we introduced in [2] our initial research on Mobility Tolerant Firework Routing (MTFR), which is evaluated in greater detail in this paper.  
In addition, Ad hoc On-Demand Distance Vector (AODVv2) [11] and Optimized Link State Routing (OLSRv2) [12] are also two well-known conventional routing methods in MANET. Although AODVv2 can use efficient flooding, MTFR drastically can reduce flooding packets in comparison to AODVv2. In OLSRv2, routing paths are reactively selected, and therefore, the cost of path calculation is not negligible when nodes move frequently. Hence, we believe that our MTFR has benefits over those two methods.