## 3 Improved Multi Mobile Agent Data Fusion Scheme
### Mobile Agent Migration Path Algorithm
Geographical coordinates determine spatial data for the event, and the RMS generates and assigns a mobile probe dect_agent. The mobile agent accesses sensor nodes per the migration route, using the 4.2.4 algorithm to determine whether the sensor node can detect the event. It uses M = {\(m_{1}\), \(m_{2}\),..., \(m_{n}\)} binary numbers (0 or 1) to mark the corresponding results. Finally, the result set moves back to the RMS. The RMS calculates the number of detected events in the result set from the detection function, where a number of \(m_{i}=1\) indicates passing the threshold (see previous section). If the threshold is not reached, the detection of mobile agents continues to collect new results, and the cycle continues until it reaches the threshold of event detection or a small value indicates that there is no real detection event. Upon reaching the threshold, the RMS sends a mobile agent fusion_agent, which automatically moves along the migration route from one node to node for data fusion, sending back integrated fusion results. It is worth noting that the migration routes of dect_agent and fusion_agent are the same, but fusion_agent comes after dect_agent. The fusion_agent proxy returns the result to the DM. Until the fusion_agent data crosses the threshold, sensor nodes continue to collect data until reaching the accuracy of the task or a new round of detection starts. Data formats for the two agents are shown in Table 5. \begin{table}
\begin{tabular}{c c c c c c} \hline \hline
**Id** & **Source\_Id** & **Longitude** & **Latitude** & **Remaining** & **Signal** & **Type\_Info** \\  & & & & & \\
**Id** & **Source\_Id** & **Longitude** & **Latitude** & **Energy** & **Energy** & **Type\_Info** \\  & & & & & \\ \hline \hline \end{tabular}
\end{table} 
Table 4: Notification packet format. \begin{table}
\begin{tabular}{c c c c c} \hline \hline
**Node ID** & **Remaining Energy** & **Signal Energy** & **Longitude** & **Latitude** \\ \hline \hline \end{tabular}
\end{table} 
Table 3: DF information format. Further, consider that new rounds of integration do not start when the current round has not finished. In our design, rounds of integration start periodically and automatically by assigning another fusion_agent to conduct fusion operations. If the number of packets received crosses a certain number, the next dect_agent is automatically generated, even if the first dect_agent has not finished its migration path and the DM has not received its data yet. Given this, data collection by dect_agents is a continuous process. While dect_agents are at rest waiting for a time slice, fusion_agents start working and the two agents alternate with each other as shown in Figure 14. In the figure, \(t_{1}\) is the time between sending of dect_agents, \(t_{2}\) is the time dect_agents need to be sent out and traverse the route, and \(t_{3}\) is the time from sending out a fusion_agent until it returns with its fused data. Since data fusion by the fusion_agent takes more time than detecting an event by the dect_agent, \(t_{3}\) will be longer than \(t_{2}\). When the final integration results meet the accuracy of the task requirements, the two agents will terminate, and the resource recovered. Through direct communication between DM and RMS, the RMS encapsulates data and interacts with the application. Table 6 shows a summary of the complete cycle. The process starts as a linear process of detection and notification of the RMS, followed by a cycle of data collection and fusion, ending in termination of the event and discontinuation of data collection.