In this paper we present a novel probabilistic protocol for path discovery in Mobile Ad Hoc Networks (MANETs). The protocol implements what we call a polarized gossiping algorithm...
d abstract) Lars Arge1 , Darren Erik Vengroff2 , and Jeffrey Scott Vitter3 1 BRICS† , Department of Computer Science, University of Aarhus, Aarhus, Denmark 2 Department of Comp...
Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vit...
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...
A user located in a congested area of a wireless LAN may benefit by moving to a less-crowded area and using a less-loaded access point. This idea has gained attention from research...
Abstract-- We introduce in this paper CHESS, an applicationaware space for enhanced scalable services in overlay networks. In this new space, the proximity of peers is determined a...