International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 3 | Issue 2 | Year 2012 | Article Id. IJCTT-V3I2P102 | DOI : https://doi.org/10.14445/22312803/IJCTT-V3I2P102

BSMR: Byzantine-Resilient Secure Multicast Routing In Multihop Wireless Networks

Mahamood ul Hasan MD, Syed Shaheen

Citation :

Mahamood ul Hasan MD, Syed Shaheen, "BSMR: Byzantine-Resilient Secure Multicast Routing In Multihop Wireless Networks," International Journal of Computer Trends and Technology (IJCTT), vol. 3, no. 2, pp. 201-210, 2012. Crossref, https://doi.org/10.14445/22312803/IJCTT-V3I2P102

Abstract

In this work we identify vulnerabilities of on-demand multicast routing protocols for multi-hop wireless networks and discuss the challenges encountered in designing mechanisms to defend against them. We propose BSMR, a novel secure multicast routing protocol that withstands insider attacks from colluding adversaries. Our protocol is a software-based solution and does not require additional or specialized hardware. We present simulation results which demonstrate that BSMR effectively mitigates the identified attacks.

Keywords

Performance Appraisal, Teacher , Student, Cascaded, Fuzzy Inference System, Sensitivity Analysis, Gaussian MF, Fuzzy Rules.

References

