806 search results - page 118 / 162 » Lower Bounds on Correction Networks |
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Given a wireless sensor network (WSN) whose sensors are randomly and independently distributed in a bounded area following a homogeneous Poisson process with density ρ and eac...
SECON
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
ADHOCNOW
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this work we investigate bounds on throughput and delay performance of a scheduling protocol that derives its decisions from codes traditionally used to correct or det...
100
click to vote
TC
2008
14 years 11 months ago
2008
The design and performance of next-generation chip multiprocessors (CMPs) will be bound by the limited amount of power that can be dissipated on a single die. We present photonic n...