TTLed Random Walks for Collaborative Monitoring
Name
Altshuler-2010-TTLed Random Walks for Collaborative Monitoring.pdf
Size
402.84 KB
Format
Adobe PDF
Checksum (MD5)
1d8571aabb9366941d78661d0520bba7
Author(s)
Altshuler, Yaniv
Dolev, Shlomia
Elovici, Yuval
Aharony, Nadav
Date Issued
March 2010
Journal
IEEE INFOCOM (IEEE Conference on Computer Communications) Workshops
Publisher
Institute of Electrical and Electronics Engineers
Citation
Altshuler, Y. et al. “TTLed Random Walks for Collaborative Monitoring.” INFOCOM IEEE Conference on Computer Communications Workshops , 2010. 2010. 1-6. © 2010, IEEE
Version
Final published version
Abstract
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. 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.
MIT Department
Massachusetts Institute of Technology. Media Laboratory
Program in Media Arts and Sciences (Massachusetts Institute of Technology)
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOMW.2010.5466697
