Sciweavers

235 search results - page 8 / 47
» Scalability of Routing Tables in Wireless Networks
Sort
View
GCC
2004
Springer
14 years 2 days ago
Gemini: Probabilistic Routing Algorithm in Structured P2P Overlay
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two p...
Ming Li, Jinfeng Hu, Haitao Dong, Dongsheng Wang, ...
MOBIHOC
2007
ACM
14 years 6 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
P2P
2005
IEEE
189views Communications» more  P2P 2005»
14 years 8 days ago
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...
Curt Cramer, Thomas Fuhrmann
SENSYS
2003
ACM
13 years 12 months ago
Taming the underlying challenges of reliable multihop routing in sensor networks
The dynamic and lossy nature of wireless communication poses major challenges to reliable, self-organizing multihop networks. These non-ideal characteristics are more problematic ...
Alec Woo, Terence Tong, David E. Culler
NCA
2006
IEEE
14 years 21 days ago
Congestion Control for Distributed Hash Tables
Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to pr...
Fabius Klemm, Jean-Yves Le Boudec, Karl Aberer