Preview

Routing in Mobile Ad Hoc Network

Powerful Essays
Open Document
Open Document
10290 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Routing in Mobile Ad Hoc Network
Master Thesis Master of Science in Electrical Engineering Thesis no: MSE-20110 September 2010

Performance Issues of Routing Protocols in MANET

ABSTRACT
A mobile ad-hoc network is an assortment of wireless mobile hosts, which establishes a momentary network without any assist of centralized administrator. The characteristics of an ad-hoc network can be explored on the base of routing protocols. The dynamic topology is the vital characteristic in which nodes frequently change their position. In the ad-hoc networks, there are mobile nodes such as personal digital assistance (PDA), smart phone and laptops; they have limited operational resources like battery power and bandwidth. Thus the control traffic is to be minimized, which is the main responsibility of routing protocols by selecting the shortest path and controlling the traffic. In this study work we focus on performance issues of routing protocols Optimized Link State Routing (OLSR), Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Temporally Ordered Routing Algorithm (TORA) in mobility and standalone ad-hoc networks. For this purpose we first study and explain these protocols and then we use the Optimized Network Engineering Tool (OPNET) modeler tool and analyze the performance metrics delay, throughput and network load. Keywords: MANET, Performance Evaluation, Routing Protocols, Ad-hoc Network, Routing Challenges, Performance Metrics and Mobility

1

2

ACKNOWLEDGEMENTS
In the name of ALLAH, who is most merciful and compassionate, and in our Holy Prophet (PBUH), whose love is the soul of our life in this world and Hereafter. I am thankful to my parents, my wife, my sons Zain Ali, Muhammad Shamraiz and my daughter and my brothers who sacrificed in my absence and have always prayed for me with heart and soul that become a guiding force to complete my studies successfully. Tahir Saleem I am thankful to my parents, and all of my family members who provide me the



