243 search results - page 30 / 49 » Communication under Strong Asynchronism |
137
click to vote
RSA
1998
15 years 5 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
133
click to vote
DEDS
2008
15 years 5 months ago
2008
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
156
click to vote
GLOBECOM
2009
IEEE
16 years 2 days ago
2009
IEEE
Abstract—Delay Tolerant Networks (DTNs) are wireless networks in which at any given time instance, the probability of having a complete path from a source to destination is low d...
150
Voted
ICC
2009
IEEE
16 years 1 days ago
2009
IEEE
—In a wireless sensor network, an adversary equipped monitoring antenna can easily overhear packets, which may facilitate identifying the directions of packet flows and trace to ...
170
click to vote
CCS
2010
ACM
15 years 4 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...