Sciweavers

1612 search results - page 93 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
SASN
2004
ACM
15 years 7 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
110
Voted
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 2 months ago
Competitive minimax universal decoding for several ensembles of random codes
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
Yaniv Akirav, Neri Merhav
DKE
2002
107views more  DKE 2002»
15 years 2 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
GLOBECOM
2008
IEEE
15 years 8 months ago
Throughput Analysis of Randomized Sleep Scheduling with Constrained Connectivity in Wireless Sensor Networks
Abstract—In this paper, we investigate and analyze the expected per-node throughput in a wireless sensor network under a randomized sleep scheduling framework with a connectivity...
Youngsang Kim, Changwoo Yang, Chun-Hung Liu
INFOCOM
2012
IEEE
13 years 4 months ago
Multiple random walks to uncover short paths in power law networks
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
Bruno F. Ribeiro, Prithwish Basu, Don Towsley