2149 search results - page 25 / 430 » Distributed Algorithms for Approximating Wireless Network Ca... |
120
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
117
click to vote
SIAMCOMP
2008
15 years 1 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
128
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
101
click to vote
TON
2010
14 years 8 months ago
2010
Abstract-- We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area, and analyze the scaling laws of their ...
120
click to vote
WOWMOM
2009
ACM
15 years 7 months ago
2009
ACM
Wireless mesh networks are primarily used to provide Internet access by sharing the Internet connections of a limited number of gateways. If traffic is routed in the mesh without...