[1]   Y. B. Ko and N. H. Vaidya, “Flooding-based geocasting protocols for mobile ad hoc networks,” Mob. Netw. Appl., vol. 7, no. 6, pp. 471– 480, 2002.
[2]   R. Chandra, V. Ramasubramanian, and K. Birman, “Anonymous gossip: Improving multicast reliability in mobile ad-hoc networks,” in Proc. of ICDCS, 2001.
[3]   Y.-B. Ko and N. H. Vaidya, “GeoTORA: a protocol for geocasting in mobile ad hoc networks,” in Proc. of ICNP. IEEE Computer Society, 2000, p. 240.
[4]   E. L. Madruga and J. J. Garcia-Luna-Aceves, “Scalable multicasting: the core-assisted mesh protocol,” Mob. Netw. Appl., vol. 6, no. 2, pp. 151–165, 2001.
[5]  S. J. Lee, W. Su, and M. Gerla, “On-demand multicast routing protocol in multihop wireless mobile networks,” Mob. Netw. Appl., vol. 7, no. 6, pp. 441–453, 2002.
[6] E. Royer and C. Perkins, “Multicast ad-hoc on-demand distance vector (MAODV) routing,” in Internet Draft, July 2000.
[7]   J. G. Jetcheva and D. B. Johnson, “Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks.” In Proc. Of MobiHoc,  2001, pp. 33–44.
[8]    L. Lamport, R. Shostak, and M. Pease, “The Byzantine generals problem,” in Advances in Ultra-Dependable Distributed Systems. IEEE Computer Society Press, 1995.
[9]    P. Papadimitratos and Z. Haas, “Secure routing for mobile ad hoc networks,” in Proc. of CNDS, January 2002, pp. 27–31. [10]  Y.-C. Hu, D. B. Johnson, and A. Perrig, “SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks,” in Proc. of WMCSA, June 2002.
[11]  Y.-C. Hu, A. Perrig, and D. B. Johnson, “Ariadne: A secure on- demand routing protocol for ad hoc networks,” in Proc. Of MOBICOM, September 2002.
[12]  K. Sanzgiri, B. Dahill, B. N. Levine, C. Shields, and E. Belding- Royer, “A secure routing protocol for ad hoc networks,” in Proc. Of ICNP, November 2002.
[13]  S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating routing misbehavior in mobile ad hoc networks,” in Proc. of MOBICOM, August 2000.
[14]  P. Papadimitratos and Z. Haas, “Secure data transmission in mobile ad hoc networks,” in Proc. of WiSe, 2003, pp. 41–50.
[15]  B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, “An ondemand secure routing protocol resilient to byzantine failures,” in Proc. of WiSe’02. ACM Press, 2002.
[16]  B. Awerbuch, R. Curtmola, D. Holmer, C. Nita-Rotaru, and H. Rubens, “On the survivability of routing protocols in ad hoc wireless networks,” in Proc. of SecureComm’05. IEEE, 2005.
[17]  S. Roy, V. G. Addada, S. Setia, and S. Jajodia, “Securing MAODV: Attacks and countermeasures,” in Proc. 2nd IEEE Int’l. Conf. SECON. IEEE, 2005. rekeying
[18]  C. Zhang, B. DeCleene, J. Kurose, and D. Towsley, “Comparison of inter-area algorithms for secure wireless group communications,” Perform. Eval., vol. 49, no. 1-4, 2002.
[19]  K. H. Rhee, Y. H. Park, and G. Tsudik, “An architecture for key management in hierarchical mobile ad hoc networks,” Journal of Communication and Networks, vol. 6, no. 2, June 2004.
[20]  Y.-C. Hu, A. Perrig, and D. B. Johnson, “Rushing attacks and defense in wireless ad hoc network routing protocols,” in Proc. of WiSe. ACM, 2003.
[21]  ——, “Packet leashes: A defense against wormhole attacks in wireless ad hoc networks,” in Proc. of INFOCOM, April 2003.
[22]  J. Eriksson, S. Krishnamurthy, and M. Faloutsos, “Truelink: A practical countermeasure to the wormhole attack in wireless networks,” in Proc. of ICNP’06. IEEE, 2006.
[23]  L. Hu and D. Evans, “Using directional antennas to prevent wormhole attacks,” in Proc. of NDSS, 2004.
[24]  D. Bruschi and E. Rosti, “Secure multicast in wireless networks of mobile hosts: protocols and issues,” Mobile Networks and Applications, vol. 7, no. 6, pp. 503–511, 2002.
[25]  T. Kaya, G. Lin, G. Noubir, and A. Yilmaz, “Secure multicast groups on ad hoc networks,” in Proc. of SASN’03. ACM Press, 2003, pp. 94–102.
[26]  S. Zhu, S. Setia, S. Xu, and S. Jajodia, “Gkmpan: An efficient group rekeying scheme for secure multicast in ad-hoc networks,” in Proc. of Mobiquitos’04. IEEE, 2004, pp. 42–51.
[27]  L. Lazos and R. Poovendran, “Power proximity based key management for secure multicast in ad hoc networks,” 2005, aCM Journal on Wireless Networks (WINET).
[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,” in Proc. of ICC 2005, vol. 2, 2005, pp. 1123– 1127.
[29]  S. Banerjee, S. Lee, B. Bhattacharjee, and A. Srinivasan, “Resilient multicast using overlays,” SIGMETRICS Perform. Eval. 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,” in Proc. of ICDCS ’04, 2004, pp. 670–679.
[31]  L. Xie and S. Zhu, “Message dropping attacks in overlay networks: Attack detection and attacker identification,” in Proc. SecureComm ’06. IEEE and Create-NET, 2006.
[32]  J. Newsome, E. Shi, D. Song, and A. Perrig, “The Sybil attack in sensor networks: analysis & defenses,” in Proc. of IPSN ’04. New York, NY, USA: ACM Press, 2004, pp. 259–268.
[33]  C. Piro, C. Shields, and B. N. Levine, “Detecting the Sybil attack in mobile ad hoc networks,” in Proc. SecureComm, 2006.
[34]  B. Parno, A. Perrig, and V. D. Gligor, “Distributed detection of node replication attacks in sensor networks.” in IEEE Symposium on Security and Privacy, 2005, pp. 49–63.
[35]  R. Curtmola and C. Nita-Rotaru, “Secure multicast routing in wireless networks,” to be published in ACM MC2R, 2006.
[36]  K. Tang, K. Obraczka, S.-J. Lee, and M. Gerla, “A reliable, congestion-controlled multicast transport protocol in multimedia multihop networks,” in Proc. of IEEE WPMC’02, 2002.
[37]  A. Perrig, R. Canetti, D. Song, and J. D. Tygar, “Efficient and secure source authentication for multicast,” in Proc. Of NDSS’01, 2001.
[38]  “The network simulator - ns2,” http://www.isi.edu/nsnam/ns/.
[39]  Y. Zhu and T. Kunz, “MAODV implementation for NS-2.26,” Carleton University, Technical Report SCE-04-01. digital
[40]  R. L. Rivest, A. Shamir, and L. M. Adleman, “A method for obtaining signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126, 1978.
[41]  Advanced Encryption Standard (AES). National Institute for Standards and Technology (NIST), 2001, no. FIPS 197. [42]  The Keyed-Hash Message Authentication Code (HMAC). NIST, 2002, no. FIPS 198.