Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 150512, 12 pages
http://dx.doi.org/10.1155/2015/150512
Research Article

Bloom Filter-Based Secure Data Forwarding in Large-Scale Cyber-Physical Systems

Siyu Lin1,2 and Hao Wu2

1School of Electronic and Information Engineering, Beijing Jiaotong University, No. 3 Shang Yuan Cun, Haidian District, Beijing 100044, China
2State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, No. 3 Shang Yuan Cun, Haidian District, Beijing 100044, China

Received 24 September 2014; Accepted 19 March 2015

Academic Editor: Yang Tang

Copyright © 2015 Siyu Lin and Hao Wu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Sridhar, A. Hahn, and M. Govindarasu, “Cyber-physical system security for the electric power grid,” Proceedings of the IEEE, vol. 100, no. 1, pp. 210–224, 2012. View at Publisher · View at Google Scholar · View at Scopus
  2. E. A. Lee, “Cyber physical systems: design challenges,” in Proceedings of the 11th IEEE International Symposium on Object Oriented Real-Time Distributed Computing (ISORC '08), pp. 363–369, Orlando, Fla, USA, May 2008. View at Publisher · View at Google Scholar · View at Scopus
  3. O. S. Saydjari, “Cyber defense: art to science,” Communications of the ACM, vol. 47, no. 3, pp. 52–57, 2004. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Cardenas, S. Amin, B. Sinopoli, A. Giani, A. Perrig, and S. Sastry, “Challenges for securing cyber physical systems,” in Proceedings of the Workshop on Future Directions in Cyber-Physical Systems Security, 2009.
  5. Y. Mo, T. H.-J. Kim, K. Brancik et al., “Cyber-physical security of a smart grid infrastructure,” Proceedings of the IEEE, vol. 100, no. 1, pp. 195–209, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. C. Alvaro, A. Saurabh, S. Bruno, G. Annarita, P. Adrian, and S. Shankar, “Challenges for securing cyber physical systems,” in Proceedings of the Workshop on Future Directions in Cyber-physical Systems Security (DHS '09), Newark, NJ, USA, July 2009.
  7. B. Panja, S. K. Madria, and B. Bhargava, “A role-based access in a hierarchical sensor network architecture to provide multilevel security,” Computer Communications, vol. 31, no. 4, pp. 793–806, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. B. H. Bloom, “Space/time trade-offs in hash coding with allowable errors,” Communications of the ACM, vol. 13, no. 7, pp. 422–426, 1970. View at Publisher · View at Google Scholar · View at Scopus
  9. S. Yi, P. Naldurg, and R. Kravets, “Security-aware ad hoc routing for wireless networks,” in Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc '01), pp. 299–302, October 2001. View at Scopus
  10. H. Khurana, M. Hadley, N. Lu, and D. A. Frincke, “Smart-grid security issues,” IEEE Security and Privacy, vol. 8, no. 1, pp. 81–85, 2010. View at Publisher · View at Google Scholar · View at Scopus
  11. R. S. Sandhu, “Lattice-based access control models,” IEEE Computer, vol. 26, no. 11, pp. 9–19, 1993. View at Publisher · View at Google Scholar · View at Scopus
  12. B. Awerbuch, A. Bar-Noy, and M. Gopal, “Approximate distributed bellman-ford algorithms,” IEEE Transactions on Communications, vol. 42, no. 8, pp. 2515–2517, 1994. View at Publisher · View at Google Scholar · View at Scopus
  13. D. Culler, D. Estrin, and M. Srivastava, “Guest Editors' introduction: overview of sensor networks,” Computer, vol. 37, no. 8, pp. 41–49, 2004. View at Publisher · View at Google Scholar
  14. S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  15. D. Guo, J. Wu, H. Chen, Y. Yuan, and X. Luo, “The dynamic bloom filters,” IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 1, pp. 120–133, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. D. Sidhu, T. Fu, S. Abdallah, R. Nair, and R. Coltun, “Open shortest path first (ospf) routing protocol simulation,” ACM SIGCOMM Computer Communication Review, vol. 23, no. 4, pp. 53–62, 1993. View at Google Scholar
  17. S. Duquennoy, O. Landsiedel, and T. Voigt, “Let the tree bloom: scalable opportunistic routing with ORPL,” in Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems (SenSys '13), Roma, Italy, November 2013.
  18. B. Karp and H.-T. Kung, “GPSR: greedy perimeter stateless routing for wireless networks,” in Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM '00), pp. 243–254, ACM, August 2000. View at Scopus
  19. S. Ravi, A. Raghunathan, P. Kocher, and S. Hattangady, “Security in embedded systems,” ACM Transactions on Embedded Computing Systems, vol. 3, no. 3, pp. 461–491, 2004. View at Publisher · View at Google Scholar
  20. L. Abusalah, A. Khokhar, and M. Guizani, “A survey of secure mobile Ad hoc routing protocols,” IEEE Communications Surveys and Tutorials, vol. 10, no. 4, pp. 78–93, 2008. View at Publisher · View at Google Scholar · View at Scopus
  21. M. Yu and K. K. Leung, “A Trustworthiness-based qoS routing protocol for wireless ad hoc networks,” IEEE Transactions on Wireless Communications, vol. 8, no. 4, pp. 1888–1898, 2009. View at Publisher · View at Google Scholar · View at Scopus
  22. W. Galuba, P. Papadimitratos, M. Poturalski, K. Aberer, Z. Despotovic, and W. Kellerer, “Castor: scalable secure routing for ad hoc networks,” in Proceedings of the IEEE International Conference on Computer Communications (INFOCOM '10), pp. 1–9, San Diego, Calif, USA, March 2010. View at Publisher · View at Google Scholar
  23. Z. Wan, K. Ren, and M. Gu, “USOR: an unobservable secure on-demand routing protocol for mobile ad hoc networks,” IEEE Transactions on Wireless Communications, vol. 11, no. 5, pp. 1922–1932, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. Y. Zhang, G. Wang, Q. Hu, Z. Li, and J. Tian, “Design and performance study of a topology-hiding multipath routing protocol for mobile ad hoc networks,” in Proceedings of the Conference on Computer Communications (INFOCOM '12), pp. 10–18, March 2012. View at Publisher · View at Google Scholar · View at Scopus
  25. A. A. Gohari, R. Pakbaz, P. M. Melliar-Smith, L. E. Moser, and V. Rodoplu, “RMR: reliability map routing for tactical mobile ad hoc networks,” IEEE Journal on Selected Areas in Communications, vol. 29, no. 10, pp. 1935–1947, 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. Y.-C. Hu, D. B. Johnson, and A. Perrig, “SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks,” Ad Hoc Networks, vol. 1, no. 1, pp. 175–192, 2003. View at Publisher · View at Google Scholar · View at Scopus
  27. P. Papadimitratos and Z. J. Haas, “Secure link state routing for mobile ad hoc networks,” in Proceedings of the Symposium on Applications and the Internet Workshops, pp. 379–383, January 2003. View at Publisher · View at Google Scholar
  28. A. Broder and M. Mitzenmacher, “Network applications of bloom filters: a survey,” Internet Mathematics, vol. 1, no. 4, pp. 485–509, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  29. S. Tarkoma, C. E. Rothenberg, and E. Lagerspetz, “Theory and practice of bloom filters for distributed systems,” IEEE Communications Surveys & Tutorials, vol. 14, no. 1, pp. 131–155, 2012. View at Publisher · View at Google Scholar · View at Scopus
  30. S. Dharmapurikar, P. Krishnamurthy, and D. E. Taylor, “Longest prefix matching using bloom filters,” in Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM '03), pp. 201–212, ACM, 2003. View at Publisher · View at Google Scholar
  31. M. Yu, A. Fabrikant, and J. Rexford, “BUFFALO: bloom filter forwarding architecture for large organizations,” in PRoceedings of the 5th ACM International Conference on Emerging Networking Experiments and Technologies (CoNEXT '09), pp. 313–324, Rome, Italy, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  32. H. Jiang and S. Jin, “Exploiting dynamic querying like flooding techniques in unstructured peer-to-peer networks,” in Proceedings of the 13TH IEEE International Conference on Network Protocols (ICNP '05), pp. 122–131, November 2005. View at Publisher · View at Google Scholar · View at Scopus
  33. U. G. Acer, S. Kalyanaraman, and A. A. Abouzeid, “Weak state routing for large-scale dynamic networks,” IEEE/ACM Transactions on Networking, vol. 18, no. 5, pp. 1450–1463, 2010. View at Publisher · View at Google Scholar · View at Scopus
  34. D. Guo, Y. He, and Y. Liu, “On the feasibility of gradient-based data-centric routing using bloom filters,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 1, pp. 180–190, 2014. View at Publisher · View at Google Scholar
  35. A. Kumar, J. Xu, and E. W. Zegura, “Efficient and scalable query routing for unstructured peer-to-peer networks,” in Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '05), vol. 2, pp. 1162–1173, March 2005. View at Publisher · View at Google Scholar
  36. K. Ren, S. Yu, W. Lou, and Y. Zhang, “Multi-user broadcast authentication in wireless sensor networks,” IEEE Transactions on Vehicular Technology, vol. 58, no. 8, pp. 4554–4564, 2009. View at Publisher · View at Google Scholar · View at Scopus
  37. F. Ye, H. Luo, S. Lu, and L. Zhang, “Statistical en-route filtering of injected false data in sensor networks,” in Proceedings of the IEEE Conference on Computer Communications (INFOCOM '04), pp. 2446–2457, March 2004. View at Publisher · View at Google Scholar · View at Scopus
  38. A. Shieh, A. C. Myers, and E. G. Sirer, “A stateless approach to connection-oriented protocols,” ACM Transactions on Computer Systems, vol. 26, no. 3, article 8, 2008. View at Publisher · View at Google Scholar · View at Scopus