Please download the dossier by clicking on the dossier button x
×

Ranking Nodes in Networks with Topologies Arranged as Directed Acyclic Graphs

  • US 20110116389A1
  • Filed: 11/13/2009
  • Published: 05/19/2011
  • Est. Priority Date: 11/13/2009
  • Status: Active Grant
First Claim
Patent Images

1. A method for determining a rank of a node i 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 R(p(i)), and wherein a topology of the network is according to a directed acyclic graph (DAG), comprising steps of:

  • transmitting at least one data packet from the node i to the node p(i) over a link L(i, p(i));

    counting a number s of successful transmissions of m data packets, wherein m is a number of most recent transmissions from the node i to the node p(i);

    determining an expected transmission time (ETX) for the link L(i, p(i) according to ETX(i, p(i))=m/s; and

    assigning a rank R(i) to the node i as R(p(i))·

    ETX(i, p(i))+A, wherein A is a constant.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×