Sciweavers

947 search results - page 157 / 190
» Fault Tolerant Computation on Ensemble Quantum Computers
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
IPPS
2005
IEEE
14 years 1 months ago
A Novel QoS Multicast Model in Mobile Ad Hoc Networks
Multicast applications for large-scale Mobile Ad hoc NETworks (MANETs) require an efficient and effective Quality of Service (QoS)-aware multicast model. The new requirements to ...
Guojun Wang, Jiannong Cao, Lifan Zhang, Keith C. C...
ICNP
2000
IEEE
13 years 12 months ago
Convergent Multi-Path Routing
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
Jorge Arturo Cobb
DAC
2006
ACM
13 years 11 months ago
Steiner network construction for timing critical nets
Conventionally, signal net routing is almost always implemented as Steiner trees. However, non-tree topology is often superior on timing performance as well as tolerance to open f...
Shiyan Hu, Qiuyang Li, Jiang Hu, Peng Li
EURONGI
2006
Springer
13 years 11 months ago
Randomized Self-stabilizing Algorithms for Wireless Sensor Networks
Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of w...
Volker Turau, Christoph Weyer