— This paper discusses a joint decentralized clustering and ranging algorithm for wireless ad-hoc sensor networks. Each sensor uses a random waiting timer and local criteria to d...
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Many datasets can be described in the form of graphs or networks where nodes in the graph represent entities and edges represent relationships between pairs of entities. A common ...
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...