Sciweavers

2485 search results - page 285 / 497
» A Communicating Tree Model for Generating Network Applicatio...
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 9 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
INFOCOM
2003
IEEE
15 years 9 months ago
IMPORTANT: A framework to systematically analyze the Impact of Mobility on Performance of RouTing protocols for Adhoc NeTworks
— A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any existing infrastructure. Since not many MANETs are curren...
Fan Bai, Narayanan Sadagopan, Ahmed Helmy
GLOBECOM
2007
IEEE
15 years 10 months ago
An Analytical Model for a Book-Ahead Bandwidth Scheduler
— Optical networks with book-ahead bandwidth schedulers are being deployed to meet the high-speed and predictable-service networking requirements of applications in the scienti...
Xiangfei Zhu, Mark E. McGinley, Tao Li, Malathi Ve...
ADHOC
2008
135views more  ADHOC 2008»
15 years 4 months ago
Rapid design and evaluation framework for wireless sensor networks
The diversity of applications and typically scarce node resources set very tight constraints to Wireless Sensor Networks (WSN). It is not possible to fulfill all requirements with...
Mauri Kuorilehto, Marko Hännikäinen, Tim...
SENSYS
2003
ACM
15 years 9 months ago
Bluetooth and sensor networks: a reality check
The current generation of sensor nodes rely on commodity components. The choice of the radio is particularly important as it impacts not only energy consumption but also software ...
Martin Leopold, Mads Bondo Dydensborg, Philippe Bo...