References: [1] David B.Johnson, David A. Maltz, “Dynamic Source Routing in Ad-hoc Wireless Network”, Computer Science Department Carnegie Mellon University. [2] Dr. F. Scott, Dr. A. Luiz Dr. J. Ira and Dr. P. Charles, “Mobile Ad hoc network Routing Protocols Methodologies and Applications”, Department of Computer Engineering ,Blacksburg Virginia, March 19, 2004. [3] “Mobile Ad Hoc Networks”,http://w3.antd.nist.gov/wahn_mahn.shtml. [Accessed: April,28, 2010] [4] K. Gorantala, “Routing Protocols in Mobile Ad-hoc Networks”, Department of Computer Science, Umeå University, June 15, 2006. [5] H. Jeroen, L. Benoit, M. Ingrid, D. Bart, and D. Piet, “Routing in mobile Ad hoc Networks”, Department of Information Technology (INTEC), Broadband Communication Networks (IBCN). [6] Dr. G. Aditya, S. Ajaii, “Performance of Mobile Ad-hoc Network using AODV Protocol”, Departmetn of Electronics & Communication Engineering, Department of Information Technology, Maulana Azad National Institute of Technology, Bhopal, India- 462051. [7] D.B. Johnson, D.A. Maltz, J. Broch, "The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks," Computer Science Department Carnegie Mellon University. [8] L. Kwan Hui, “Performance Enhancement of Temporally-Ordered Routing Algorithm”, School of Computer Science and Software Engineering, The University of Western Australia, 2007. [9] T. Andreas, “Implementing and Extending the Optimized Link State Routing Protocol”, Unik University of Graduate Center, University of Oslo, August 1st, 2004. [10] N. Bained, M. Jason, “Performance Evaluation of Routing Protocols in Mobile Ad-hoc Networks”, School of Engineering, Blekinge Institute of Technology, January 2009. [11] K. Zoorush, K. Ziarati and , V. Nazari Talooki “Performance Comparison of Routing Protocols for Mobile ad-hoc Networks” Asia-Pacific Conference on Communications, APCC, 2006, pp. 1 – 5 [12] M. Zorzi, Bertocchi, G. Mazzini and P. Bergamo “Performance Comparison of routing protocols for Ad hoc networks,” IEEE Global Telecommunications Conference, GLOBECOM, 2003, pp. 1033 – 1037 [13] Mohamed I. Youssef, Mohamed M. Zahra and Amr M. Hassan “Evaluation of ad-hoc Routing Protocols in Real Simulation Environments” The 2006 International Conference on Computer Engineering and Systems, 2006, pp. 288 – 293 [14] The GloMoSim Simulator, http://pcl.cs.ucla.edu/projects/glomosim/, last viewed: 2010-08-27 [15] L. Girons Quesada, Y. Jiang and J. Xie, „„A Threshold-based Hybrid Routing Protocol for MANET‟‟. Department of Telematics, Norwegian University of Science and Technology. [16] B. Azzedine, A. Mohammad Z, T. Damla and T. Begumhant, “A Taxonomy of Routing Protocols for Mobile Ah Hoc Network”, in Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks , Ed University of Ottawa Ottawa, PP 129-158 [17] A. movaghar, M. Kuchakri Rafsanjani and F. Koroupi, „„Investigating Intrusion Detection Systems in MANET and Comparing IDSs for Detecting Misbehaving Nodes‟‟, World Academy of Science, Engineering and Technology 44 2008 [18] D. Kiwior and L. Lam, “Routing Protocol Performance over Intermittent Links” Military Communications Conference, MILCOM, IEEE, 2007, pp. 1 – 8 [19] Routing protocols and concepts, CCNA exploration companion guide. „„Introduction to dynamic routing protocols‟‟. Chapter three pages 148 to 177. [20] S. Demers and L. Kant, “MANETs: Performance Analysis and Management”, Military Communications Conference, MILCOM, 2006, pp.1 – 7 51 [21] A. Zahary, A. Ayesh, “Analytical study to detect threshold number of efficient routes in multipath AODV extensions”, proceedings of International Conference of Computer Engineering & Systems, ICCES, 2007, pp. 95 – 100 [22] Lijuan Cao, K. Sharif, Yu Wang, T. Dahlberg, “Adaptive Multiple Metrics Routing Protocols for Heterogeneous Multi-Hop Wireless Networks”, proceedings for 5th CCNC Consumer Communications and Networking Conference, IEEE, 2008, pp. 13 – 17 [23] R. Misra and C.R. Mandal, “Performance comparison of AODV/DSR on-demand routing protocols for ad hoc networks in constrained situation” ICPWC International Conference, IEEE, 2005, pp. 86 – 89 [24] Jin Mook Kim, In Sung Han, Jin Baek Kwon, Hwang Bin Ryou, “A Novel Approach to Search a Node in MANET”, Information Science and Security, ICISS, 2008, pp. 44 – 48 [25] S. R. Chaudhry, A. Al-Khwildi, Y. Casey, H. Aldelou, “A Performance Comparison of Multi OnDemand Routing in Wireless Ad Hoc Networks”, Wireless Network and Communications Group (WNCG), School of Engineering & Design, Brunel University, West London [26] Mohammad Naserian, Kemal E. Tepe and Mohammed Tarique, “Routing overhead analysis for reactive routing protocols in wireless ad hoc networks,” IEEE Conference on Wireless And Mobile Computing, Networking And Communications, WiMob, 2005, pp. 87 – 92 [27] Uyen Trang Nguyen and Xing Xiong, “Rate-adaptive Multicast in Mobile Ad hoc Networks,” IEEE International Conference on Ad hoc and Mobile Computing, Networking and Communications, WiMob, Montreal, Canada, 2005 [28] OPNET Modeler 14.5 Documentation [29] Overview and Challenges of Routing Protocols and MAC Layer in Mobile Ad Hoc Network, J. Jyoti, F. Mehajabeen, Dr. G. Roopam, Dr. K. Bandhopadhyay, Journal of Theoretical and Applied Information Technology, P 7-11. [30] S. Satish Mahadevan and A. Azad, “Data Aggregation in static ad-hoc networks”, College of information science and technology, University of Nebraska at Omaha, 8-10 December 2008. [31] y. Rui, Z. Baolin, D. Zhuanhua and Z. Qifei, “An Eneregy Entropy-based Power-consuming Multicast Routing of Ad Hoc Network”, University of Economics, School of Computing, Hubei University of Economics, Wuhan 430205, P. R. China. [32] P. Chenna Reddy, Dr. P. Chandraskhar Reddy, “Performance Analysis of Adhoc Network Routing Protocols”, JNTU University, Andhra Pradesh, India, JNT University, Hyderabad, Andhra Pradesh, India. [33] N. Adam, M. Y. Ismail, J. Abdullah, “Effect of Node Density of Performances of Three MANET Routing Protocols”, Department of Science Physics, Department of Communication Eng., Faculity of Science and Technology, Fac. of Electrical and Electronic Eng., University of Malaysia Terengganu, University of Tun Hussein Onn Malayasia 2010, P 321-325. [34] Q. Liang, “Pro-Active Route Maintenance in DSR”, School of Computer Science Carleton University, Ottawa, Canda, August, 2001. [35] “The Dynamic Source Routing Protocol”, http://www.rfc-archive.org/getrfc.php?rfc=4728 [Accessed September 27, 2010]. [36] H. S. Bindra, S. K. Maakar and A. L. Sangal, “Performance Evaluation of Two Reactive Routing Protocols of MANET using Group Mobility Model”, IJCSI (Internal journal of Computer Science Issues, Vol. 7, Issue. 3, No 10, May 2010. 52

