而从佩丽[10]等提出一种面向移动自组织网络的改进洪泛算法，通过节点位

And from Pei Li [10] et al. proposed an improved flooding algorithm for mobile ad hoc networks, which calculates the request area of ​​the source node and the desired area of ​​the destination node through node location information, and sets the nominated broadcast retransmission neighbor list to achieve routing The area limitation of the packet number propagation effectively reduces the number of redundant messages forwarding and improves network performance.

And from Pelly, an improved flood algorithm for mobile self-organizing network is proposed, the request area and destination node are calculated by node location information, and the list of neighbors of the nominated broadcast re-transmission is set, the regional limit of the number of route grouping propagation is realized, which effectively reduces the number of redundant messages forwarded and improves the network performance.

An improved flooding algorithm for mobile ad hoc networks is proposed from Peili [10], which calculates the request area of the source node and the expected area of the destination node through the node location information, and sets the nomination broadcast retransmission neighbor list, so as to achieve the area limitation of the number of routing packets propagation, effectively reduce the number of redundant message forwarding, and improve the network performance.<br>