2149 search results - page 19 / 430 » Distributed Algorithms for Approximating Wireless Network Ca... |
PODC
2006
ACM
15 years 5 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
118
click to vote
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract –In this paper, a variational message passing framework is proposed for Markov random fields, which is computationally more efficient and admits wider applicability comp...
95
Voted
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
—Wireless ad hoc networks require bidirectional data transmission to support two-way traffic and control functions like packet acknowledgement. Most prior work on the capacity o...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...