CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Rendering Wormhole Attacks Trivial using the Scalability Features of a Geocasting Protocol

by Appavoo Paramasiven
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 19 - Number 5
Year of Publication: 2011
Authors: Appavoo Paramasiven
10.5120/2357-3083

Appavoo Paramasiven . Rendering Wormhole Attacks Trivial using the Scalability Features of a Geocasting Protocol. International Journal of Computer Applications. 19, 5 ( April 2011), 24-28. DOI=10.5120/2357-3083

@article{ 10.5120/2357-3083,
author = { Appavoo Paramasiven },
title = { Rendering Wormhole Attacks Trivial using the Scalability Features of a Geocasting Protocol },
journal = { International Journal of Computer Applications },
issue_date = { April 2011 },
volume = { 19 },
number = { 5 },
month = { April },
year = { 2011 },
issn = { 0975-8887 },
pages = { 24-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume19/number5/2357-3083/ },
doi = { 10.5120/2357-3083 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:06:12.678662+05:30
%A Appavoo Paramasiven
%T Rendering Wormhole Attacks Trivial using the Scalability Features of a Geocasting Protocol
%J International Journal of Computer Applications
%@ 0975-8887
%V 19
%N 5
%P 24-28
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A number of attacks exist at the network layer, i.e. against routing protocols. One of the most severe attacks is the wormhole attack, which consists of at least two colluding attackers, located at multi-hops distance, that are connected via some unusual means. The attackers replay messages heard at one side to the other side of the network. When this type of attack remains undetected, nodes have the only ability of communicating with at most two-hops neighbor nodes. The detection mechanisms included cryptographic methods and at times the role of specialized nodes which imply either resource-hungry computations or the battery depletion of certain nodes respectively. In this paper, the study of a scalable geocasting routing protocol reveals the required properties, without any costly attack detection mechanism, that render wormhole attacks trivial in a large ad hoc network.

References
  1. A. Iwata, C. Chiang, G. Pei, M. Gerla and T. Chen 1999. Scalable routing strategies for ad hoc wireless networks. IEEE Journal on Selected Areas in Communications SAC. Vol. 17, pp. 1369-1379.
  2. G. Pei, M. Gerla and T. Chen 2000. Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks. IEEE International Conference on Communications. Vol 1, pp. 70-74.
  3. X. Hong, K.Xu and M. Gerla, 2002, Scalable routing protocols for mobile ad hoc networks. IEEE Network. Vol 16, pp. 11-21.
  4. Mihir Bellare, Ran Canetti and Hugo Krawczyk 1996. Keying Hash Functions for Message Authentication. Advances in Cryptology - Crypto 96 Proceedings. Lecture Notes in Computer Science Vol. 1109. N. Koblitz ed., Springer-Verlag.
  5. R. L. Rivest, A. Shamir, and L. Adleman, MIT Laboratory for Computer Science 1978. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, Vol 2, No. 2.
  6. Taher Elgamal 1985. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory. Vol. IT-31, No. 4.
  7. Yih-Chun Hu, Adrian Perrig and David B. Johnson 2002. Ariadne: A Secure On-Demand RoutingProtocol for Ad Hoc Networks. MobiCom’02 Conference.
  8. Yih-Chun Hu, David B. Johnson and Adrian Perrig 2003. SEAD: Secure Efficient Distance Vector Routing for MobileWireless Ad Hoc Networks. Ad Hoc Networks, Elsevier.
  9. Hao Yang, Haiyun Luo, Fan Ye, Songwu Lu, and Lixia Zhang 2004. Security in mobile ad hoc networks: Challenges and solutions. IEEE Wireless Communications.
  10. Y. Xiao, X. Shen, and D.-Z. Du 2006. A Survey on Attacks and Countermeasures in Mobile Ad Hoc Networks. Wireless/Mobile network security, Springer.
  11. Rashid Hafeez Khokhar , Md Asri Ngadi and Satria Mandala 2008. A Review of Current Routing Attacks in Mobile Ad Hoc Networks. International Journal of Computer Science and Security. Volume (2) issue (3).
  12. Daniel Raffo 2005. Security schemes for the OLSR protocol for ad hoc networks. PhD thesis, University de Paris 6.
  13. Yih-Chun Hu, Adrian Perrig, and David B. Johnson 2006. Wormhole Attacks in Wireless Networks. IEEE Journal on selected areas in Communications. Vol 24, No. 2, pages 370-380.
  14. Kannhavong B., Nakayama, H., Nemoto Y., Kato N., Jamalipour A. 2007. A survey of routing attacks in mobile ad hoc networks. Pp 85 – 91, Vol 14.
  15. Shang-Ming Jen, Chi-Sung Laih and Wen-Chung Kuo 2009. A Hop-Count Analysis Scheme for Avoiding Wormhole Attacks in MANET. Sensors 2009, 9, 5022-5039.
  16. L. Lazos, R. Poovendran, C. Meadows, P. Syverson, L. W. Chang 2005. Preventing Wormhole Attacks on Wireless Ad Hoc Networks: A Graph Theoretic Approach. Wireless Communications and Networking Conference IEEE. Pp 1193 - 1199 Vol. 2.
  17. P. Appavoo and K. Khedo 2008. SENCAST: A Scalable Protocol for Unicasting and Multicasting in Large Ad hoc Emergency Network. Vol.8 no.2 pp 154-165, IJCSNS.
Index Terms

Computer Science
Information Sciences

Keywords

Wormhole attack ad hoc network scalability geocasting security routing

Powered by PhDFocusTM