14 search results - page 2 / 3 » Distance Distributions in Finite Uniformly Random Networks: ... |
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
Collaborative beamforming has been recently introduced in the context of wireless sensor networks (WSNs) to increase the transmission range of individual sensor nodes. In this pap...
MST
2010
12 years 11 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
OPODIS
2007
13 years 6 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...