Analisando o desempenho de um sistema de quóruns probabilístico para MANETs diante de ataques maliciosos

  • Elisa Mannes UFPR
  • Eduardo da Silva UFPR
  • Aldri L. dos Santos UFPR

Abstract


Due to their characteristics, such as dynamic topology and lack of infrastructure, Mobile Ad Hoc Networks (MANETs) are highly vulnerable to attacks. These characteristics make hard the design of reliable and secure network management systems. Quorum systems are effective tools for data sharing on traditional networks, ensuring data availability and consistency. Recently, these systems have been applied in MANETs, being PAN, a probabilistic quorum system for ad hoc networks, the first one to consider the characteristics of MANETs. However, such systems do not take into account malicious nodes in the environment. This work analyzes the impact of lack of cooperation, timing and data manipulation attacks against PAN. Two metrics were used in the evaluation: reliability degree and percentage of malicious nodes on the reading operations. Results show that PAN is vulnerable to these attacks, specially to the data manipulation, in which the system correctly conclude only 2% of reading when submitted to 30% of attackers in the writing operations.

References

Alvisi, L., Pierce, E. T., Malkhi, D., Reiter, M. K., and Wright, R. N. (2000). Dynamic byzantine quorum systems. In Proceedings of the 2000 International Conference on Dependable Systems and Networks (DSN ’00), pages 283–292, Washington, DC, USA. IEEE Computer Society.

Amir, Y. and Wool, A. (1996). Evaluating quorum systems over the internet. In Proceedings of the 26th Annual International Symposium on Fault-Tolerant Computing (FTCS ’96), pages 26–35, Washington, DC, USA. IEEE Computer Society.

Bazzi, R. A. (2000). Synchronous byzantine quorum systems. Distributed Computing, 13(1):45–52.

Chlamtac, I., Conti, M., and Liu, J. J. (2003). Mobile ad hoc networking: imperatives and challenges. Ad Hoc Networks, 1(1):13–64.

Gramoli, V. and Raynal, M. (2007). Principles of distributed systems, chapter Timed Quorum Systems for Large-Scale and Dynamic Environments, pages 429 – 442. Springer Berlin.

Holmer, D. (2007). Byzantine survivable routing for mobile ad hoc networks. PhD thesis, Baltimore, MD, USA. Adviser-Awerbuch, Baruch.

Hu, J. and Burmester, M. (2009). Cooperation in Mobile Ad Hoc Networks, chapter 3, pages 1–15. Springer London.

Krishna, P., Vaidya, N. H., Chatterjee, M., and Pradhan, D. K. (1997). A cluster-based approach for routing in dynamic networks. Computing Commununication Review (SIGCOMM), 27(2):49– 64.

Liu, C. and Kaiser, J. (2003). A survey of mobile ad hoc network routing protocols. Technical Report TR 2003-08, Department of Computer Structures University of Ulm, Germany.

Luo, J., Hubaux, J.-P., and Eugster, P. T. (2003). PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems. In Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc ’03), pages 1–12, New York, NY, USA. ACM.

Malkhi, D. and Reiter, M. (1997). Byzantine quorum systems. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC ’97), pages 569–578.

Malkhi, D., Reiter, M. K., Wool, A., and Wright, R. N. (2001). Probabilistic quorum systems. Information Computing, 170(2):184–206.

Marti, S., Giuli, T. J., Lai, K., and Baker, M. (2000). Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of the 6th annual international conference on Mobile computing and networking (MobiCom ’00), pages 255–265, New York, NY, USA. ACM.

Martin, J.-P., Alvisi, L., and Dahlin, M. (2002). Minimal byzantine storage. Technical report, University of Texas at Austin, Department of Computer Sciences, Austin, Texas, USA.

Murray, J. (1993). Mathematical biology. Springer, Berlin, 2 edition.

Owen, G. and Adda, M. (2006). Simulation of quorum systems in ad hoc networks. In 3rd International Conference on Artificial Intelligence in Engineering and Technology.

Pei, G. and Gerla, M. (2001). Mobility management for hierarchical wireless networks. Mobile Network Applications, 6(4):331–337.

Tulone, D. (2007). Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems. Ad Hoc Networks, 5(8):1251–1271.

van der Merwe, J., Dawoud, D., and McDonald, S. (2007). A survey on peer-to-peer key management for mobile ad hoc networks. ACM Computing Survey, 39(1):1–45.

Wu, B., Chen, J., Wu, J., and Cardei, M. (2006). Wireless/Mobile network security, chapter 12, pages 103–136. Springer-Verlag, New York, NY, USA.

Xu, K., Hong, X., and Gerla, M. (2002). An ad hoc network with mobile backbones. In IEEE International Conference on Communications (ICC ’02), volume 5, pages 3138–3143 vol.5.

Zhou, L. and Haas, Z. J. (1999). Securing ad hoc networks. IEEE Network, 13(6):24–30.
Published
2009-09-28
MANNES, Elisa; SILVA, Eduardo da; SANTOS, Aldri L. dos. Analisando o desempenho de um sistema de quóruns probabilístico para MANETs diante de ataques maliciosos. In: BRAZILIAN SYMPOSIUM ON CYBERSECURITY (SBSEG), 9. , 2009, Campinas. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2009 . p. 71-84. DOI: https://doi.org/10.5753/sbseg.2009.20624.

Most read articles by the same author(s)