We show that PageRank values on the Web follow a power law and develop detailed models for the Web graph that explain this observation, and moreover remain faithful to previously studied degree distributions.Expand

3rd Annual IEEE Communications Society on Sensorâ€¦

2006

TLDR

We address an important issue in node localization by showing that a highly incomplete set of inter-node distance measurements obtained in ad-hoc node deployments carries sufficient information for the accurate reconstruction of the missing distances, even in the presence of noise and sensor node failures.Expand

We propose a protocol for participants to build P2P networks in a distributed fashion, and prove that it results in connected networks of constant degree and logarithmic diameter.Expand

A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures.Expand

We present a distributed algorithm that constructs an O(log n)-approximate minimum spanning tree (MST) in any arbitrary network in almost optimal Ã•(D(G)) time.Expand