The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2009 vol.8)
pp: 445-459
Reza Curtmola , Johns Hopkins University, Baltimore
Cristina Nita-Rotaru , Purdue University, West Lafayette
ABSTRACT
Multihop wireless networks rely on node cooperation to provide multicast services. The multihop communication offers increased coverage for such services but also makes them more vulnerable to insider (or Byzantine) attacks coming from compromised nodes that behave arbitrarily to disrupt the network. In this work, we identify vulnerabilities of on-demand multicast routing protocols for multihop wireless networks and discuss the challenges encountered in designing mechanisms to defend against them. We propose BSMR, a novel secure multicast routing protocol designed to withstand insider attacks from colluding adversaries. Our protocol is a software-based solution and does not require additional or specialized hardware. We present simulation results that demonstrate that BSMR effectively mitigates the identified attacks.
INDEX TERMS
Multihop wireless networks, secure multicast routing, Byzantine resiliency, Byzantine attacks.
CITATION
Reza Curtmola, Cristina Nita-Rotaru, "BSMR: Byzantine-Resilient Secure Multicast Routing in Multihop Wireless Networks", IEEE Transactions on Mobile Computing, vol.8, no. 4, pp. 445-459, April 2009, doi:10.1109/TMC.2008.134
REFERENCES
[1] R. Curtmola and C. Nita-Rotaru, “BSMR: Byzantine-Resilient Secure Multicast Routing in Multi-Hop Wireless Networks,” Proc. Fourth Ann. IEEE Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON '07), 2007.
[2] Y.B. Ko and N.H. Vaidya, “Flooding-Based Geocasting Protocols for Mobile Ad Hoc Networks,” Mobile Networks and Applications, vol. 7, no. 6, 2002.
[3] R. Chandra, V. Ramasubramanian, and K. Birman, “Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks,” Proc. 21st Int'l Conf. Distributed Computing Systems (ICDCS'01), 2001.
[4] Y.-B. Ko and N.H. Vaidya, “GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks,” Proc. Eighth Ann. Int'l Conf. Network Protocols (ICNP '00), p. 240, 2000.
[5] E.L. Madruga and J.J. Garcia-Luna-Aceves, “Scalable Multicasting: The Core-Assisted Mesh Protocol,” Mobile Networks and Applications, vol. 6, no. 2, 2001.
[6] S.J. Lee, W. Su, and M. Gerla, “On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks,” Mobile Networks and Applications, vol. 7, 2002.
[7] E. Royer and C. Perkins, Multicast Ad-Hoc On-Demand Distance Vector (MAODV) Routing, Internet draft, July 2000.
[8] J.G. Jetcheva and D.B. Johnson, “Adaptive Demand-Driven Multicast Routing in Multi-Hop Wireless Ad Hoc Networks,” Proc. ACM MobiHoc, 2001.
[9] L. Lamport, R. Shostak, and M. Pease, “The Byzantine Generals Problem,” Advances in Ultra-Dependable Distributed Systems, 1995.
[10] P. Papadimitratos and Z. Haas, “Secure Routing for Mobile AdHoc Networks,” Proc. Comm. Networks and Distributed Systems Modeling and Simulation Conf. (CNDS '02), pp. 27-31, Jan. 2002.
[11] Y.-C. Hu, D.B. Johnson, and A. Perrig, “SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks,” Proc. Fourth IEEE Workshop Mobile Computing Systems and Applications (WMCSA '02), June 2002.
[12] Y.-C. Hu, A. Perrig, and D.B. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks,” Proc. ACM MobiCom, Sept. 2002.
[13] K. Sanzgiri, B. Dahill, B.N. Levine, C. Shields, and E. Belding-Royer, “A Secure Routing Protocol for Ad Hoc Networks,” Proc. 10th Ann. Int'l Conf. Network Protocols (ICNP '02), Nov. 2002.
[14] S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks,” Proc. ACM MobiCom, Aug. 2000.
[15] P. Papadimitratos and Z. Haas, “Secure Data Transmission in Mobile Ad Hoc Networks,” Proc. ACM Workshop Wireless Security (WiSe '03), pp. 41-50, 2003.
[16] B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, “An On-Demand Secure Routing Protocol Resilient to Byzantine Failures,” Proc. ACM Workshop Wireless Security (WiSe '02), 2002.
[17] B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-Rotaru, and H. Rubens, “ODSBR: An On-Demand Secure Byzantine Resilient Routing Protocol for Wireless Ad Hoc Networks,” ACM Trans. Information and System Security, vol. 10, no. 4, 2007.
[18] S. Roy, V.G. Addada, S. Setia, and S. Jajodia, “Securing MAODV: Attacks and Countermeasures,” Proc. Second Ann. IEEE Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON), 2005.
[19] 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, pp. 175-192, 2003.
[20] Y.-C. Hu, A. Perrig, and D.B. Johnson, “Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols,” Proc. ACM Workshop Wireless Security (WiSe), 2003.
[21] Y.-C. Hu, A. Perrig, and D.B. Johnson, “Packet Leashes: A Defense against Wormhole Attacks in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, 2003.
[22] J. Eriksson, S.V. Krishnamurthy, and M. Faloutsos, “Truelink: A Practical Countermeasure to the Wormhole Attack in Wireless Networks,” Proc. 14th Ann. Int'l Conf. Network Protocols (ICNP '06), 2006.
[23] L. Hu and D. Evans, “Using Directional Antennas to Prevent Wormhole Attacks,” Proc. Network and Distributed System Security Symp. (NDSS '04), 2004.
[24] D. Bruschi and E. Rosti, “Secure Multicast in Wireless Networks of Mobile Hosts: Protocols and Issues,” Mobile Networks and Applications, vol. 7, 2002.
[25] T. Kaya, G. Lin, G. Noubir, and A. Yilmaz, “Secure Multicast Groups on Ad Hoc Networks,” Proc. ACM Workshop Security of AdHoc and Sensor Networks (SASN '03), pp. 94-102, 2003.
[26] S. Zhu, S. Setia, S. Xu, and S. Jajodia, “GKMPAN: An Efficient Group Rekeying Scheme for Secure Multicast in Ad-Hoc Networks,” Proc. First Ann. Int'l Conf. Mobile and Ubiquitous Systems (Mobiquitous '04), pp. 42-51, 2004.
[27] L. Lazos and R. Poovendran, “Power Proximity Based Key Management for Secure Multicast in Ad Hoc Networks,” ACM J. Wireless Networks, 2005.
[28] R. Balachandran, B. Ramamurthy, X. Zou, and N. Vinodchandran, “CRTDH: An Efficient Key Agreement Scheme for Secure Group Communications in Wireless Ad Hoc Networks,” Proc. IEEE Int'l Conf. Comm. (ICC '05), 2005.
[29] S. Banerjee, S. Lee, B. Bhattacharjee, and A. Srinivasan, “Resilient Multicast Using Overlays,” ACM SIGMETRICS Performance Evaluation Rev., vol. 31, no. 1, pp. 102-113, 2003.
[30] V. Pappas, B. Zhang, A. Terzis, and L. Zhang, “Fault-Tolerant Data Delivery for Multicast Overlay Networks,” Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS '04), 2004.
[31] L. Xie and S. Zhu, “Message Dropping Attacks in Overlay Networks: Attack Detection and Attacker Identification,” Proc. Second Int'l Conf. Security and Privacy in Comm. Networks (SecureComm), 2006.
[32] R. Curtmola and C. Nita-Rotaru, “Secure Multicast Routing in Wireless Networks,” ACM SIGMOBILE Mobile Computing and Comm. Rev., no. 2, 2007.
[33] R. Ghosh and G. Varghese, “Congestion Control in Multicast Transport Protocols,” technical report, June 1998.
[34] K. Tang, K. Obraczka, S.-J. Lee, and M. Gerla, “A Reliable, Congestion-Controlled Multicast Transport Protocol in Multimedia Multi-Hop Networks,” Proc. Fifth Int'l Symp. Wireless Personal Multimedia Comm. (WPMC '02), 2002.
[35] A. Perrig, R. Canetti, D. Song, and J.D. Tygar, “Efficient and Secure Source Authentication for Multicast,” Proc. Network and Distributed System Security Symp. (NDSS '01), 2001.
[36] J.-P. Hubaux, L. Buttyan, and S. Capkun, “The Quest for Security in Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, Oct. 2001.
[37] R. Bobba, L. Eschenauer, V. Gligor, and W. Arbaugh, “Bootstrapping Security Associations for Routing in Mobile Ad-Hoc Networks,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '03), 2003.
[38] L. Zhou and Z. Haas, “Securing Ad Hoc Networks,” IEEE Network Magazine, vol. 13, no. 6, 1999.
[39] M.G. Zapata, Secure Ad Hoc On-Demand Distance Vector (SAODV) Routing, IETF Internet draft, Sept. 2006.
[40] J. Dong, K. Ackermann, B. Bavar, and C. Nita-Rotaru, “Mitigating Coordinate Attacks against Virtual Coordinate Based Routing in Wireless Sensor Networks,” Proc. First ACM Conf. Wireless Network Security (WiSec), 2008.
[41] P.F. Syverson, D.M. Goldschlag, and M.G. Reed, “Anonymous Connections and Onion Routing,” Proc. IEEE Symp. Security and Privacy (S&P), 1997.
[42] The Network Simulator—ns2, http://www.isi.edu/nsnamns/, 2008.
[43] Y. Zhu and T. Kunz, “MAODV Implementation for NS-2.26,” Technical Report SCE-04-01, Carleton Univ., 2008.
[44] R.L. Rivest, A. Shamir, and L.M. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Comm. ACM, vol. 21, no. 2, pp. 120-126, 1978.
[45] Digital Signature Standard (DSS), Nat'l Inst. for Standards and Technology (NIST), FIPS 186-3, 2006.
[46] Advanced Encryption Standard (AES), Nat'l Inst. for Standards and Technology (NIST), FIPS 197, 2001.
[47] The Keyed-Hash Message Authentication Code (HMAC). NIST, FIPS 198, 2002.
[48] Secure Hash Standard (SHAI), Nat'l Inst. for Standards and Technology (NIST), FIPS 180-1, 1995.
[49] J. Yoon, M. Liu, and B. Noble, “Random Waypoint Considered Harmful,” Proc. IEEE INFOCOM, 2003.
[50] D.S. Moore and G.P. McCabe, Introduction to the Practice of Statistics. W.H. Freeman, 2005.
384 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool