Sciweavers

2814 search results - page 478 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
DSN
2008
IEEE
14 years 3 months ago
Probabilistic quorum systems in wireless ad hoc networks
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
Roy Friedman, Gabriel Kliot, Chen Avin
IPPS
2008
IEEE
14 years 3 months ago
Providing security to the Desktop Data Grid
Volunteer Computing is becoming a new paradigm not only for the Computational Grid, but also for institutions using production-level Data Grids because of the enormous storage pot...
Jesus Luna, Michail Flouris, Manolis Marazakis, An...
TRIDENTCOM
2005
IEEE
14 years 2 months ago
Wireless Link SNR Mapping Onto An Indoor Testbed
To facilitate a broad range of experimental research on novel protocols and application concepts, we employ an indoor wireless testbed to emulate the performance of the real-world...
Jing Lei, Roy D. Yates, Larry J. Greenstein, Hang ...
MOBICOM
2004
ACM
14 years 2 months ago
Power conservation and quality of surveillance in target tracking sensor networks
Target tracking is an important application of wireless sensor networks. In this application, the sensor nodes collectively monitor and track the movement of an event or target ob...
Chao Gui, Prasant Mohapatra
CIKM
2004
Springer
14 years 2 months ago
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Peer-to-peer Data Networks (PDNs) are large-scale, selforganizing, distributed query processing systems. Familiar examples of PDN are peer-to-peer file-sharing networks, which su...
Farnoush Banaei Kashani, Cyrus Shahabi