You May Also Find These Documents Helpful

  • Satisfactory Essays

    Nt1310 Unit 7

    • 410 Words
    • 2 Pages

    Note that the fact that the on-demand approach of the AODV protocol minimizes routing table information. AODV uses traditional routing tables as it is a reactive routing protocol. To determine whether routing information is up-to-date and to prevent routing loops sequence numbers are used. The maintenance of time-based states is a crucial feature of AODV which suggests that a routing entry that isn't recently used is expired. In case of route breakage, the neighbours are notified. The discovery of the route from source to destination relies on query and reply cycles and intermediate nodes store the route information within the type of route table entries along the…

    • 410 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    ITNE455-1204A-01 U3GP3

    • 5030 Words
    • 21 Pages

    Little, M. (1989, October). Goals and Functional Requirements for Inter-Autonomous System Routing: RFC 1126. Retrieved from http://tools.ietf.org/html/rfc1126…

    • 5030 Words
    • 21 Pages
    Powerful Essays
  • Best Essays

    Cordeiro, C., Gossain, H., and Agrawa, D. "Multicast over wireless mobile ad hoc networks: present and future directions", IEEE Network, 17(1), 2003.…

    • 1489 Words
    • 5 Pages
    Best Essays
  • Satisfactory Essays

    Unit 2 Lab 2.1

    • 374 Words
    • 2 Pages

    Wi-Fi wireless networks support ad hoc connections between devices. Ad hoc Wi-Fi networks are pure peer to peer compared to those utilizing wireless routers as an intermediate device.…

    • 374 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    show that the proposed framework is fast (two rounds of communication among nodes, regardless of network size) and outperforms an existing method.…

    • 8009 Words
    • 33 Pages
    Good Essays
  • Satisfactory Essays

    LYT2 Task2

    • 4061 Words
    • 12 Pages

    This book provides generic approach architecture for the implementation of the wireless sensor networks. It proposes for a move into the routing protocols and improvement of networks through routing optimization, medium access and control of power while at the same time fulfilling the daily goals. It emphasizes on the importance to node information in the many wireless sensor network applications as well as the communication protocol. This solution can be applicable in the case of NHS since the use of wireless sensor networks can greatly help in transferring large data files, including the imaging files to…

    • 4061 Words
    • 12 Pages
    Satisfactory Essays
  • Powerful Essays

    15. What are the four key issues in dynamic routing protocols?Path determination, Metric, Convergence, Load Balancing…

    • 1575 Words
    • 7 Pages
    Powerful Essays
  • Powerful Essays

    Bs311 Unit 3 Essay

    • 3508 Words
    • 15 Pages

    Designing secure key distribution in an ad-hoc network might be an extremely hard task. Any reliance on a certificate of authority is not trivial at all, for the same reasons that reliance in any centralized authority is problematic. Additional problems include the increased packet sizes required by authentication extensions, unicast/multicast routing, Quality of Service support and power aware routing. Furthermore, due to the limited transmission range of wireless network interfaces, multiple hops may be needed to exchange data between nodes in the network (c.f.…

    • 3508 Words
    • 15 Pages
    Powerful Essays
  • Satisfactory Essays

    Wireless Network

    • 268 Words
    • 2 Pages

    Last and forth most is determining the location of the wireless devices, as there are many different object that hinder the signal of the access point with all mode from Ad hoc to the standard infrastructure. While they all can be affected, each has special consideration to their locations.…

    • 268 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    (c) Data throughput in sensor networks is a bigger concern than that in mobile ad hoc networks.…

    • 1413 Words
    • 6 Pages
    Good Essays
  • Good Essays

    Our online world is totally incomplete without a modem or router and nowadays, technological advancements have made it possible for us to use wireless routers which in itself is a remarkable achievement of computer science.…

    • 783 Words
    • 4 Pages
    Good Essays
  • Good Essays

    It is a discreet event simulator targeted at networking research and provides substantial support for simulation of routing, multicast protocols and IP protocols, such as UDP, TCP, RTP and SRM over wired and wireless (local and satellite) networks. It has many advantages that make it a useful tool, such as support for multiple protocols and the capability of graphically detailing network traffic. Additionally, NS2 supports several algorithms in routing and queuing. LAN routing and broadcasts are part of routing algorithms. Queuing algorithms include fair queuing, deficit round-robin and…

    • 1086 Words
    • 5 Pages
    Good Essays
  • Powerful Essays

    Sinemo

    • 5367 Words
    • 22 Pages

    This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2007 proceedings.…

    • 5367 Words
    • 22 Pages
    Powerful Essays
  • Powerful Essays

    Mobility in wireless sensor networks poses unique challenges to the medium access control (MAC) protocol design. Previous MAC protocols for sensor networks assume static sensor nodes and focus on energyefficiency. In this paper, we present a mobilityadaptive, collision-free medium access control protocol (MMAC) for mobile sensor networks. MMAC caters for both weak mobility (e.g., topology changes, node joins, and node failures) and strong mobility (e.g., concurrent node joins and failures, and physical mobility of nodes). MMAC is a scheduling-based protocol and thus it guarantees collision avoidance. MMAC allows nodes the transmission rights at particular timeslots based on the traffic information and mobility pattern of the nodes. Simulation results indicate that the performance of MMAC is equivalent to that of TRAMA [1] in static sensor network environments. In sensor networks with mobile nodes or high network dynamics, MMAC outperforms existing MAC protocols, like TRAMA and S-MAC [2], in terms of energyefficiency, delay, and packet delivery. sensor nodes are static. Researchers have, however, envisioned sensor networks with mobile sensor nodes [5]. In this paper, we show that the current MAC protocols for wireless sensor networks are not suited for mobile sensor network environments, and present a mobility-adaptive, collision-free medium access control (MMAC) protocol for sensor networks. MMAC follows the design principles of TRAMA [1] a scheduling-based MAC protocol for static multi-hop wireless sensor networks. In mobile environments the fixed frame time of current MAC protocols causes performance degradation in a number of ways: a) the mobile nodes, upon joining a new neighborhood, need to wait for a long time before they can send data, b) in…

    • 4637 Words
    • 19 Pages
    Powerful Essays
  • Good Essays

    Data Link Layer

    • 479 Words
    • 2 Pages

    This is a reactive protocol, which performs Route Discovery using control messages route request (RREQ) and route reply (RREP) whenever a node wishes to send packets to destination. To control network wide broadcasts of RREQs, the source node uses an expanding ring search technique. The forward path sets up an intermediate node in its route table with a lifetime association RREP. When either destination or intermediate node using moves, a route error (RERR) is sent to the affected source node. When source node receives the (RERR), it can reinitiate route if the route is still needed. Neighborhood information is obtained from broadcast Hello…

    • 479 Words
    • 2 Pages
    Good Essays