21 search results - page 3 / 5 » A probabilistic model of k-coverage in minimum cost wireless... |
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—In wireless ad-hoc sensor networks, an important issue often faced in geographic greedy forwarding routing is the “local minimum phenomenon” which is caused by deployment ho...
INFOCOM
2009
IEEE
14 years 1 days ago
2009
IEEE
— This paper presents Pirrus, a replica management system that addresses the problem of providing data availability on a wireless sensor network. Pirrus uses probabilistic failur...
DCOSS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
JCP
2008
13 years 5 months ago
2008
In sensor networks, continuous query is commonly used for collecting periodical data from the objects under monitoring. This sort of queries needs to be carefully designed, in orde...
ICASSP
2009
IEEE
14 years 4 days ago
2009
IEEE
Resource limitations in wireless sensor networks have put stringent constraints on distributed signal processing. In this paper, we propose a cluster-based decentralized variation...