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...
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
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...
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...
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...