Random graph models for wireless and social networks
Matthias Grossglauser · 2012
Operating large-scale social applications over opportunistic wireless networks entails many fascinating engineering challenges. We strive for robust and efficient algorithms for specific problems like opportunistic forwarding, routing, or publish-subscribe, and we want to ascertain global properties like security, privacy, fairness, and high performance. One particular set of challenges concerns the scalability of this whole endeavor: is it fundamentally possible for such applications and underlying methods to scale up to large networks, without jeopardizing desirable system properties?