A Social Network Based Patching Scheme for Worm Containment in Cellular Networks
- 1 April 2009
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1476-1484
- https://doi.org/10.1109/infcom.2009.5062064
Abstract
Recently, cellular phone networks have begun allowing third-party applications to run over certain open-API phone operating systems such as Windows Mobile, Iphone and Google's Android platform. However, with this increased openness, the fear of rogue programs written to propagate from one phone to another becomes ever more real. This paper proposes a counter-mechanism to contain the propagation of a mobile worm at the earliest stage by patching an optimal set of selected phones. The counter-mechanism continually extracts a social relationship graph between mobile phones via an analysis of the network traffic. As people are more likely to open and download content that they receive from friends, this social relationship graph is representative of the most likely propagation path of a mobile worm. The counter mechanism partitions the social relationship graph via two different algorithms, balanced and clustered partitioning and selects an optimal set of phones to be patched first as those which have the capability to infect the most number of other phones. The performance of these partitioning algorithms is compared against a benchmark random partitioning scheme. Through extensive trace-driven experiments using real IP packet traces from one of the largest cellular networks in the US, we demonstrate the efficacy of our proposed counter-mechanism in containing a mobile worm.Keywords
This publication has 18 references indexed in Scilit:
- Detecting energy-greedy anomalies and mobile malware variantsPublished by Association for Computing Machinery (ACM) ,2008
- Can you infect me now?Published by Association for Computing Machinery (ACM) ,2007
- Analysis of the Reliability of a Nationwide Short Message ServicePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- On the effectiveness of automatic patchingPublished by Association for Computing Machinery (ACM) ,2005
- Modeling epidemic spreading in mobile environmentsPublished by Association for Computing Machinery (ACM) ,2005
- Internet quarantine: requirements for containing self-propagating codePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Graph partitioning models for parallel computingParallel Computing, 2000
- The Bluetooth radio systemIEEE Wireless Communications, 2000
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970