Sciweavers

456 search results - page 7 / 92
» On Routing in Distributed Hash Tables
Sort
View
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...
IEEEAMS
2003
IEEE
14 years 1 months ago
Rich and Scalable Peer-to-Peer Search with SHARK
SHARK is a novel concept and middleware service for search in peer-to-peer (P2P) networks. Rather than flooding a network like Gnutella or imposing numerical IDs on objects like d...
Jan Mischke, Burkhard Stiller
ADHOCNETS
2009
Springer
14 years 3 months ago
DHT-Based Detection of Node Clone in Wireless Sensor Networks
Abstract. Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left...
Zhijun Li, Guang Gong
INFOCOM
2006
IEEE
14 years 2 months ago
Tunnel Vector: A New Routing Algorithm with Scalability
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
Cheng-Jia Lai, Richard R. Muntz