658 search results - page 92 / 132 » Lower bounds for sorting networks |
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
IPCCC
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
The growing reliance on services provided by software applications places a high premium on the reliable and efficient operation of these applications. A number of these applicat...