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

The algorithm selects routing nodes in the local network topology of effective nodes to reduce the energy consumption of large area flooding and repeated routing planning. The algorithm selects the optimal node for information fusion, without having to traverse all nodes, reducing the amount of communication data and reducing the energy consumption and delay of network communication.

The algorithm selects the routing node in the local network topology of the effective node, which reduces the energy consumption of large-area flooding and routing duplication planning. The algorithm selects the optimal node for information fusion, does not need to traverse all nodes, reduces the amount of data of communication, reduces the energy consumption and delay of network communication.

The algorithm selects routing nodes in the local network topology of the effective nodes to reduce the energy consumption of large area flooding and repeated routing planning. The algorithm selects the best node for information fusion, does not need to traverse all nodes, reduces the amount of data communication, reduces the energy consumption and delay of network communication.