# Node Screening Method Based on Federated Learning with IoT in Opportunistic Social Networks
## 4 Results
### Experimental Results
The delivery rate of the SEMC algorithm is lower than the above two algorithms, but due to its mechanism of identifying neighbors around, the transmission ratio is still slightly better than the traditional algorithm. Figure 9 shows the relation between routing overhead and cache. With the increase of cache, the routing overhead of the five algorithms is significantly reduced. In the case of a low cache, the Spray and Wait algorithm has a slightly larger overhead than the SECM algorithm. However, as the cache increases, its cost becomes smaller than the SECM algorithm, but the routing cost of these two algorithms is still higher than other algorithms. The ICMT algorithm based on the probability evaluation mechanism makes its cost lower than the traditional algorithm, but it is still slightly higher than the DMPPD and FABD  
Figure 8: The relationship between delivery ratio and cache. algorithms. The overhead of the DDMPD algorithm and the FABD algorithm is the same as the cache changes, and overhead of the FABD is less than which in the DDMPD. The routing cost of the FABD algorithm is in the range of 15 to 201. Therefore, increasing the cache of nodes can increase the routing overhead in the community, and FABD is also superior to several other algorithms in terms of routing overhead control. Figure 10 reflects the relation between energy consumption and cache. From the figure, it can be seen that the energy consumption of the traditional algorithm Spray and Wait increases with the increase of the cache, and in the case of a high cache, its energy consumption is very high. This is because each node of the algorithm transmits information to each neighbor in the community, so as the cache of the node increases, the energy consumption of the node increases sharply. The energy consumption of the ICMT algorithm and the SECM algorithm are basically the same, floating in the range of 52 to 175. Like the SECM algorithm, it uses the occasional transmission method to copy information through a single copy, so the energy optimization effect is better than the traditional algorithm. The energy consumption control of the DDMPD algorithm is better than the above algorithms. The main reason is that the DDMPD algorithm uses the information transmission method provided by the community, which significantly reduces energy consumption. With the increase of the cache, the energy consumption of the FABD algorithm has been stable at about 45, which shows that the node selection method of federated learning has great advantages in energy consumption control. Figure 11 shows the relations between the end-to-end delay and the cache. From the simulation results, it can be seen that as the cache increases, the end-to-end delay of all algorithms decreases. The delay of the Spray and Wait algorithm is the highest, but in the case of high cache, the delay is not much different from the SECM algorithm, and finally stabilized at about 85 s. The delay of the ICMT is reduced from 178 to 51, which of the DDMPD and the FABD are reduced from 96 and 81 to 43 and 31, respectively. The experimental results show that as the cache increases, the end-to-end delay in the opportunistic social network will decrease. At the same time, among several comparison algorithms, the delay of FABD is also the smallest. Figure 9: The relationship between routing overhead and cache. In the actual environment, the information transmission method is not single, and different information transmission methods may also have a certain impact on the information transmission performance of the algorithm. Below this research choose three mobile models to test the performance of the FABD algorithm. These three models are Shortest Path Map-Based Movement), RWP (random way point), and RM (random walk) models. The delivery ratio of the FABD in different mobile models is shown in Figure 12. In the SPMBM mobile model, the receiving rate of the opportunistic network is the highest, followed by RWP, and RM is the lowest.