Sciweavers

141 search results - page 7 / 29
» cn 2007
Sort
View
CN
2007
124views more  CN 2007»
13 years 9 months ago
Cryptographic techniques for mobile ad-hoc networks
In this paper, we propose some cryptographic techniques to securely set up a mobile ad-hoc network. The process is fully self-managed by the nodes, without any trusted party. New ...
Vanesa Daza, Javier Herranz, Paz Morillo, Carla R&...
CN
2007
102views more  CN 2007»
13 years 9 months ago
The "Global-ISP" paradigm
We present a new paradigm, called “Global ISP” (G-ISP). Its goal is to solve, or at least alleviate, problems of inter-domain routing, such as slow convergence, and lack of Qo...
Reuven Cohen, Amnon Shochot
CN
2007
104views more  CN 2007»
13 years 9 months ago
Performance analysis of the AntNet algorithm
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of a...
S. S. Dhillon, Piet Van Mieghem
CN
2007
99views more  CN 2007»
13 years 9 months ago
Reducing the cost of applying adaptive test cases
The testing of a state-based system may involve the application of a number of adaptive test cases. Where the implementation under test (IUT) is deterministic, the response of the...
Robert M. Hierons, Hasan Ural
CN
2007
148views more  CN 2007»
13 years 9 months ago
Optimizing random walk search algorithms in P2P networks
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Nabhendra Bisnik, Alhussein A. Abouzeid