专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

21. 发明申请

US20110116389A1 Ranking Nodes in Networks with Topologies Arranged as Directed Acyclic Graphs 有权
标题翻译：将网络中的节点排列为布置为定向非循环图的拓扑
公开(公告)号：US20110116389A1
公开(公告)日：2011-05-19
申请号：US12618235
申请日：2009-11-13
申请人： Zhifeng Tao , Di Wang , Jinyun Zhang
发明人： Zhifeng Tao , Di Wang , Jinyun Zhang
IPC分类号： H04L12/26
CPC分类号： H04W40/22 , H04L45/18 , H04W40/125 , H04W40/248
摘要： Embodiments of the invention disclose a system and a method for determining a rank of a node in a multi-hop wireless network, wherein the network includes a gateway node, client nodes, and relay nodes, wherein a node p(i) is a default parent of the node i having a rank, and the network uses a directed acyclic graph (DAG) topology. The method comprises steps of transmitting at least one data packet from the node to the default parent node over a wireless link; counting a number of successful transmissions of most recent transmissions of data packets; determining an expected transmission time (ETX) for the wireless link based on the number of successful transmissions in the most recent transmissions; and assigning a rank R(i) to the node based on the rank of the parent node and the ETX.
摘要翻译：本发明的实施例公开了一种用于确定多跳无线网络中的节点的等级的系统和方法，其中所述网络包括网关节点，客户端节点和中继节点，其中节点p（i）是默认的具有等级的节点的父节点，并且网络使用有向非循环图（DAG）拓扑。该方法包括以下步骤：通过无线链路将来自节点的至少一个数据分组发送到默认父节点; 计数数据分组的最近传输的成功传输的数量; 基于最近传输中成功传输的数量确定无线链路的预期传输时间（ETX）; 并且基于父节点和ETX的等级将节点R（i）分配给节点。

IPRDB

热门服务

关于我们

友情链接

联系方式