Main Reference PaperImproved Performance of AODV Routing Protocol with Increasing Number of Nodes using Traveling Salesman Problem, International Journal of Computer Applications, July 2014.
  • Improve the Performance of AODV using Travelling Salesman Problem with Conventional Ad Hoc on Demand Distance Vector Routing Protocol (AODV) in order to minimize network load on the network and to maintain the throughput.

+ Description
  • Improve the Performance of AODV using Travelling Salesman Problem with Conventional Ad Hoc on Demand Distance Vector Routing Protocol (AODV) in order to minimize network load on the network and to maintain the throughput.

  • To improving QoS in Mobile Ad hoc Network.

  • To minimize the network load on the network.

+ Aim & Objectives
  • To improving QoS in Mobile Ad hoc Network.

  • To minimize the network load on the network.

  • In this technique increase the packet delivery ratio and decrease the delay.

+ Contribution
  • In this technique increase the packet delivery ratio and decrease the delay.

  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

+ Software Tools & Technologies
  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

  • B.E / B.Tech / M.E / M.Tech

+ Project Recommended For
  • B.E / B.Tech / M.E / M.Tech

Professional Ethics: We S-Logix would appreciate the students those who willingly contribute with atleast a line of thinking of their own while preparing the project with us. It is advised that the project given by us be considered only as a model project and be applied with confidence to contribute your own ideas through our expert guidance and enrich your knowledge.