TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks

DOI10.1007/978-1-4614-0754-6_17zbMath1248.91082OpenAlexW131441606MaRDI QIDQ2913793

Yuval Elovici, Yaniv Altshuler, Shlomi Dolev

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

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple population protocol for fast robust approximate majority
• Spanders: distributed spanning expanders
• Static and expanding grid coverage with ant robots: complexity results
• Theory of optimal search
• On the cover time of planar graphs
• The broadcast storm problem in a mobile ad hoc network
• Secure acknowledgment aggregation and multisignatures with limited robustness
• Real-time heuristic search
• Clock synchronization with faults and recoveries (extended abstract)
• The diameter of sparse random graphs
• AHBP: An efficient broadcast protocol for mobile ad hoc networks

This page was built for publication: TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks