Main Reference Paper Opportunistic Routing With Congestion Diversity in Wireless Ad Hoc Networks, IEEE/ACM Transactions on Networking, April 2016 [NS2].
  • A distributed opportunistic routing policy with congestion diversity (D-ORCD) is proposed by combining important aspects of shortest path and backpressure routing. D-ORCD uses a measure of draining time to opportunistically identify and route packets along the paths with an expected low overall congestion.

+ Description
  • A distributed opportunistic routing policy with congestion diversity (D-ORCD) is proposed by combining important aspects of shortest path and backpressure routing. D-ORCD uses a measure of draining time to opportunistically identify and route packets along the paths with an expected low overall congestion.

  • To improve the throughput.

  • To reduce the delay.

+ Aim & Objectives
  • To improve the throughput.

  • To reduce the delay.

  • The technique is contributed to generalize D-ORCD for joint routing and scheduling optimizations as well considering the system-level implications.

+ Contribution
  • The technique is contributed to generalize D-ORCD for joint routing and scheduling optimizations as well considering the system-level implications.

  • 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.