Sciweavers

58 search results - page 11 / 12
» Probabilistic Routing in Intermittently Connected Networks
Sort
View
SIMPRA
2011
14 years 4 months ago
Virtual segment: Store-carry-forward relay-based support for wide-area non-real-time data exchange
—In the Internet of the future, a flexible, dynamic combination of wireless and wired access networks is expected to be a key driver for enlarging the broadband communication se...
Shinya Yamamura, Akira Nagata, Masato Tsuru, Hitom...
WINET
2011
14 years 4 months ago
Sleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor...
Eyuphan Bulut, Ibrahim Korpeoglu
101
Voted
EJWCN
2011
133views more  EJWCN 2011»
14 years 4 months ago
CARNIVORE: A Disruption-Tolerant System for Studying Wildlife
—This paper presents CARNIVORE, a system for in-situ, yet unobtrusive monitoring of cryptic, difficult-tocatch/observe wildlife in their natural habitat. CARNIVORE consists of a...
Matthew Rutishauser, Vladislav Petkov, Jay Boice, ...
ADHOC
2007
144views more  ADHOC 2007»
14 years 9 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
DFT
2007
IEEE
86views VLSI» more  DFT 2007»
15 years 3 months ago
Production Yield and Self-Configuration in the Future Massively Defective Nanochips
We address two problems in this work, namely, 1) the resilience challenge in the future chips made up of massively defective nanoelements and organized in replicative multicore ar...
Piotr Zajac, Jacques Henri Collet