Sciweavers

2214 search results - page 9 / 443
» Dynamic Protocol Recovery
Sort
View
ADHOC
2006
167views more  ADHOC 2006»
13 years 7 months ago
Bypass routing: An on-demand local recovery protocol for ad hoc networks
Abstract--On-demand routing protocols for ad hoc networks reduce the cost of routing in high mobility environments. However, route discovery in on-demand routing is typically perfo...
Cigdem Sengul, Robin Kravets
MSN
2005
Springer
14 years 1 months ago
A Low Overhead Ad Hoc Routing Protocol with Route Recovery
Many routing protocols have been designed for Ad Hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. In the paper, we pro...
Chang-Wu Yu, Tung-Kuang Wu, Rei-Heng Cheng, Po Tsa...
IC
2003
13 years 9 months ago
Extensions of Magic Square Using Recovery Nodes Against Node Failures
Magic Square is a ppeer-to-peer protocol for searching resources. The recovery cost of Magic Square is high and the system doesn’t recover the failure in simultaneous neighbor n...
Hyun-ju Lee, Il-dong Jung, Young-song Son, Kyongso...
CISC
2006
Springer
103views Cryptology» more  CISC 2006»
13 years 11 months ago
Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
Christophe Tartary, Huaxiong Wang
SAINT
2008
IEEE
14 years 2 months ago
Analysis of a Self-Organizing Maintenance Algorithm under Constant Churn
An increasing proportion of distributed hash tables (DHTs) maintain additional routing information regarding each node’s immediately surrounding neighbors in a network overlay. ...
Richard Price, Tien Tuan Anh Dinh, Georgios K. The...