IJIRST –International Journal for Innovative Research in Science & Technology| Volume 1 | Issue 4 | September 2014 ISSN(online) : 2349-6010
Mobility Driven Routing Protocols for Manets Jamshed Ali Khan M.Tech ECE Department UCoE, Punjabi University, Patiala Punjab, India
Er. Dipti Bansal Assistant Professor ECE Department UCoE, Punjabi University, Patiala Punjab, India
Abstract MANET stands for Mobile Ad hoc Network. Mobile Ad-Hoc Networks goes under Wireless Networks.. A mobile ad hoc network (MANET) is a dynamic topology and self-configuring infrastructure less network in which nodes are associated via a wireless link and they move autonomously in any direction. The nodes link are supposed to change frequently. One of the major challenges of MANET is maintaining link routes information of each node continuously. In this paper, we have proposed a method for route selection in MANETs based on the speed of nodes i.e. considering low speed nodes for the route. Simulation results show that our proposed method provides better performance than IAODV in case of parameters like Overhead, Packet Delivery Ratio and Throughput. Keywords: MANET, Routing Protocols, RSSI, Link Failure, AODV, IAODV AOMDV ___________________________________________________________________________________________________________
I. INTRODUCTION Wireless networks are getting admirably known in light of their accommodation. Ad-hoc networks can be classified in three categories based on applications; Mobile Ad-hoc Networks (MANETs), Wireless Mesh Networks (WMNs), Wireless Sensor Networks (WSN).The multiplication of less expensive, little and the more capable gadgets make MANET a quickest developing system. MANET stands for Mobile Ad hoc Network.Mobile Ad-Hoc Networks goes under Wireless Networks. One of the extraordinary qualities of wireless system that makes it exceptional amongst the conventional wired systems is versatility.. There is nothing to worry about the establishment of the hardware outlaysDue to its great features, MANET attracts different real world application areas where the networks topology changes very quickly. Routing protocols is one of the challenging and fascinating research zones. Numerous routing conventions have been created for MANETs i.e. AODV, OLSR, DSR etc.
Fig. 1.1 MANETs
A. Categories of Routing Protocols There are several routing protocols designed for wireless ad hoc networks which are classified either as reactive or proactive. There are some ad hoc routing protocols with a combination of both reactive and proactive characteristics, referred to as hybrid. Table driven/ Proactive Demand driven / Reactive Hybrid
All rights reserved by www.ijirst.org
36
Mobility Driven Routing Protocols for Manets (IJIRST/ Volume 1 / Issue 4 / 007)
B. Routing Protocols 1) Ad hoc On-demand Distance Vector routing (AODV) : AODV is an on-demand and distance-vector routing protocol and enables dynamic, self-starting, multi hop routing between participating mobile nodes belonging to an ad hoc network. It is considered as an improvement of DSDV as unlike DSDV, it minimizes the number of broadcasts by creating routes based on demand. The basic principle of AODV is that it establishes a route from a destination only when there is a demand. AODV serves for both unicast and multicast routing. The routes are kept active as long as they are desirable by the sources. AODV uses different types of control messages to discover and maintain links. RREQ- a node requiring a route to the node for which it does not already have a route, transmits the route request message. Each route request contains a time to live (TTL) field which states for how many hops it has to be forwarded. RREP- The route is made available by unicasting a RREP back to the origination of the RREQ. RRER- nodes keep on monitoring the link status of the next hop in the active routes. Whenever a link breakage is detected in the active route, a RERR message is broadcasted to the other nodes to notify about the loss of the link.
Fig. 1.2 Route Set Up in AODV [3]
2) IAODV (Intelligent AODV) : IAODV is a method which, works in two phases; first is signal strength based AODV if this approach is not work then it switch to second phase means work like as normal AODV, In signal strength based AODV protocol measures signal strength between nodes and compare with RSSI threshold values if it is greater than threshold value then it is accepted for further processing otherwise it is discarded if it is not find any route between source and destination then it switch to normal AODV which select route on the basis of minimum hop count . 3) Calculation of RSSI value : The RSSI value is calculated with the help of two ray ground Model
Pr: Power received at distance d Pt: Transmitted signal power Gt: Transmitter gain (1.0 for all antennas) Gr: Receiver gain (1.0 for all antennas) d: Distance from the transmitter L: Path loss (1.0 for all antennas) ht: Transmitter antenna height (1.5 m for all antennas) hr: Receiver antenna height (1.5 m for all antennas)
II. PROPOSED METHOD FOR ROUTING Since our work is more oriented towards the route formation using the concept that nodes which are moving at the low speed will lead to stable path between source and the destination. So we propose the concept of monitors which will primarily check the speed of the nodes continuously. We propose to arrange the network into grids and deploy monitors in each grid which will keep a check on All rights reserved by www.ijirst.org
37
Mobility Driven Routing Protocols for Manets (IJIRST/ Volume 1 / Issue 4 / 007)
the speed of the moving nodes. So whenever the source node has to send data to the destination, during the route formation it will coordinate with the monitor of the grid where it is located. The monitor which knows about the mobility of the nodes will inform the source about the low speed nodes in its neighborhood to whom it can route the data. In this way we propose to enhance the route formation phase in such a way that effects of the topology changes is minimized in the network.
III. SIMULATION RESULTS Here, we designed and implemented our test bed using Network Simulator (NS-2.34) to test the performance of both Routing algorithms. Table: Simulation Parameters Parameter
Value
Simulation Duration
100s
Topology Area
3000 m x 3000 m
Number of nodes
50
Mobility Speed
1 to 20 (m/s)
Mobility Model
Random way point
Transmission Range
250 m
Packet Rate
4 packet/s
Packet size
512 b
Traffic Type
CBR
Fig. 3.1 Overhead Comparison
The above figure shows the comparison of the overhead between our proposed technique and the I-AODV.
All rights reserved by www.ijirst.org
38
Mobility Driven Routing Protocols for Manets (IJIRST/ Volume 1 / Issue 4 / 007)
Fig. 3.2 Throughput Comparison
The above graph shows that our proposed scenario achieves higher value of the throughput than the I-AODV thus showing better performance
Fig. 3.3 PDR comparison
The above graph shows the comparison of another factor important to network's performance, PDR.
IV. CONCLUSION In our proposed study, we have considered a routing scheme for mobile ad-hoc networks where the route from source to destination is obtained taking nodes moving at low speed into consideration. The main objective of the work is to reduce the frequent link failures in the network occurring due to movement of the nodes. In future, we would like to utilize this concept to the vehicular adhoc networks which is another area under which research is under progress. All rights reserved by www.ijirst.org
39
Mobility Driven Routing Protocols for Manets (IJIRST/ Volume 1 / Issue 4 / 007)
REFERENCES JeroenHoebeke, Ingrid Moerman, Bart Dhoedt and Piet Demeester, “An Overview of Mobile Ad Hoc Networks: Applications and Challenges” ImrichChlamtac, Marco Conti b, Jennifer J.-N. Liu, “Mobile ad hoc networking: imperatives and challenges” Poonam Gera, KumkumGarg, and ManojMisra, “Trust-based Multi-Path Routing for Enhancing Data Security in MANETs”, International Journal of Network Security, Vol.16, No.2, PP.102-111, Mar. 2014 [4] Chee-Yee Chong Kumar, and S.P, “Sensor Networks: Evolution, opportunities, and challenges” [5] D.Maheshwari, R.Nedunchezhian, “Balanced Reliable Shortest Route for AOMDV (BRSR-AOMDV) Using TF Mechanism in MANET”, Int.J.Computer Technology &Applications,Vol 4 (6),902-909 [6] Patil V.P (2012), “Efficient AODV Routing Protocol for MANET with enhanced packet delivery ratio and minimized end to end delay”, International Journal of Scientific and Research Publications, Volume 2, Issue 8, ISSN 2250-3153 [7] R. Menaka1, Dr. V. Ranganathan, “A Survey of Trust related Routing Protocols for Mobile Ad Hoc Networks”, International Journal of Emerging Technology and Advanced Engineering (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 3, Issue 4, April 2013) [8] Claude Cr´epeau, Carlton R. Davis∗ and MuthucumaruMaheswaran, “A secure MANET routing protocol with resilience against byzantine behaviours of malicious or selfish nodes” [9] Yudhvirsingh, HarkeshSehrawat, VijetaManchanda, “Analyzing Hybrid Technique for Traffic Control in MANET”, Volume 3, Issue 7, July 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering. [10] NesaSudha, Dr. M. L. Valarmathi, T.ChristopahpaulNeyandar, “Optimizing Energy in WSN using Evolutionary Algorithm”, International Conference on VLSI, Communication & Instrumentation (ICVCI) 2011 (IJCA) [1] [2] [3]
[11] Hemant Dandotiya, Rachit Jain,Rinkoo Bhatia, “Route Selection in MANETs by Intelligent AODV”, CSNT '13 Proceedings of the 2013 International Conference on Communication Systems and Network Technologies.
All rights reserved by www.ijirst.org
40