Sciweavers

2149 search results - page 102 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 1 months ago
Distributed Consensus over Wireless Sensor Networks Affected by Multipath Fading
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
Gesualdo Scutari, Sergio Barbarossa
INFOCOM
1998
IEEE
15 years 5 months ago
Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...
Donpaul C. Stephens, Hui Zhang
MOR
2007
149views more  MOR 2007»
15 years 28 days ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
COMCOM
2006
114views more  COMCOM 2006»
15 years 1 months ago
A comparison of epidemic algorithms in wireless sensor networks
We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is nece...
Mert Akdere, Cemal Çagatay Bilgin, Ozan Ger...
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
15 years 7 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman