However, geographic routing faces a local minimum problem when greedy forwarding strategy fails.
可是，基于地理位置信息的路由面临一个贪婪转发策略失败的本地最小问题。
However, the problem that most of the geographic routing algorithms which adopt greedy algorithm as their basic routing strategies have to face is the routing void phenomena.
许多采用贪婪策略作为其基本数据转发机制的地理路由算法都不可避免会遇到路由空洞现象。
To address the holes problem in wireless sensor networks, a novel geographic routing algorithm, named Double Greedy algorithm (DGA), was proposed based on virtual coordinate system.
针对地理路由算法中的路由空洞问题，通过引入虚拟坐标的方式，提出了一种新颖的无线网络地理路由算法——双重贪婪算法(DGA)。
Runtime routing should reflect the geographic affinity between requester and provider.
运行时路由应该反映请求者和提供者之间的地理亲缘关系。
Runtime routing should reflect the geographic affinity between requester and provider.
运行时路由应该反映请求者和提供者之间的地理亲缘关系。
应用推荐