345 search results - page 61 / 69 » Probabilistic Coverage in Wireless Sensor Networks |
174
Voted
SECON
2008
IEEE
16 years 22 days ago
2008
IEEE
Stationary wireless sensor networks (WSNs) fail to scale when the area to be monitored is open (i.e borderless) and the physical phenomena to be monitored may migrate through a la...
143
click to vote
ADHOCNOW
2008
Springer
16 years 21 days ago
2008
Springer
Energy-efficient query dissemination plays an important role for the lifetime of sensor networks. In this work, we consider probabilistic flooding for query dissemination and deve...
177
Voted
GLOBECOM
2007
IEEE
16 years 21 days ago
2007
IEEE
Many of the routing protocols that have been designed for wireless ad-hoc networks focus on energy-efficiency and guaranteeing high throughput in a non-adversarial setting. Howev...
248
Voted
FBIT
2007
IEEE
16 years 21 days ago
2007
IEEE
In Wireless Sensor Networks (WSNs), address-based routing approaches often lead to severe problems due to node mobility, energy-saving sleep-cycles, and often missing or unreliabl...
178
Voted
ICDCS
2006
IEEE
16 years 12 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...