1) quadrant neighbor list
象限邻居表
1.
In this paper,an ant algorithm based on a geometry structure of TSP is presented to solve these shortcomings,constructing candidate list by quadrant neighbor list and initializing pheromone table by dual quadrant neighbor method.
本文提出了一种基于旅行商问题(TSP)几何结构的蚁群算法,利用象限邻居表构造候选集和对偶限象邻居的方法初始化信息素,用以克服上述缺陷。
2) dual quadrant neighbor method
对偶象限邻居方法
3) neighbor table
邻居表
1.
The neighbor table was introduced to make sure that the routing was locally optimal by considering the routing hops.
改进算法中通过引入邻居表,考虑路由跳数使路由局部最优,同时改进算法中也考虑了节点的剩余能量,路由选择的时候尽量避开剩余能量较低的节点。
2.
The scheme proposed improved the efficiency of the original routing algorithm by employing neighbor tables based on the analysis of ZigBee network address assignment mechanism and Cluster-Tree routing algorithm,and if the table containes a neighbor node that enables reducing the routing cost to the destination,it could be the next hop node.
首先介绍ZigBee网络的地址分配机制,分析Cluster-Tree路由算法,并在此基础上引入邻居表提出改进算法。
4) Adjacent quadrant
邻象限
5) neighbour congestion table
邻居拥塞表
1.
This paper proposes a concept of neighbour congestion table,improves Ad Hoc on Demand Distance Vector(AODV) Protocol on the base of bypass,neighbour congestion table,hello message and Next Green-hop Requset(NGRQ) systems.
该文提出邻居拥塞表概念,利用旁路、邻居拥塞表、hello消息和下一绿色节点请求技术,对自组网按需距离矢量(AODV)协议进行改进,提出自组网拥塞适应按需距离矢量(CA-AODV)路由协议。
6) Restricted vertical neighborhood
垂直邻居受限
补充资料：阿斯曼通风干湿表(见通风干湿表)
阿斯曼通风干湿表(见通风干湿表)
AS iman tongfeng ganshibiao阿斯曼通风干湿表见通风干湿表。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条