255 search results - page 25 / 51 » infocom 2009 |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
89
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— Privacy threat is one of the critical issues in network coding, where attacks such as traffic analysis can be easily launched by a malicious adversary once enough encoded packe...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
: Applications such as Second Life require massive deployment of servers worldwide to support a large number of users. We investigate experimentally how Peer-to-Peer (P2P) communic...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—This paper presents a new desynchronization algorithm aimed at providing collision-free transmission scheduling for single-hop and acyclic multi-hop wireless sensor netw...