Sciweavers

867 search results - page 103 / 174
» Network Robustness and Graph Topology
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Network coding for large scale content distribution
— We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate...
Christos Gkantsidis, Pablo Rodriguez
GREC
2007
Springer
13 years 11 months ago
On the Joint Use of a Structural Signature and a Galois Lattice Classifier for Symbol Recognition
Abstract. In this paper, we propose a new approach for symbol recognition using structural signatures and a Galois Lattice as classifier. The structural signatures are based on top...
Mickaël Coustaty, Stéphanie Guillas, M...
ICDCS
2008
IEEE
14 years 2 months ago
On the Longest RNG Edge of Wireless Ad Hoc Networks
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
Peng-Jun Wan, Lixin Wang, F. Frances Yao, Chih-Wei...
MOBICOM
2003
ACM
14 years 1 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Hierarchical routing over dynamic wireless networks
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...