2149 search results - page 35 / 430 » Distributed Algorithms for Approximating Wireless Network Ca... |
104
click to vote
SIAMCOMP
1998
15 years 28 days ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
105
click to vote
NETCOOP
2009
Springer
15 years 7 months ago
2009
Springer
The fundamental limits on channel capacity form a barrier to the sustained growth on the use of wireless networks. To cope with this, multi-path communication solutions provide a p...
120
click to vote
SIGMETRICS
2010
ACM
15 years 6 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
123
click to vote
MOBIHOC
2008
ACM
16 years 26 days ago
2008
ACM
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...