Sciweavers

2926 search results - page 34 / 586
» Partially Optimal Routing
Sort
View
ICPP
2000
IEEE
14 years 26 days ago
A Fault-Tolerant Adaptive and Minimal Routing Approach in n-D Meshes
In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an ...
Jie Wu
PET
2005
Springer
14 years 1 months ago
Message Splitting Against the Partial Adversary
We review threat models used in the evaluation of anonymity systems’ vulnerability to traffic analysis. We then suggest that, under the partial adversary model, if multiple packe...
Andrei Serjantov, Steven J. Murdoch
TWC
2008
137views more  TWC 2008»
13 years 8 months ago
Reliability and route diversity in wireless networks
Abstract -We study the problem of communication reliability and diversity in multi-hop wireless networks. Our aim is to develop a new network model that better takes into account t...
Amir Ehsan Khandani, Jinane Abounadi, Eytan Modian...
ISPA
2004
Springer
14 years 1 months ago
An Adaptive Routing Strategy Based on Dynamic Cache in Mobile Ad Hoc Networks
The dynamic changes of the topology caused by the movement of nodes makes routing become one of the key problems in the mobile Ad Hoc Networks (MANET). So how to optimize routing b...
YueQuan Chen, Xiaofeng Guo, QingKai Zeng, Guihai C...
ICOIN
2003
Springer
14 years 1 months ago
Information-Theoretic Bounds for Mobile Ad-hoc Networks Routing Protocols
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
Nianjun Zhou, Alhussein A. Abouzeid