The embodiment of the invention relates to a method, a device and a system for selecting a neighbor node.
本发明实施例涉及一种邻居节点的选择方法、装置和系统。
Both algorithms take advantage of the communication relationship with the neighbor node, build the sample space, to improve the positioning accuracy.
这两种算法均利用邻居节点间的通讯约束关系构建样本空间，从而提高算法的定位精度。
When the prior neighbor node is empty, widen the Angle of the prior region in order to widen the scope of prior region until find out a satisfied node.
当探测到前向邻居节点为空时，扩大前向区域的角度，以此来扩大前向区域的范围，直到找到一个符合要求的节点。
When a new node initializes its IP address, it exchanges information only with one of the one-hop neighbor nodes, rather than with all nodes in the MANET.
当新节点初始化ip地址时，节点只与一跳传输范围之内的某个邻居节点交换信息，而不需要向移动自组网中的所有节点广播请求。
SELF required each node update the identity key of the node and the neighbor key between nodes and invalidate the old keys at given intervals.
SELF要求各节点每经过一个规定的时间间隔，就更新一次节点的身份密钥和节点间的邻居密钥，并将原密钥作废。
Every node only has the value of its direct neighbor, in order to improve the extension of the reputation system. Moreover, we use the trusted neighbors to scout the behavior of the node.
每个节点只保存其直接邻居节点的声誉值，以提高声誉机制的扩展性，并且在声誉机制中采用了可信邻居节点集进行辅助检测的机制。
At the stage of multi-hop neighbor discovery, the neighbor information from all interfaces in last stage should be integrated and broadcasted from each interface in the node.
或在接口信道上侦听来自邻居节点发送的邻居通告消息，收集各接口信道对应的邻居信息；
In order to deal with the problem of fault tolerant routing on exchanged hypercube, the concept of the neighbor sets of present node is defined.
为了研究交换超立方体网络容错路由问题，引入了相邻结点集合类的概念，提出了相邻结点集的求解公式。
In order to deal with the problem of fault tolerant routing on exchanged hypercube, the concept of the neighbor sets of present node is defined.
为了研究交换超立方体网络容错路由问题，引入了相邻结点集合类的概念，提出了相邻结点集的求解公式。
应用推荐