In both approaches, the link weight is the minimum transmit power required by a node to reach its neighbor for building the minimum power based tree.
In the Peer Model, constraint-based routing produces a link weight for each link in the network.
Since the routing metric of a path is the same as the aggregated link weight of the corresponding virtual links and the weight assignments of the virtual links are isotonic, efficient algorithms can find minimum weight paths.
Minimum link quality (MinLQ) <4 octets>.
Consequently, based on these link weight assignments, the MC-NSRLG problem in Fig. 8 can be reduced to the SP-SRLG problem in Fig. 7, similar to the proof of the MCDCM problem in "Minimum cuts in correlated networks" section.
"Correlated link weight models" section introduces our two correlated link weight models.
The minimum link quality allows the identification of paths with link quality bottlenecks as well as to place minimum bounds on the acceptable link quality.
Thickness of lines indicates absolute value of link weight.
The link weight associated with a link is defined as the largest flow weight on the link, where the flow weight on a link is the queue backlog differential for the flow between the two endpoints of the link.
This link weight setting also applies to more than two links.
