Mobility Based Performance Analysis DYMO, STAR and DSR Adhoc Routing Protocols

Abstract:

The wireless adhoc network is comprised of nodes (it can be static or mobile) with wireless radio interface. Each host is equipped with a CSMA/CA (carrier sense multiple access with collision avoidance) transceiver. These nodes are connected among themselves without central infrastructure and are free to move around. It is a multihop process because of the limited transmission range of energy constrained wireless nodes. This creates the scenario of multihop, where the packets originated from the source host are relayed through several intermediate hosts before reaching the destination. Routing is the process of finding a path from a source to destination among randomly distributed routers in dynamic network. In this paper table driven routing protocol STAR and on demand routing protocols DSR, DYMO based on IEEE 802.11 are surveyed and characteristic summary of these routing protocols is presented. Their performance is also analyzed on performance metrics throughput, jitter, data delivery ratio and end-to-end delay by varying nodes mobility with CBR data traffic load using QualNet 5.0.2 network simulator.

• Periodical: Advanced Materials Research (Volumes 403-408)
• Pages: 3446-3453
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.403-408.3446
• Online since: November 2011
• Authors: Parma Nand, S.C. Sharma
• Keywords: Adhoc Networks, CBR, DSR, DYMO, EEE 802.11, MAC, Performance Evaluation, Route Discovery, Routing Protocol, Simulation, STAR, Wireless Network

References

[1] C.K. Toh. Ad hoc Mobile Wireless Networks: Protocols and Systems, Prentice Hall PTR. 2002: 55-77.

[2] IEEE, 1997, Wireless LAN Medium Access Control(MAC) and Physical layer PHY) Specifications, IEEE Std. 802. 11.

DOI: 10.1109/ieeestd.1997.85951

[3] Qualnet Simulator www. scalable-networks. com.

[4] N.S. Yadav, and R.P. Yadav, 2007, Performance Comparison and Analysis of Table- Driven and On-Demand Routing Protocols for Mobile Ad-hoc Networks, International Journal of Information Technology, Vol. 4, No. 2, pp.101-109.

[5] A.A. Pirzada, C. McDonald, and A. Datta, 2006, Performance Comparison of Trust-Based Reactive Routing Protocols, IEEE Transactions on Mobile Computing Vol. 5 No. 6 pp.695-710.

DOI: 10.1109/tmc.2006.83

[6] Elizabeth Belding, Royer, Routing approaches in mobile ad hoc networks, in: S. Basagni, M. Conti, S. Giordano, I. Stojemenvoic (Eds), Ad Hoc Networking, IEEE Press Wiley, New York, (2003).

DOI: 10.1002/0471656895.ch10

[7] Parma Nand, S.C. Sharma, Rani Astya, Traffic Load based Performance Analysis of DSR, STAR & AODV Adhoc Routing Protocol, International Journal of Advanced Computer Science and Applications (IJACSA), vol 1 No 4, pp.58-62, oct (2010).

DOI: 10.14569/ijacsa.2010.010410

[8] S.Y. Ni, Y.C. Tseng, Y.S. Chen, J.P. Sheu, The broadcast storm problem in a mobile ad hoc network, in: Proceedings of the 1999 Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking, IEEE Computer Society, New York, p.151–162, August (1999).

DOI: 10.1145/313451.313525

[9] Qi Zhang , Dharma P. Agrawal, Dynamic probabilistic broadcasting in MANETs, Journal of Parallel and Distributed Computing 65(2), pp.220-233, February (2005).

DOI: 10.1016/j.jpdc.2004.09.006

[10] B. Williams, T. Camp, Comparison of broadcasting techniques for mobile ad hoc networks, in: Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC 2002), p.194–205, (2002).

DOI: 10.1145/513800.513825

[11] Perkins C, Bhagwat P, Highly Dynamic Destination-Sequenced Distance-Vector Routing(DSDV) Routing", SIGCOMM, 94 Computer Communication Rewiev, vol 24, no. 4, pp.234-244, October (1994).

DOI: 10.1145/190809.190336

[12] J.J. Garcia-Luna-Aceves, M. Spohn, Source-Tree Adaptive Routing in Wireless Networks, Proceedings of the 7th Annual IEEE international conference on Network Protocols, Toronto, Canada. October 31- November 3, 1999. http: /www. ieee-icnp. org/1999/ papers/1999-29. pdf.

DOI: 10.1109/icnp.1999.801950

[13] Charles Perkins, Elizabeth Royer, and Samir Das. Ad hoc on demand distance vector (AODV) routing,. IETF RFC No. 3561, July (2003).

DOI: 10.17487/rfc3561

[14] Josh Broch, David Johnson, and David Maltz. "The dynamic source routing protocol for mobile adhoc networks for IPv4 IETF RFC 4728, Feb (2007).

DOI: 10.17487/rfc4728

[15] D. Johnson and D. Maltz. Dynamic source routing in ad hoc wireless networks,. In T. Imielinski and H. Korth, editors, Mobile computing, chapter 5. Kluwer Academic, (1996).

DOI: 10.1007/978-0-585-29603-6_5

[16] Ian D. Chakeres and Charles E. Perkins. Dynamic MANET on demand (DYMO) routing protocol. Internet- Draft Version 06, IETF, October (2006).

[17] V. Park, and S. Corson, Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification, draft-ietf-manet-tora-spec-04. txt, July (2001).

[18] Zygmunt J. Haas, Marc R. Pearlman, and Prince Samar, The Zone Routing Protocol (ZRP) for Adhoc Networks, draft-ietf-manet-zone-zrp-04. txt, July, 2002. TABLE II. Charcteristic Summery of DSR, DYMO, STAR Routing Protocol Protocol Dynamic Source Routing (DSR).

DOI: 10.1109/icacce46606.2019.9079958

[14] .

[15] Dynamic MANET On-demand (DYMO).

[16] SOURCE TREE ADAPTIVE ROUTING (STAR).

[12] Category Reactive Reactive Proactive Metrics Shortest path, next available Shortest path. It avoids expiring good route Shortest path works in two mode · Least Overhead Routing Approach (LORA) mode or · Optimum Routing Approach (ORA) mode Route Recovery New route, notify source Same as DSR, local repair Reverse link Route repository Route cache Routing table Routing table Broadcasting Simple Simple Simple Loop freedom maintenance Source route Sequence number Updated messages Multiple paths Yes No No Communication Overhead High High High Feature Completely on demand Only keeps track of next hop in route. It stores minimal routing information Control packets localized to area of topology change.

DOI: 10.1109/ncccs.2012.6413009