Sciweavers

2068 search results - page 292 / 414
» Performance Analysis of a Distributed Wireless Access Scheme
Sort
View
93
Voted
PPOPP
1999
ACM
15 years 2 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
MOBISYS
2007
ACM
15 years 9 months ago
Vehicular opportunistic communication under the microscope
We consider the problem of providing vehicular Internet access using roadside 802.11 access points. We build on previous work in this area [18, 8, 5, 11] with an extensive experim...
David Hadaller, Srinivasan Keshav, Tim Brecht, Shu...
MOBIHOC
2005
ACM
15 years 9 months ago
Toward resilient security in wireless sensor networks
Node compromise poses severe security threats in wireless sensor networks. Unfortunately, existing security designs can address only a small, fixed threshold number of compromised...
Hao Yang, Fan Ye, Yuan Yuan, Songwu Lu, William A....
CCS
2004
ACM
15 years 3 months ago
On achieving software diversity for improved network security using distributed coloring algorithms
It is widely believed that diversity in operating systems, software packages, and hardware platforms will decrease the virulence of worms and the effectiveness of repeated applic...
Adam J. O'Donnell, Harish Sethu
109
Voted
NDSS
2008
IEEE
15 years 4 months ago
Halo: High-Assurance Locate for Distributed Hash Tables
We study the problem of reliably searching for resources in untrusted peer-to-peer networks, where a significant portion of the participating network nodes may act maliciously to...
Apu Kapadia, Nikos Triandopoulos