1) greedy routing
贪心路由
2) greedy routing
贪婪路由
1.
The scheme assigns a coordinate to each node of the network so that the nodes are embedded into a metric space induced by a small size of spanning trees of the network graph,and thus according to the coordinate space a greedy routing algorithm can be used for every pair of nodes.
与很多基于位置的贪婪路由算法相比较,该方法的特点是贪婪路由算法能够保证网络中任意一对节点之间都是可达的,并且路径长度不超过这对节点在生成树上的距离。
3) Greedy Perimeter Stateless Routing (GPSR)
贪心法周边无状态路由
4) greedy routing protocol
贪婪路由协议
5) greed coefficient of routing rules
路由贪婪系数
6) greedy geographical routing
贪婪地理路由
1.
To handle routing void of greedy geographical routing in wireless sensor networks,an efficiency adaptive void-handle algorithm is proposed,which is based on route signs that are distributed extracted and eliminated iteratively.
针对无线传感器网络贪婪地理路由协议中的路由空洞问题,提出一种高效的基于路标迭代提取和剔除的自适应空洞处理算法。
补充资料：离贪心
【离贪心】
（术语）有贪心之对。不与贪欲烦恼相应之善心。
（术语）有贪心之对。不与贪欲烦恼相应之善心。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条