Comparative Analysis of Distributed Adaptive Opportunistic Routing and Extremely Opportunistic Routing (Exor) in Mobile Ad Hoc Network

Authors

  • P. Balamurugan  Research Scholar, Periyar University, Salem, India
  • Dr. S. Dhanalakshmi   Professor, Department of Computer Science, Vivekanandha College of Arts and Science for Women (Autonomous), Tiruchengode, India

Keywords:

Distributed Adaptive Opportunistic Routing (d-AdaptOR), Extremely Opportunistic Routing (ExOR),Packet Ratio and formation, Traffic Rate, Transmission Delay

Abstract

Opportunistic routing is a new standard protocol in routing process for performing with wireless sensor network. Opportunistic routing has essentially boosted the efficiency, transmission reliability of sensor networks, and network throughput by taking benefit of the broadcast nature of the wireless sensor networks. Opportunistic routing has attracted in recent times to pay more attention as it is regarded as a promising direction for enhancing the performance of the wireless sensor networks and wireless ad hoc networks. By way of opportunistic routing, it chooses only the node closest to the target node for forwarding the packet and intermediate nodes collaborate on packet forwarding in a consistent and localized manner. From this paper, an extremely opportunistic routing scheme and distributed adaptive opportunistic routing scheme for utilizing multi-hop wireless ad-hoc networks is clarified in detail manner.

References

  1. C. Lott and D. Teneketzis, "Stochastic routing in ad hoc wireless networks," in Proc. 39th IEEE Conf. Decision Control, 2000, vol. 3, pp. 2302–2307, vol. 3.
  2. M. Zorzi, R.R. Rao, Geographic Random Forwarding (GeRaF) for ad hoc and sensor networks: energy and latency performance, in IEEE Trans. on Mobile Computing, this issue.
  3. S. Biswas and R. Morris, "ExOR: Opportunistic Multi-Hop Routing for Wireless Networks", in Proc. ACM Conference of the Special Interest Group on Data Com-munication (SIGCOMM), Philadelphia, PA, USA, Au-gust 2005, pp. 133144.
  4. D. De Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. In Proc. ACM/IEEE MobiCom, September 2003.
  5. Multihop Wireless Networks: Opportunistic Routing ,Dr Kai Zeng, Drwenjing Lou, Ming Li, Wiley July 2011.
  6. C. L. Barrett, S. J. Eidenbenz, L. Kroc, M. Marathe, and J. P. Smith. Parametric probabilistic sensor network routing. In proc. ACM WSNA '03, doi 10.1145/ 941350.941368, 2003.
  7. Probabilistic Routing in Wireless Ad hoc Networks by Vangelis Angelakis, Di Yuan and Niki Gazoni.
  8. C. Cetinkaya and E. Knightly. Opportunistic traffic scheduling over multiple network paths. In Proc. IEEE Infocom. IEEE, September 2004.
  9. R. Roy Choudhury and N. Vaidya. MAC layer any casting in wireless networks. In Second workshop on Hot Topics in Networks (HotNets II), November 2003.
  10. J. Boyan and M. Littman, "Packet routing in dynamically changing networks: A reinforcement learning approach," in Proc. NIPS, 1994,pp. 671–678.
  11. J. W. Bates, "Packet routing and reinforcement learning: Estimating shortest paths in dynamic graphs," 1995, unpublished.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2018-08-30

Issue

Volume 3, Issue 6, July-August-2018

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
P. Balamurugan, Dr. S. Dhanalakshmi , " Comparative Analysis of Distributed Adaptive Opportunistic Routing and Extremely Opportunistic Routing (Exor) in Mobile Ad Hoc Network, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 6, pp.490-500, July-August-2018.