Sciweavers

10950 search results - page 1852 / 2190
» Future wireless networks
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CIDR
2007
141views Algorithms» more  CIDR 2007»
15 years 8 months ago
Data-Driven Processing in Sensor Networks
Wireless sensor networks are poised to enable continuous data collection on unprecedented scales, in terms of area location and size, and frequency. This is a great boon to field...
Adam Silberstein, Gregory Filpus, Kamesh Munagala,...
ADHOC
2007
144views more  ADHOC 2007»
15 years 7 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
SCN
2008
Springer
147views Communications» more  SCN 2008»
15 years 6 months ago
Privacy-preserving secure relative localization in vehicular networks
Relative location information helps build vehicle topology maps. Such maps provide location information of nearby vehicles to drivers. In building a vehicle topology, one must cons...
Lei Tang, Xiaoyan Hong, Phillip G. Bradford
JSAC
2010
166views more  JSAC 2010»
15 years 5 months ago
Phero-trail: a bio-inspired location service for mobile underwater sensor networks
A SEA Swarm (Sensor Equipped Aquatic Swarm) moves as a group with water current and enables 4D (space and time) monitoring of local underwater events such as contaminants and intr...
Luiz Filipe M. Vieira, Uichin Lee, Mario Gerla
« Prev « First page 1852 / 2190 Last » Next »