345 search results - page 57 / 69 » Probabilistic Coverage in Wireless Sensor Networks |
MOBIHOC
2004
ACM
14 years 8 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
INFOCOM
2011
IEEE
13 years 4 hour ago
2011
IEEE
—In wireless sensor networks, multiple-coverage, in which each point is covered by more than one sensor, is often required to improve detection quality and achieve high fault tol...
ADHOC
2006
13 years 8 months ago
2006
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
MOBICOM
2009
ACM
14 years 3 months ago
2009
ACM
Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has ...
DCOSS
2011
Springer
12 years 8 months ago
2011
Springer
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...