Sciweavers

254 search results - page 19 / 51
» On randomized one-round communication complexity
Sort
View
FOCS
2002
IEEE
14 years 18 days ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
ICNP
2009
IEEE
14 years 2 months ago
ESC: Energy Synchronized Communication in Sustainable Sensor Networks
—With advances in energy harvesting techniques, it is now feasible to build sustainable sensor networks (SSN) to support long-term applications. Unlike battery-powered sensor net...
Yu Gu, Ting Zhu, Tian He
MOBIHOC
2012
ACM
11 years 10 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
NOSSDAV
2009
Springer
14 years 2 months ago
Random network coding on the iPhone: fact or fiction?
In multi-hop wireless networks, random network coding represents the general design principle of transmitting random linear combinations of blocks in the same “batch” to downs...
Hassan Shojania, Baochun Li
GLOBECOM
2009
IEEE
14 years 2 months ago
Reusable Set Constructions Using Randomized Dissolvent Templates for Biometric Security
—The emerging biometric cryptography has gained significant interests for key management and privacy protection, but the previously proposed schemes using set metrics for finge...
Jinyang Shi, Kwok-Yan Lam, Ming Gu, Husheng Li