Sciweavers

13214 search results - page 333 / 2643
» Pseudorandomness for network algorithms
Sort
View
INFOCOM
2007
IEEE
16 years 1 months ago
Resilient Network Coding in the Presence of Byzantine Adversaries
Abstract— Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a mali...
Sidharth Jaggi, Michael Langberg, Sachin Katti, Tr...
ISPAN
1999
IEEE
15 years 11 months ago
Distributed Clustering for Ad Hoc Networks
A Distributed Clustering Algorithm DCA and a Distributed Mobility-Adaptive Clustering DMAC algorithm are presented that partition the nodes of a fully mobile network ad hoc networ...
Stefano Basagni
CCR
2008
88views more  CCR 2008»
15 years 6 months ago
Rethinking virtual network embedding: substrate support for path splitting and migration
Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. However, making efficient use of the underlying re...
Minlan Yu, Yung Yi, Jennifer Rexford, Mung Chiang
TON
2008
134views more  TON 2008»
15 years 6 months ago
Efficient broadcasting using network coding
Abstract-- We consider the problem of broadcasting in an adhoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Ou...
Christina Fragouli, Jörg Widmer, Jean-Yves Le...
TON
2012
13 years 9 months ago
A Joint Approach to Routing Metrics and Rate Adaptation in Wireless Mesh Networks
—This work proposes MARA, a joint method for automatic rate selection and route quality evaluation in Wireless Mesh Networks. This method targets at avoiding the problem of inacc...
Diego G. Passos, Célio V. N. Albuquerque