Ranking nodes in networks with topologies arranged as directed acyclic graphs
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Sep 18, 2012
Grant Date -
May 19, 2011
app pub date -
Nov 13, 2009
filing date -
Nov 13, 2009
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
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.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully