## 4 Results and Discussion
Average overhead with different Buffer Sizes, generating 2 kB messages every 1 to 2 h, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 10:1 Results for scenario 1.4. Average hop count with different Buffer Sizes, generating 2 MB messages every 1 to 2 h, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 10:2 Results for scenario 1.4. Average overhead with different Buffer Sizes, generating 2 MB messages every 1 to 2 h, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 10:3 Results for scenario 1.4. Average delay in seconds with different Buffer Sizes, generating 2 MB messages every 1 to 2 h, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 10:4 Results for scenario 2.1. Average hop count with different Buffer Sizes, generating 2 MB messages every 1 to 2 min, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 10:5 Results for scenario 2.1. Delivery probabilities with different Buffer Sizes, generating 2 MB messages every 1 to 2 min, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 10:6 Results for scenario 2.1. Average overhead with different Buffer Sizes, generating 2 MB messages every 1 to 2 min, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 10:7 Results for scenario 2.2. Average delay in seconds with different Buffer Sizes, generating 2 kB messages every 1 to 2 min, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 10:8 Results for scenario 2.2. Delivery probabilities with different Buffer Sizes, generating 2 kB messages every 1 to 2 min, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 10:9 Results for scenario 2.2. Average hop count with different Buffer Sizes, generating 2 kB messages every 1 to 2 min, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 9:0 Results for scenario 2.2. Average overhead with different Buffer Sizes, generating 2 kB messages every 1 to 2 min, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 9:1 Results for scenario 2.3. Average delay in seconds with different Buffer Sizes, generating 2 kB messages every 1 to 2 h, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 9:2 Results for scenario 2.3. Average hop count with different Buffer Sizes, generating 2 kB messages every 1 to 2 h, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 9:3 Results for scenario 2.3. Average overhead with different Buffer Sizes, generating 2 kB messages every 1 to 2 h, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 9:4 Results for scenario 2.4. Delivery probabilities with different Buffer Sizes, generating 2 MB messages every 1 to 2 h, (**a**) MAPs moving randomly on the path; (**b**) MAPs following the path in only one direction. DFA: Distributed Forwarding Algorithm. Figure 9:5 Results for scenario 2.4.