295 search results - page 23 / 59 » An approximation algorithm for the wireless gathering proble... |
88
Voted
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
IEEECIT
2006
IEEE
15 years 3 months ago
2006
IEEE
Coverage configuration is an important issue in large scale wireless sensor networks (WSNs). Existing coverage configuration methods are generally based on the concept of physical...
107
click to vote
TMC
2010
14 years 8 months ago
2010
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
IPSN
2009
Springer
15 years 4 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
79
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...