752 search results - page 64 / 151 » Faster approximation algorithms for the minimum latency prob... |
124
Voted
INFOCOM
2007
IEEE
15 years 9 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...
153
click to vote
JCO
2006
15 years 3 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
116
click to vote
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
122
click to vote
WASA
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
101
click to vote
WINET
2008
15 years 3 months ago
2008
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...