658 search results - page 57 / 132 » Lower bounds for sorting networks |
ADHOCNOW
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of efficient alarm protocol for ad-hoc radio networks consisting of devices that try to gain access for transmission through a shared radio communication ch...
ADHOC
2008
13 years 8 months ago
2008
In this paper, we study asymptotic uniform data-rate guarantees in large wireless networks from an information-theoretic viewpoint. We consider the following question: what is the...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—Relay networks have received considerable attention recently, especially when limited size and power resources impose constraints on the number of antennas within a wireless sen...
ISAAC
2001
Springer
14 years 6 days ago
2001
Springer
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...
OPODIS
2004
13 years 9 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...