TTLed random walks for collaborative monitoring in mobile and social networks
From MaRDI portal
Publication:2913793
DOI10.1007/978-1-4614-0754-6_17zbMATH Open1248.91082OpenAlexW131441606MaRDI QIDQ2913793FDOQ2913793
Authors: Yaniv Altshuler, Shlomi Dolev, Yuval Elovici
Publication date: 27 September 2012
Published in: Handbook of Optimization in Complex Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0754-6_17
Recommendations
- On early detection of strong infections in complex networks
- Secure peer sampling
- A social network based patching scheme for worm containment in cellular networks
- Modeling the propagation of mobile malware on complex networks
- Hop limited epidemic-like information spreading in mobile social networks with selfish nodes
Cites Work
- AHBP: An efficient broadcast protocol for mobile ad hoc networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Real-time heuristic search
- Title not available (Why is that?)
- A simple population protocol for fast robust approximate majority
- Theory of optimal search
- Title not available (Why is that?)
- The broadcast storm problem in a mobile ad hoc network
- Spanders: distributed spanning expanders
- The diameter of sparse random graphs
- On the cover time of planar graphs
- Static and expanding grid coverage with ant robots: complexity results
- Clock synchronization with faults and recoveries (extended abstract)
- Secure acknowledgment aggregation and multisignatures with limited robustness
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: TTLed random walks for collaborative monitoring in mobile and social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913793)