Neighbors table updating algorithm for Ad hoc networks
Ad hoc网络邻居节点表自适应构建与维护算法*

On the basis of analyzing the phenomenon of temporary communication blindness resulted from fixed period beacon exchange in greedy geographical routing of Ad hoc networks, this paper proposed a new neighbors table updating algorithm. Simulation showes that the adaptive beacon exchange algorithm can acquire high packet success delivery ratio for eliminating the phenomenon of temporary communication blindness, and get low consumption. So the algorithm is scalable and applicable to large-scale Ad hoc networks.