child node

child node的基本解释

-

[计] 子节点

与child node相关的网络例句 [注：此内容来源于网络，仅供参考]

Detecting failure calculating node; setting the IO node forming link with the failure node as replacing node determined by address obtained by adding one dimension into the failure node, notifying the replacing node to the node nearby the failure node; when one adjacent node has received a packet, routing the packet from the failure node to the replacing node; handling operation determined by the packet arrived in the replacing node in the replacing node; making the replacing node to find out address of calculating node where the packet containing handling result will be transmitted, and transmitting the packet to the calculating node most nearby the detected address connecting to the calculating node within the replacing node.

检测故障计算节点；将与故障节点形成链路的IO节点设置为由通过向故障节点地址添加一维而获得的地址所确定的替换节点，将替换节点通知给与故障节点相邻的节点；当一个相邻节点已经接收到分组时，将寻址到故障节点的分组路由到替换节点；在替换节点中处理由到达替换节点的分组所确定的作业；和使替换节点找出含有作业处理结果的分组应当被发送到的计算节点的地址，并将该分组发送到连接到替换节点的计算节点中地址最接近所发现地址的计算节点。

The invention relates to a node marking method in a wireless Mesh network, including that a first node transmits connection request information; a second node returns to connection response information or selects an undistributed correlation sign to mark the connection relation and return to one connection response information; the first node judges whether the correlation sign is conflicted with a distributed correlation sign or not, if yes, then retransmitting is carried out; the first node or the second node transmits information to a correspondent node; the correspondent node searches a corresponding transmitting node from a local record according to the analyzed MAC address and searches a Mesh node mark; by judging according to the mark, if no bit position is corresponding to the Mesh node mark or the corresponding bit position is set as 'no', which means that no data is transmitted to the correspondent node; otherwise, data is transmitted to the correspondent node.

本发明涉及无线Mesh网络中的节点标识方法，包括第一节点发送连接请求消息；第二节点返回连接响应消息，或者选择一个未分配的关联标志来标识连接关系，返回一个连接响应消息，第一节点判断关联标志与已分配的关联标志是否冲突，如是则重新发送；第一或第二节点向对端节点发送消息；对端节点根据解析出的MAC地址从本地记录中查找对应的发送节点，并查找Mesh节点标识；根据标识进行判断，若没有与Mesh节点标识对应的比特位或对应的比特位设置为&否&，则表示没有要发送给对端节点的数据；否则表示有。

Supposing processing information as a task of node,power constraints of node is considered,and node uses way of awaking/sleeping,during awaking assureed that sensor node accomplishes task and cluster head node can schedule multi-task of sensor node.will resolve such problem:before satisfying multi-tasks deadline invaliding of sensor node,how to feasibly schedule schedule algorithm of improving Rate-Monotonicand dynamic Preemptive Earliest Deadline First Algorithm,via concrete example are presented,The process of algorithm achieving is explained.

假定每个节点对信息的处理看作是一个任务，考虑节点能量限制，节点采用唤醒/休眠机制，在唤醒期间确保节点任务完成，簇头节点能够调度处理多个传感器节点的任务。文中解决的问题：在满足多个传感器节点任务处理的截止期失效前，簇头节点如何合理的调度任务，提出了改进的 RM(rate-monotonic)调度算法和动态的抢占式最早截止期优先任务调度算法(Preemptive Earliest Deadline First Algorithm，PEDFA)。

与child node相关的网络解释 [注：此内容来源于网络，仅供参考]

child node：子节点

您应仔细考虑您与客户之间现有策略来决定子节点 (child node) 能否继承母节点 (parent node)的配置设置,或忽略母节点的设允许该角色修改注册退休储蓄计划 (RRSP) 项目,即加拿大相当于美国 401(k)的立法.

child node：下级节点

child mode 子模式 | child node 下级节点 | child number 子女编号

child node：选取当前节点的所有子节点

child::text() 选取当前节点的所有文本子节点 | child::node() 选取当前节点的所有子节点 | descendant::book 选取当前节点的所有 book 后代

child node：子结点

cardinal number 基数 | child node 子结点 | ciphertext 密文

firstChild Returns the first child node of the element：返回单元中第一个子节点

childNodes Returns an array of all child nodes of the e... | firstChild Returns the first child node of the element.返回单元中第一个子节点. | getAttribute( aAttributeName ) Returns the value for the s...