该算法在有效节点的局部网络拓扑中选择路由节点，减少大面积泛洪及路由重复

The routing algorithm chooses node valid network topology local node, and to reduce the large flood re-routing <br>energy reuse plan. The algorithm selects the optimal node for target information fusion, without having to traverse all <br>nodes and remove redundant information, which reduces the amount of communication data and reduces the energy consumption and delay of network communication.

The algorithm selects the routing node in the local network topology of the effective node, reducing the large area flooding and routing heavy<br>energy consumption for re-planning. The algorithm selects the optimal node for target information fusion without traversing all<br>Nodes, and remove redundant information, reduce the amount of data communicated, reduce the energy consumption and delay of network communication.

The algorithm selects the routing node in the local network topology of the effective node to reduce the flooding and routing weight in large area<br>Energy consumption of re planning. The algorithm selects the optimal node for target information fusion without traversing all<br>The redundant information is removed from the nodes, which reduces the amount of communication data and the energy consumption and delay of network communication.<br>