Sciweavers

4957 search results - page 318 / 992
» Simplifying Distributed System Development
Sort
View
MOBIHOC
2002
ACM
16 years 4 days ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
IMC
2006
ACM
15 years 6 months ago
binpac: a yacc for writing application protocol parsers
A key step in the semantic analysis of network traffic is to parse the traffic stream according to the high-level protocols it contains. This process transforms raw bytes into s...
Ruoming Pang, Vern Paxson, Robin Sommer, Larry L. ...
ISPA
2005
Springer
15 years 6 months ago
Hybrid Authentication and Key Management Scheme for WSANs
:Wireless Sensor and Actor Networks (WSANs) consist of three types of nodes with different capabilities and functions. Because of these heterogeneities, current network security ...
Xiaomei Cao, Mao Lin Huang, YueQuan Chen, Guihai C...
117
Voted
EUROSEC
2010
ACM
15 years 5 months ago
Practical protection for personal storage in the cloud
We present a storage management framework for Web 2.0 services that places users back in control of their data. Current Web services complicate data management due to data lock-in...
Neal H. Walfield, Paul T. Stanton, John Linwood Gr...
104
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
Turning Heterogeneity into an Advantage in Overlay Routing
Abstract— Distributed hash table (DHT)-based overlay networks, represented by Pastry, CAN, and Chord, offer an administration-free and fault-tolerant application-level overlay ne...
Zhichen Xu, Mallik Mahalingam, Magnus Karlsson