We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Performance of Comparison between AODV and Secured Protocol

by J. Vani, Al. Visalatchi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 66 - Number 19
Year of Publication: 2013
Authors: J. Vani, Al. Visalatchi
10.5120/11191-6312

J. Vani, Al. Visalatchi . Performance of Comparison between AODV and Secured Protocol. International Journal of Computer Applications. 66, 19 ( March 2013), 11-15. DOI=10.5120/11191-6312

@article{ 10.5120/11191-6312,
author = { J. Vani, Al. Visalatchi },
title = { Performance of Comparison between AODV and Secured Protocol },
journal = { International Journal of Computer Applications },
issue_date = { March 2013 },
volume = { 66 },
number = { 19 },
month = { March },
year = { 2013 },
issn = { 0975-8887 },
pages = { 11-15 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume66/number19/11191-6312/ },
doi = { 10.5120/11191-6312 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:22:51.441905+05:30
%A J. Vani
%A Al. Visalatchi
%T Performance of Comparison between AODV and Secured Protocol
%J International Journal of Computer Applications
%@ 0975-8887
%V 66
%N 19
%P 11-15
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In mobile ad hoc networks packets are relayed over multiple hops to reach their destination. Due to the features of open medium, dynamic topology, cooperative algorithms, lack of centralized monitoring and management point mobile ad-hoc networks are much more vulnerable to security attacks when compared to the wired networks. A number of secure routing schemes have been brought forward. However, existing anonymous routing protocols mainly consider anonymity and partial unlinkability in MANET. Complete unlinkability and unobservability are not guaranteed due to incomplete content protection. The main objective of the project is to provide an anonymous routing and secure communications in mobile ad hoc networks. Therefore a new on demand routing protocol called Unobservable Secure On demand Routing protocol (USOR) is proposed to offer complete unlinkability and content unobservability for all types of packets. USOR is efficient as it uses a novel combination of group signature and ID-based encryption for route discovery. Security analysis demonstrates that USOR can well protect user privacy against both inside and outside attackers. USOR is implemented by using ns2, and evaluate its performance by comparing with AODV.

References
  1. A. Pfitzmann and M. Hansen, "Anonymity, unobservability, and pseudonymity: a consolidated proposal for terminology," draft, July 2000.
  2. Y. Zhu, X. Fu, B. Graham, R. Bettati, and W. Zhao, "On flow correlation attacks and countermeasures in mix networks," in PET04, LNCS 3424, 2004, pp. 207–225.
  3. D. Chaum, "Untraceable electronic mail, return , and digital pseudonyms," Commun. of the ACM, vol. 4, no. 2, Feb. 1981
  4. S. Capkun, L. Buttyan, and J. Hubaux, "Self-organized public-keymanagement for mobile ad hoc networks," IEEE Trans. Mobile Comput. , vol. 2, no. 1, pp. 52–64, Jan. -Mar. 2003.
  5. J. Kong and X. Hong, "ANODR: aonymous on demand routing withuntraceable routes for mobile ad-hoc networks," in Proc. ACM MOBIHOC' 03, pp. 291–302.
  6. B. Zhu, Z. Wan, F. Bao, R. H. Deng, and M. KankanHalli, "Anonymous secure routing in mobile ad-hoc networks," in Proc. 2004 IEEEConference on Local Computer Networks, pp. 102–108.
  7. S. Seys and B. Preneel, "ARM: anonymous routing protocol for mobilead hoc networks," in Proc. 2006 IEEE International Conference on Advanced Information Networking and Applications, pp. 133–137.
  8. L. Song, L. Korba, and G. Yee, "AnonDSR: efficient anonymousdynamic source routing for mobile ad-hoc networks," in Proc. 2005ACM Workshopon Security of Ad Hoc and Sensor Networks, pp. 33–42.
  9. Y. Dong, T. W. Chim, V. O. K. Li, S. -M. Yiu, and C. K. Hui, "ARMR:anonymous routing protocol with multiple routes for communicationsin mobile ad hoc networks," Ad HocNetworks, vol. 7, no. 8, pp. 1536– 2009.
  10. A. Boukerche, K. El-Khatib, L. Xu, and L. Korba, "SDAR: a securedistributed anonymous routing protocol for wireless and mobile ad hocnetworks," in Proc. 2004 IEEE LCN, pp. 618–624.
  11. D. Sy, R. Chen, and L. Bao, "ODAR: on-demand anonymous routingin ad hoc networks," in 2006 IEEE Conference on Mobile Ad-hoc andSensor Systems.
  12. J. Ren, Y. Li, and T. Li, "Providing source privacy in mobile ad hoc," in Proc. IEEE MASS'09, pp. 332–341.
  13. Y. Zhang, W. Liu, and W. Lou, "Anonymous communications in mobile ad hoc networks," in 2005 IEEE INFOCOM.
  14. K. E. Defrawy and G. Tsudik, "ALARM: anonymous location-aidedrouting in suspicious MANETs," IEEE Trans. Mobile Comput. , vol. 10, no. 9, pp. 1345–1358, 2011.
  15. K. E. Defrawy and G. Tsudik, "Privacy-preserving location-based on-demand routing in MANETs," IEEE J. Sel. Areas Commun. , vol. 29, no. 10, pp. 1926– 1934, 2011.
  16. J. Han and Y. Liu, "Mutual anonymity for mobile peer-to-peer systems," IEEE Trans. Parallel Distrib. Syst. , vol. 19, no. 8, pp. 1009–1019, Aug. 2008.
  17. Y. Liu, J. Han, and J. Wang, "Rumor riding: anonymizing unstructured peer-to-peer systems," IEEE Trans. Parallel Distrib. Syst. , vol. 22, no. 3, pp. 464–475, 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Routing protocols security anonymity unobservability ad hoc networks unlinkability

Powered by PhDFocusTM