TTLed Random Walks for Collaborative Monitoring
2010, 2010 INFOCOM IEEE Conference on Computer Communications Workshops
https://doi.org/10.1109/INFCOMW.2010.5466697Abstract
In this paper we discuss the problem of collaborative monitoring of applications that are suspected of being malicious. New operating systems for mobile devices allow their users to download millions of new applications created by a great number of individual programmers and companies, some of which may be malicious or flawed. The importance of defense mechanisms against an epidemic spread of malicious applications in mobile networks was recently demonstrated by Wang et. al [21]. In many cases, in order to detect that an application is malicious, monitoring its operation in a real environment for a significant period of time is required. Mobile devices have limited computation and power resources and thus can monitor only a limited number of applications that the user downloads. In this paper we propose an efficient collaborative application monitoring algorithm called TPP-Time-To-Live Probabilistic Flooding, harnessing the collective resources of many mobile devices. Mobile devices activating this algorithm periodically monitor mobile applications, derive conclusion concerning their maliciousness, and report their conclusions to a small number of other mobile devices. Each mobile device that receives a message (conclusion) propagates it to one additional mobile device. Each message has a predefined TTL. The algorithm's performance is analyzed and its time and messages complexity are shown to be significantly lower compared to existing state of the art information propagation algorithms. The algorithm was also implemented and tested in a simulated environment.
References (21)
- F. Apap, A. Honig, S. Hershkop, E. Eskin, and S. Stolfo, Recent advances in intrusion detection, ch. Detecting Malicious Software by Monitoring Anomalous Windows Registry Accesses, pp. 36-53, Springer Berlin Heidelberg, 2002.
- M. Cagalj, J.P. Hubaux, and C. Enz, Minimum-energy broadcast in all- wireless networks: Np-completness and distribution issues, MOBICOM, 2002.
- F. Chung and L. Lu, The diameter of sparse random graphs, Advances in Applied Mathematics 26 (2001), 257-279.
- S. Crisostomo, J. Barros, and C. Bettstetter, Flooding the network: Multipoint relays versus network coding, 4th IEEE Intl. Conference on Circuits and Systems for Communications (ICCSC), 2008, pp. 119-124.
- S. Dolev and N. Tzachar, Spanders: Distributed spanning expanders, Proc. of the 25th ACM Symposium on Applied Computing (SAC-SCS), 2010.
- D. Ganesa, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker, An empirical study of epidemic algorithms in large scale multihop wireless networks -technical report ucla/csd-tr 02-0013, Technical report, UCLA Computer Science, 2002.
- R. Golding, D. Long, and J. Wilkes, The refdbms distributed biblio- graphic database system, In Proc. of Usenix94, 1994, pp. 47-62.
- Z. Haas, J. Halpern, and L. Li, Gossip-based ad-hoc routing, IEEE/ACM Transactions of networks 14 (2006), no. 3, 479-491.
- Hahnsang Kim, Joshua Smith, and Kang G. Shin, Detecting energy- greedy anomalies and mobile malware variants, MobiSys '08: Proceed- ing of the 6th international conference on Mobile systems, applications, and services (New York, NY, USA), ACM, 2008, pp. 239-252.
- J. Kleinberg, The wireless epidemic, Nature 449 (2007), 287-288.
- R. Korf, Real-time heuristic search, Artificial Intelligence 42 (1990), 189-211.
- R. Moskovitch, I. Gus, S. Pluderman, D. Stopel, C. Glezer, Y. Shahar, and Y. Elovici, Detection of unknown computer worms activity based on computer behavior using data mining, CISDA 2007. IEEE Symposium on Computational Intelligence in Security and Defense Applications, 2007, pp. 169-177.
- R. Moskovitch, S. Pluderman, I. Gus, D. Stopel, C. Feher, Y. Parmet, Y. Shahar, and Y. Elovici, Host based intrusion detection using ma- chine learning, 2007 IEEE Intelligence and Security Informatics, 2007, pp. 107-114.
- S. Ni, Y. Tseng, Y. Chen, and J. Sheu, The broadcast storm problem in a mobile ad hoc network, In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), 1999, pp. 151-162.
- L.V.A. Qayyum and A. Laouiti, Multipoint relaying for flooding broad- cast messages in mobile wireless networks, Proceedings of HICSS, 2002.
- Y. Sasson, D. Cavin, and A. Schiper, Probabilistic broadcas for flooding in wireless mobile ad-hoc networks, Proceedings of IEEE Wireless communication and networks (WCNC), 2003.
- Ivan Stojmenovic, Mahtab Seddigh, and Jovisa Zunic, Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks, IEEE Transactions on Parallel and Distributed Systems 13 (2002), no. 1, 14-25.
- R. van Renesse and K. Birman, Scalable management and data mining using astrolabe, In Proc. of the First International Workshop on Peer- to-Peer Systems (IPTPS02), 2002.
- Werner Vogels, Robbert van Renesse, and Ken Birman, The power of epidemics: robust communication for large-scale distributed systems, SIGCOMM Comput. Commun. Rev. 33 (2003), no. 1, 131-135.
- I.A. Wagner, Y. Altshuler, V. Yanovski, and A.M. Bruckstein, Coop- erative cleaners: A study in ant robotics, The International Journal of Robotics Research (IJRR) 27 (2008), no. 1, 127-151.
- P. Wang, M.C. Gonzalez, C.A. Hidalgo, and A.L. Barabasi, Understand- ing the spreading patterns of mobile phone viruses, Science 324 (2009), 1071-1075.