279 search results - page 4 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
IPSN
2005
Springer
13 years 10 months ago
2005
Springer
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
TWC
2008
13 years 5 months ago
2008
Abstract-- In this paper, we first present an analytical procedure for the computation of the node isolation probability and coverage in an ad hoc network in the presence of channe...
ALGOSENSORS
2007
Springer
13 years 11 months ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
ADHOC
2007
13 years 5 months ago
2007
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...