首页>
外国专利>
Ranking nodes in networks with topologies arranged as directed acyclic graphs
Ranking nodes in networks with topologies arranged as directed acyclic graphs
展开▼
机译:使用有向无环图排列拓扑的网络中的节点排名
展开▼
页面导航
摘要
著录项
相似文献
摘要
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.
展开▼