1528 search results - page 293 / 306 » On Signatures for Communication Graphs |
IPSN
2011
Springer
13 years 1 days ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
EUROSYS
2010
ACM
14 years 2 months ago
2010
ACM
The deluge of huge data sets such as those provided by
sensor networks, online transactions, and the web provide
exciting opportunities for data analysis. The scale of the
data ...
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...