Sciweavers

2200 search results - page 36 / 440
» Hop Integrity in Computer Networks
Sort
View
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
14 years 29 days ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
EWSN
2007
Springer
14 years 7 months ago
An Energy-Efficient K-Hop Clustering Framework for Wireless Sensor Networks
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
Quanbin Chen, Jian Ma, Yanmin Zhu, Dian Zhang, Lio...
PDPTA
2004
13 years 9 months ago
A Case for Queue-to-Queue, Back-Pressure-Based Congestion Control for Grid Networks
Standard "new-Reno" TCP faces some performance limitations in very high throughput IP WAN networks, (e.g., computing grids) due to a long end-to-end congestion feedback l...
Marc Herbert, Pascale Vicat-Blanc Primet
ADHOCNOW
2006
Springer
14 years 1 months ago
ROAR: A Multi-rate Opportunistic AODV Routing Protocol for Wireless Ad-Hoc Networks
In this paper, we outline a simple approach, called ROAR, that enables the Ad-Hoc On-Demand Distance Vector (AODV) routing protocol to strengthen its routes by recruiting neighbors...
Kwan Wu Chin, Darryn Lowe
WS
2005
ACM
14 years 1 months ago
Secure time synchronization service for sensor networks
In this paper, we analyze attacks on existing time synchronization protocols for wireless sensor networks. We propose a secure time synchronization toolbox to counter these attack...
Saurabh Ganeriwal, Srdjan Capkun, Chih-Chieh Han, ...