Sciweavers

3809 search results - page 367 / 762
» Randomized Broadcast in Networks
Sort
View
ICALP
2010
Springer
15 years 11 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
SIGMETRICS
2002
ACM
114views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Search and replication in unstructured peer-to-peer networks
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenke...
IJMC
2010
139views more  IJMC 2010»
15 years 5 months ago
A realistic mobility model for wireless networks of scale-free node connectivity
: Recently, researchers have discovered that many of social, natural and biological networks are characterized by scale-free powerlaw connectivity distribution and a few densely po...
Sunho Lim, Chansu Yu, Chita R. Das
INFOCOM
2010
IEEE
15 years 5 months ago
Resource Allocation over Network Dynamics without Timescale Separation
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
Alexandre Proutiere, Yung Yi, Tian Lan, Mung Chian...
PERCOM
2011
ACM
14 years 10 months ago
Privacy preservation schemes for querying wireless sensor networks
—In this work we study the problem of query privacy in large scale sensor networks. Motivated by a novel trust model in which clients query networks owned by trusted entities but...
Tassos Dimitriou, Ahmad Sabouri