Sciweavers

13214 search results - page 344 / 2643
» Pseudorandomness for network algorithms
Sort
View
TON
1998
116views more  TON 1998»
15 years 6 months ago
Explicit allocation of best-effort packet delivery service
— This paper presents the “allocated-capacity” framework for providing different levels of best-effort service in times of network congestion. The “allocatedcapacity” fra...
David D. Clark, Wenjia Fang
TSP
2010
15 years 1 months ago
Greedy gossip with eavesdropping
Abstract-- This paper presents greedy gossip with eavesdropping (GGE), a new average consensus algorithm for wireless sensor network applications. Consensus algorithms have recentl...
Deniz Üstebay, Boris N. Oreshkin, Mark Coates...
EWSN
2008
Springer
16 years 6 months ago
Efficient Clustering for Improving Network Performance in Wireless Sensor Networks
Clustering is an important mechanism in large multi-hop wireless sensor networks for obtaining scalability, reducing energy consumption and achieving better network performance. Mo...
Tal Anker, Danny Bickson, Danny Dolev, Bracha Hod
SWAT
2004
Springer
83views Algorithms» more  SWAT 2004»
16 years 4 days ago
Power Assignment in Radio Networks with Two Power Levels
We study the power assignment problem in radio networks, where each radio station can transmit in one of two possible power levels, corresponding to two ranges – short and long....
Paz Carmi, Matthew J. Katz
FOCS
2009
IEEE
16 years 1 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov