—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
—In this paper, we give a global perspective of multicast capacity and delay analysis in Mobile Ad-hoc Networks (MANETs). Specifically, we consider two node mobility models: (1)...
—Opportunistic ad-hoc communication enables portable devices such as smartphones to effectively exchange information, taking advantage of their mobility and locality. The nature ...
Gjergji Zyba, Geoffrey M. Voelker, Stratis Ioannid...
—In this paper we model the digital rights management (DRM) for peer-to-peer streaming (P2PS) systems as a game. We construct the DRM game from both content service provider (CSP...
—We propose SocialFilter, a trust-aware collaborative spam mitigation system. Our proposal enables nodes with no email classification functionality to query the network on wheth...