Secure Mechanism for DYMO Routing Protocol by using Elliptic Curve Cryptography in Mobil Ad-hoc Networks

International Journal of Computer Applications
© 2011 by IJCA Journal
Number 1 - Article 1
Year of Publication: 2011
Rayala Upendar Rao
Daranasi Veeraiah

Rayala Upendar Rao and Daranasi Veeraiah. Article:Secure Mechanism for DYMO Routing Protocol by using Elliptic Curve Cryptography in Mobil Ad-hoc Networks. International Journal of Computer Applications 31(11):35-41, October 2011. Full text available. BibTeX

	author = {Rayala Upendar Rao and Daranasi Veeraiah},
	title = {Article:Secure Mechanism for DYMO Routing Protocol by using Elliptic Curve Cryptography in Mobil Ad-hoc Networks},
	journal = {International Journal of Computer Applications},
	year = {2011},
	volume = {31},
	number = {11},
	pages = {35-41},
	month = {October},
	note = {Full text available}


Mobile ad hoc networks are wireless multi hop networks characterized by lack of centralization, in dynamic topologies. So there is a chance to get various types of attacks including denial of service attacks, which leads to consume the system resources like bandwidth, power and memory. To avoid these vulnerable attacks researchers proposed many schemes, but still those are possessing huge threats. Hence there is a necessity of new secure routing mechanism. So we introduced new secure mechanism by using Elliptic Curve Cryptography (ECC) with help of DYMO routing protocol. Here we implemented access control mechanism on ECC which ensure authentication and confidentiality. There by we can able to identify resource consumption attack and mitigates this by informing to other routing AGENT node about its identity and bootstrapping time. Here the main advantage with ECC is, it takes less memory provides great security and perfectly suitable for low power devices like mobile nodes. So the performance of the overall system is good compare with other secure routing mechanisms.


  • Clausen T., Jacquet P., Viennot L., “Comparative study of CBR and TCP performance of MANET routing protocols”, Project HiPERCOM – INRIA, France, 2003.
  • Grew P., Giudici F., Pagani E.”Specification of a functional architecture for e-learning supported by wireless technologies‖, Pervasive Computing and Communications Workshops, 2006. PerCom Workshops 2006. Fourth Annual IEEE International Conference on Volume, Issue, 13-17 March 2006 Page(s):5 pp. – 220
  • Hogie L., Bouvry P., ―An overview of MANET Simulation‖, Electronic notes in theoretical computer science, © 2006 Elsevier, doi:10.1016/j.entcs.2005.12.025.
  • E Belding-Royer, I Chakeres, D. Johnson and C Perkins, “DyMO – dynamic MANET on-demand routing protocol," Proceedings of the Sixty-First Internet Engineering Task Force, Washington, DC, USA, November 2004. IETF.
  • D. B. Johnson, D. A. Maltz, and Y.-C. Hu, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR),” Jul. 2004, NTERNET-DRAFT draft-ietf-manet-dsr-10.txt.
  • Online. Available:
  • Marjan Kuchaki Rafsanjani, Ali Asghar Khavasi and Ali Movaghar,”An Efficient Method for Identifying IDS Agent Nodes by Discovering Compromised Nodes in MANET” in proc ICCEE , Vol.01., pp.625-629, December 2009.
  • Adnan Nadeem and Michael Howarth ,”Adaptive intrusion detection & preventing of denial of service attacks in MANET”, ACM, pp.926-930, 2009.
  • Jian-HuaSong, Fan Hong and Yu Zhang,” Effective Filtering Scheme against RREQ Flooding Attack in Mobile Ad Hoc Networks”, Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 497-502 ,2006.
  • Hidehisa Nakayama,Satosi Kurosawa, Abbas Jamalipour,Yoshiaki Nemoto and Nei Kato, “ A Dynamic Anomaly Detection Scheme For AODV- Based Mobile AdHoc Networks”, IEEE Transactions On Vehicular Technology,Vol.58, No. 5, pp.2471-2481, June 2009.
  • Dong-Won Kum, Jin-Su Park, You-Ze Cho and Byoung-Yoon Cheon,” Performance Evaluation Of AODV and DYMO Routing Protocols in MANET”, in proc IEEE CCNC, Las Vegas, Nevada, USA, pp.1046-1047, Jan.2010.
  • C.K.Toh,”Ad-Hoc mobile wireless network protocol and system”, Pearson Education, 2009.
  • Dai Hong, Li Haibo.A Lightweight Network Intrusion Detection Model Based on Feature Selection. DOI 10.1109/PRDC.2009.34,p.p 165-168.
  • Wanli Ma, Dat Tran, Dharmendra Sharma,”A Study on the Feature Selection of NetworkTraffic for Intrusion Detection Purpose”p.p 245-247,2008, Taipei, Taiwan.
  • ACM. KDD CUP 1999 data.
  • Cited 12 January 2007; Available from:
  • H. Liu, Setiono and R., "Chi2: feature selection and discretization of numeric attributes", in Proc of the Seventh International Conference on Tools with Artificial Intelligence, pp. 388 - 391, 1995.
  • Hemanta Kumar Kalita, Avijit Kar, “Wireless Sensor Network Security Analysis,” International Journal of Next-Generation Networks (IJNGN), Vol.1, No.1, December 2009,1-9.
  • Yan Yu, Ramesh Govindan, Deborah Estrin, “Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks,” Aug 2001.
  • Brad Karp, H. T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” MobiCom 2000.
  • Pooja Sharma, Pawan Bhadana, “An Effective Approach for Providing Anonymity in Wireless sensor Network: Detecting Attacks and Security Measures,” (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 05, 2010, 1830-1835.
  • Shivangi Raman, Amar Prakash, Kishore Babu Pulla, Prateek Srivastava, Ashish Srivastava, Shveta Singh, “Wireless sensor networks: A Survey of Intrusions and their Explored Remedies,” International Journal of Engineering Science and Technology Vol. 2(5), 2010, 962-969.
  • Zaw Tun and Aung Htein Maw, “Wormhole Attack Detection in Wireless Sensor Networks,” orld Academy of Science, Engineering and Technology 46 2008, 545-550.
  • Yun Zhou, Yanchao Zhang, Yuguang Fang, “Access control in wireless sensor networks,” Ad - hoc Networks 5 (2007) 3–13.
  • Jiang Du, Su Peng, “Choice of Secure Routing Protocol for Applications in Wireless Sensor Networks,” 2009 International Conference on Multimedia Information Networking and Security.
  • Chris Karlof and David Wagner, “Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures,” Ad Hoc Networks 1 (2003) 293–315.
  • Fan Ye, Alvin Chen, Songwu Lu, Lixia Zhang, “A Scalable Solution to Minimum Cost Forwarding in Large Sensor Networks,” in Tenth International Conference on Computer Communications and Networks, 2001, pp. 304–309.
  • C. Intanagonwiwat, R. Govindan, and D. Estrin, “Directed diffusion: Ascalable and robust communication paradigm for sensor networks,” in Proceedings of the Sixth Annual International Conference on Mobile Computing and Networks (MobiCOM ’00), August 2000,58-67.
  • D. Ganesan, R. Govindan, S. Shenker, and D. Estrin, “Highly-resilient, energy-efficient multipath routing in wireless sensor networks,” Mobile Computing and Communications Review,oct 2001, Volume 1, Number 2,1-13.
  • Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Micro sensor Networks,” Proceedings of the 33rd Hawaii International Conference on System Sciences – 2000.
  • D. Braginsky and D. Estrin, “Rumour routing algorithm for sensor networks,” in First ACM International Workshop on Wireless Sensor Networks and Applications, 2002.
  • Zhen Yu, Member, IEEE, and Yong Guan, Member, IEEE, “A Dynamic En-route Filtering Scheme for Data Reporting in Wireless Sensor Networks,” IEEE/ACM Transactions on Networking, Vol. 18, No. 1, February 2010,150-163.