Scheduling intrusion detection systems in resource-bounded cyber-physical systems

CPS-SPC 2015 - Proceedings of the 1st ACM Workshop on Cyber-Physical Systems-Security and/or Privacy, co-located with CCS 2015

Volumn , Issue , 2015, Pages 55-66

  Abbas, Waseem ^a   Laszka, Aron ^a   Vorobeychik, Yevgeniy ^a   Koutsoukos, Xenofon ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

Cyber physical system; Dominating sets; Game theory; Intrusion detection systems; Scheduling; Sensor networks

Indexed keywords

COMPUTATION THEORY; COMPUTER CRIME; EMBEDDED SYSTEMS; GAME THEORY; HEURISTIC ALGORITHMS; MERCURY (METAL); OPTIMIZATION; SCHEDULING; SENSOR NETWORKS; WATER DISTRIBUTION SYSTEMS; WATER SUPPLY SYSTEMS;

COMPUTATIONAL NODES; CYBER PHYSICAL SYSTEMS (CPSS); CYBER-PHYSICAL SYSTEMS (CPS); DOMINATING SETS; INTRUSION DETECTION SYSTEMS; SCHEDULING PROBLEM; SCHEDULING SCHEMES; WATER DISTRIBUTION NETWORKS;

INTRUSION DETECTION;

EID: 84964801519     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2808705.2808711     Document Type: Conference Paper

References (26)

1. W. Abbas and M. Egerstedt. Characterizing heterogeneity in cooperative networks from a resource distribution view-point. Communications in Information and Systems, 14:1-22, 2014.
2. W. Abbas, M. Egerstedt, C.-H. Liu, R. Thomas, and P. Whalen. Deploying robots with two sensors in k f1; 6g-free graphs. arXiv preprint arXiv:1308.5450, 2014.
3. M. Abrams and J. Weiss. Malicious control system cyber security attack case study - Maroochy Water Services, Australia. http://csrc.nist.gov/groups/SMA/fisma/ics/documents/Maroochy-Water-Services-Case-Study-report.pdf, Jul 2008.
4. N. Ahn and S. Park. A new mathematical formulation and a heuristic for the maximum disjoint set covers problem to improve the lifetime of the wireless sensor network. Ad Hoc & Sensor Wireless Networks, 13(3-4):209-225, 2011.
5. G. Arslan, J. R. Marden, and J. S. Shamma. Autonomous vehicle-target assignment: A game-theoretical formulation. Journal of Dynamic Systems, Measurement, and Control, 129(5):584-596, 2007.
6. A.-L. Barabàsi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, October 1999.
7. L. E. Blume. The statistical mechanics of strategic interaction. Games and economic behavior, 5(3):387-424, 1993.
8. W. A. Brock and S. N. Durlauf. Discrete choice with social interactions. The Review of Economic Studies, 68(2):235-260, 2001.
9. M. Cardei and D.-Z. Du. Improving wireless sensor network lifetime through power aware organization. Wireless Networks, 11(3):333-340, 2005.
10. A. Deshpande, S. E. Sarma, K. Youcef-Toumi, and S. Mekid. Optimal coverage of an infrastructure network using sensors with distance-decaying sensing quality. Automatica, 49(11):3351-3358, 2013.
11. U. Feige, M. M. Halldórsson, G. Kortsarz, and A. Srinivasan. Approximating thedomatic number. SIAM Journal on computing, 32(1):172-195, 2002.
12. S. Fujita, M. Yamashita, and T. Kameda. A study on r-configurations|a resource assignment problem on graphs. SIAM Journal on Discrete Mathematics, 13(2):227-254, 2000.
13. S. Henna and T. Erlebach. Approximating maximum disjoint coverage in wireless sensor networks. In Ad-hoc, Mobile, and Wireless Network, pages 148-159. Springer, 2013.
14. K. Islam, S. G. Akl, and H. Meijer. Maximizing the lifetime of wireless sensor networks through domatic partition. In Local Computer Networks, 2009. LCN 2009. IEEE 34th Conference on, pages 436-442. IEEE, 2009.
15. Kaspersky Lab. Kaspersky Lab provides its insights on Stuxnet worm. http://www.kaspersky.com/about/news/virus/2010/Kaspersky-Lab-provides-its-insights-on-Stuxnet-worm, Sep 2010. Accessed: June 21st, 2015.
16. M. B. Kelley. The Stuxnet attack on Iran's nuclear plant was 'far more dangerous' than previously thought. Business Insider, http: //www.businessinsider.com/stuxnet-was-far-more-dangerous-than-previous-thought-2013-11, Nov 2013. Accessed: June 21st, 2015.
17. D. Kushner. The real story of Stuxnet. IEEE Spectrum, 50(3):48-53, 2013.
18. J. Marden and J. Shamma. Revisiting log-linear learning: Asynchrony, completeness, and pay-off based implementation. Games and Economic Behavior, 75(2):788-808, 2012.
19. I. Menache and A. Ozdaglar. Network games: Theory, models, and dynamics. Synthesis Lectures on Communication Networks, 4(1):1-159, 2011.
20. T. Moscibroda and R. Wattenhofer. Maximizing the lifetime of dominating sets. In Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International, pages 8-pp. IEEE, 2005.
21. A. Ostfeld, J. G. Uber, E. Salomons, J. W. Berry, W. E. Hart, C. A. Phillips, J.-P. Watson, G. Dorini, P. Jonkergouw, Z. Kapelan, et al. The battle of the water sensor networks: A design challenge for engineers and algorithms. Journal of Water Resources Planning and Management, 134(6):556-568, 2008.
22. S. V. Pemmaraju and I. A. Pirwani. Energy conservation via domatic partitions. In Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing, pages 143-154. ACM, 2006.
23. RSA FraudAction Research Labs. Anatomy of an attack. https://blogs.rsa.com/anatomy-of-an-attack/, Apr 2011. Accessed: June 21st, 2015.
24. A. Y. Yazicioglu, M. Egerstedt, and J. S. Shamma. A game theoretic approach to distributed coverage of graphs by heterogeneous mobile agents. In Estimation and Control of Networked Systems, volume 4, pages 309-315, 2013.
25. J. Yu, Q. Zhang, D. Yu, C. Chen, and G. Wang. Domatic partition in homogeneous wireless sensor networks. Journal of Network and Computer Applications, 37:186-193, 2014.
26. M. Zhu and S. Martínez. Distributed coverage games for energy-aware mobile sensor networks. SIAM Journal on Control and Optimization, 51(1):1-27, 2013.