Sciweavers

1434 search results - page 26 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
DCOSS
2008
Springer
13 years 9 months ago
An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors
We consider a mobile sensor network monitoring a spatio-temporal field. Given limited caches at the sensor nodes, the goal is to develop a distributed cache management algorithm to...
Hany Morcos, George Atia, Azer Bestavros, Ibrahim ...
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 9 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
INFOCOM
2005
IEEE
14 years 1 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
IPPS
2000
IEEE
13 years 12 months ago
Transient Analysis of Dependability/Performability Models by Regenerative Randomization with Laplace Transform Inversion
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...
Juan A. Carrasco
ISCC
2003
IEEE
14 years 24 days ago
Wireless Token Ring Protocol-Performance Comparison with IEEE 802.11
The paper presents the performance advantage of Wireless Token Ring Protocol (WTRP) versus IEEE 802.11 in DCF mode. WTRP is a medium access control (MAC) protocol and is designed ...
Mustafa Ergen, Duke Lee, Raja Sengupta, Pravin Var...