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

TODV: Performance Analysis of a Time on Demand Distance Vector Protocol for MANETS

by G.S. Mamatha, Dr. S.C. Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 28 - Number 2
Year of Publication: 2011
Authors: G.S. Mamatha, Dr. S.C. Sharma
10.5120/3359-4636

G.S. Mamatha, Dr. S.C. Sharma . TODV: Performance Analysis of a Time on Demand Distance Vector Protocol for MANETS. International Journal of Computer Applications. 28, 2 ( August 2011), 32-36. DOI=10.5120/3359-4636

@article{ 10.5120/3359-4636,
author = { G.S. Mamatha, Dr. S.C. Sharma },
title = { TODV: Performance Analysis of a Time on Demand Distance Vector Protocol for MANETS },
journal = { International Journal of Computer Applications },
issue_date = { August 2011 },
volume = { 28 },
number = { 2 },
month = { August },
year = { 2011 },
issn = { 0975-8887 },
pages = { 32-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume28/number2/3359-4636/ },
doi = { 10.5120/3359-4636 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:13:44.260205+05:30
%A G.S. Mamatha
%A Dr. S.C. Sharma
%T TODV: Performance Analysis of a Time on Demand Distance Vector Protocol for MANETS
%J International Journal of Computer Applications
%@ 0975-8887
%V 28
%N 2
%P 32-36
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In MANET (Mobile Adhoc Network) the physical connectivity of the network keeps on changing dynamically. Because of the several MANET constraints such as limited bandwidth, mobility, battery power etc; it becomes very important to design a protocol that suits the requirements for MANETS. In this paper, we suggest a protocol mechanism which is loosely based on a reactive protocol AODV (Ad Hoc On demand Distance Vector Protocol). The proposed protocol uses the time concept based on first come first served basis for path choosing process, hence the name Time On Demand Distance Vector Protocol (TODV). The protocol design presented here suits the MANETS dynamic topology perfectly in finding the best path or route for data communication. The simulation study reveals that the proposed protocol outperforms than existing AODV, in terms of throughput and end-to-end delay.

References
  1. Sandhya Khurana, Neelima Gupta, Nagender Aneja, “Minimum Exposed path to the Attack (MEPA) in Mobile Ad Hoc Network (MANET)” In proceedings of ICN ’07, Sixth International conference on Networking, IEEE Computer Society, 2007.
  2. Matthias Hollick, Jens Schmitt, Christian Seipl, and Ralf Steinmetz “On the Effect of Node Misbehavior in Ad Hoc Networks”, http://disco.informatik.uni-kl.de/publications/ HSSS04-2.pdf.
  3. Pietro Michiardi and Refik Molva “Simulation-based Analysis of Security Exposures in Mobile Ad Hoc Networks” http://www.eurecom.fr/michiard/pubs/mimo02-EW2002.pdf.
  4. P. Papadimitratos, Z. Haas, “Secure Routing for Mobile Ad Hoc Networks”, Proceedings of CNDS 2002.
  5. Y-C Hu, A. Perrig, D. B. Johnson, “Ariadne : A secure On-Demand Routing Protocol for Ad Hoc Networks”, in proceedings of MOBICOM 2002.
  6. B. Dahill, B. N. Levine, E. Royer, C. Shields, “ARAN: A secure Routing Protocol for AdHoc Networks”, UMass Tech Report 02-32, 2002.
  7. Yih-Chun Hu, David B. Johnson, and Adrian Perrig, “SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad hoc Networks”, Proceedings of the 4th IEEEWorkshop on Mobile Computing Systems & Applications (WMCSA 2002), IEEE, Calicoon, NY, 2002.
  8. L. Buttyan, J.-P. Hubaux, “Nuglets: a virtual currency to stimulate cooperation in selforganized ad hoc networks”, Technical Report DSC/2001/001, Swiss Federal Institute of Technology – Lausanne, 2001.
  9. S. Buchegger and J.-Y. Le Boudec, “Performance analysis of the CONFIDANT protocol (cooperation of nodes: Fairness in dynamic ad-hoc networks)”, Proceedings of The Third ACM International Symposium on Mobile Ad Hoc Networking and Computing, 9-11 June, 2002, Lausanne, Switzerland, ACM Press, 2002, pp. 226-236.
  10. Pietro Michiardi and Refik Molva, “CORE: A COllaborative REputation Mechanism to enforce node cooperation in Mobile Ad hoc Networks”, Sixth IFIP conference on security communications, and multimedia (CMS 2002), Portoroz, Slovenia., 2002.
  11. Seung Yi, Prasad Naldurg, Robin Kravets, “A Security-Aware Routing Protocol for Wireless Ad Hoc Networks”, Proceedings of 6th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI), Orlando, FL, July 2002, pp. 286-292.
  12. Charles E. Perkins, Elizabeth M. Belding Royer and Samir R. Das, “Ad-hoc On-Demand Distance Vector (AODV) Routing”, Mobile Ad-hoc Networking Working Group, Internet Draft, draft-ietf-manetaodv- 00.txt, February 2003.
  13. Charles E. Perkins and Pravin Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”, Proceedings of the SIGCOMM ’94 Conference on Communications Architectures, Protocols and Applications, August 1994, pp. 234-244.
  14. D. B. Johnson, D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks”, Mobile Computing, edited by Tomasz Imielinski and Hank Korth, Chapter 5, pages 153- 181, Kluwer Academic Publishers, 1996.
  15. Yongguang Zhang and Wenke Lee, “Intrusion Detection in Wireless Ad-Hoc Networks” Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking (Mobi-Com’2000), August 6-11,2000, Boston, Massachussetts.
  16. Yi-an Huang,Wenke Lee,“A Cooperative Intrusion Detection System for Ad Hoc Networks”, Proceedings of the First ACM Workshop Security of Ad Hoc and Sensor Networks Fairfax, Virginia.
  17. Yongguang Zhang, Wenke Lee, Yi-an Huang, “Intrusion Detection Techniques for Mobile Wireless Networks” Wireless Networks 9,545-556,2003,_c 2003 Kluwer Academic Publishers.
  18. C. Siva Ram Murthy, B. S. Manoj, “Ad Hoc Wireless Networks, Architectures and Protocols”, Low Price Edition, Pearson Education, 2007.
  19. S.Marti, T. J. Giuli, K. Lai, and M. Baker, “ Mitigating routing misbehavior in mobile ad hoc networks.In Mobile Computing and Networking”, pages 255–265,2000. Also available as http://citeseer.nj.nec.com/marti00mitigating.html
  20. H.Yang, X.Meng, and S.Lu, “ Self-organized network layer security in mobile ad hoc networks”, in Workshop on Wireless Security (Wise’02), Septemper 2002.
  21. S. Zhong, J. Chen, and Y.R. Yang, “Sprite: A Simple, Cheat-Proof,Credit-Based System for Mobile Ad-Hoc Networks,” Proc.INFOCOM, Mar.- Apr. 2003
  22. K. Balakrishnan, J. Deng, and P.K. Varshney, “TWOACK:Preventing Selfishness in Mobile AdHoc Networks,” Proc. IEEEWireless Comm. and Networking Conf. (WCNC ’05), Mar. 2005.
  23. Kejun Liu, Jing Deng, , Pramod K. Varshney, and Kashyap Balakrishnan, “An Acknowledgment-Based Approach for the Detection of Routing Misbehavior in MANETs,” In IEEE Transactions On Mobile Computing, pages 488 – 502,VOL. 6, NO. 5, MAY 2007.
  24. Dhaval Gada, Rajat Gogri, Punit Rathod, Zalak Dedhia, Nirali Mody, Sugata Sanyal and Ajith Abraham. “A Distributed Security Scheme for Ad Hoc Networks”, ACM Publications, Vol-11, Issue 1, pp.5–5, 2004.
  25. Perkins C.E., Terminology for Ad-Hoc Networking, Draft-IETF-MANET-terms-00.txt, November 1997.
  26. C.E. Perkins, E. M. Royer, “Ad Hoc On-Demand Distance Vector Routing”, Proceedings of IEEE Workshop on Mobile Computing systems and Applications 1999, pp. 90-100, February 1999.
Index Terms

Computer Science
Information Sciences

Keywords

Mobile ad hoc network protocol communication time

Powered by PhDFocusTM