… We propose a novel model of the usefulness of a two-hop neighbor link, called link utility,
LU, which considers the link minimum residual bandwidth and its loss rate to estimate the link …

… and utility implication to publish a user as the source of a link … We assume that all content
information about a node, such as the … “indirect neighbors” does not conflict with our link privacy …

… Link prediction also has many applications in different domains like information retrieval, …
the given agent x , that is, utility in our model is considered from more subjective viewpoints. …

… have been proposed to assess the utility of a node to deliver a … link strength, we choose to
not consider it here, for simplicity. … For all three traces, we ignore logged timing information and …

… have just local information about their neighbors and the state … by choosing a set of neighbors
that maximizes its utility in (3), … conclude that every link in G is in fact a cut link. This means …

… In terms of information flow, a link that is available is one that … simple count of neighbors by
weighting rarer neighbors more … utility, the similarity utility, and the tie strength utility and how …

… ID based encountering information easily since neighbor nodes … cannot achieve such a goal
since it can be linked … node claim to have higher routing utility for itself to fetch packets for it. …

… The existence of a link (u, v)∈E also means (v, u)∈E, and that … called one-hop neighbors
of each other. The set of one-hop … -hop neighbor are called two-hop neighbors of each other. …

… neighbor discovery would fail due to some uncontrollable factors such as hardware errors or
sudden interruptions, which are considered as the unreliable link in … to get information about …

… that aggregates the outputs of several utility subfunctions r(ν, i… , and compute the mutual
information between the neighbor … as a neighbor scoring function, since there is no obvious link …