AENSI Journals Australian Journal of Basic and Applied Sciences ISSN:1991-8178 Journal home page: www.ajbasweb.com IDSR: Improved Dynamic Source Routing Protocol for Mobile Ad Networks E.A. Mohamed Department of Computer Science, Faculty of science, Banaras Hindu University, Varanasi, 221005, India. A R T I C L E I N F O Article history: Received 25 April 2014 Received in revised form 8 May 2014 Accepted 20 May 2014 Available online 17 June 2014 Keywords: Ad-Hoc, MANET, DSR, Route discovery, Route maintenance. A B S T R A C T Background: Mobile Ad-hoc Networks (MANETs) are characterized by connectivity through a collection of wireless nodes and fast changing network topology. Wireless nodes are free to move independent of each other which makes routing much difficult. In order to facilitate communication within the network, a routing protocol is needed to discover and maintain paths between mobile nodes. Objective: this article proposes a new reactive routing protocol for MANET, named IDSR (Improved Dynamic Source Routing) protocol. IDSR based on Dynamic Source Routing (DSR) protocol. IDSR develops new manners for route discovery and route maintenance. In route discovery, each node initiates a routing table for their active neighbors, and RREQ packets will be sending only for actives neighbor nodes during route discover phase. In route maintenance phase, IDSR uses a new strategy to repair failure links. Each node on the active source route utilizes a local ACK packet to monitor the next intermediate node toward the destination. In case of failure link through the source route, each node has to select an alternative sub-route from their active neighbors table. GloMoSim simulator has been used to evaluate the proposed IDSR and the typical DSR protocol. Results: excessive experiments show that IDSR outperformance DSR in several simulation scenarios i.e. the packet delivery ratio, routing overhead, number of data received and number of dropped packets. 2014 AENSI Publisher All rights reserved. To Cite This Article: E.A. Mohamed., IDSR: Improved Dynamic Source Routing Protocol for Mobile Ad Networks. Aust. J. Basic & Appl. Sci., 8(10): 532-540, 2014 INTRODUCTION Mobile Ad Hoc network (MANET) (Conti and Giordano, 2014) is an infrastructure-less wireless mobile network. In MANET, nodes (e.g. laptop, PDA, mobile phone) are mobile, autonomous and self-organized. Each mobile nodes work as host and router, and connect with others using radio waves. However, more than one hop is required to transmit and receive messages in the network due to the limitation of transmission wireless range of nodes (Dahiya and Johari, 2014). Basically, a routing protocol is needed to determine routes between nodes, and to facilitate communication in MANET. Generally, MANETs can be widely used in several areas and applications, such as emergency, military, campus and the other situations that requires create communication in temporally place (Paul and Sarkar, 2013). Several routing protocols for MANETs have been developed. However, MANET protocols can be classified into three categories (Gupta and et al., 2013): reactive, proactive and hybrid routing protocols. Reactive routing protocols (such as AODV (Perkins and et al., 2003) and DSR (Johnson and et al., 2003)) create routes only when needed, while proactive routing protocols (such as DSDV (Perkins and Bhagwat, 1994) and CGSR (Abolhasan and Wysocki, 2004)) initiates one or more routing tables to store routing information about the network, and always update their routing information when the topology of MANET changed. On the other hand, hybrid routing protocols (such as ZRP (Haas and Pearlman, 2001)) combines reactive and proactive in its routing strategy. In this article, our goal is to develop a reactive routing protocol to improve the performance in MANET networks. The proposed reactive protocol is called IDSR protocol. IDSR is based on the standard reactive DSR protocol. However, IDSR applies its updated route discovery and route repair method to improve the performance in MANET. We utilized GloMoSim to test and evaluate our proposed IDSR protocol to typical DSR in terms of packet delivery fraction, routing overhead, and dropped packets. However, the simulation results show that the performance of IDSR protocol is superior compared with typical DSR protocol. Corresponding Author: E.A. Mohamed, Department of Computer Science, Faculty of science, Banaras Hindu University, Varanasi, 221005, India.
533 E.A. Mohamed, 2014 This paper is organized as follows: Section II presents MANET routing protocols. Section III presents related work. We investigate the proposed routing protocol (IDSR) in section IV. Section V detailed on the simulations and the experimental results. In Section VI, we present our conclusion. Manet Routing Protocols: Generally, numerous MANET routing protocols have been designed by researchers (Goswami and et al., 2014) (Mohammad and et al., 2014). However, Figure (1) presents various popular routing protocols for MANETs. MANET Protocols Proactive Protocols Hybrid Protocols Reactive Protocols DSDV CGSR ZRP ZHLS DSR AODV Fig. 1: MANET Routing Protocols. Related Work: 1. DSR Routing Protocol: The dynamic source routing protocol (DSR) is an on-demand/reactive routing protocol for MANET (Mahajan, 2014). When communicating a destination node which is not present in the route cache of the source node, it will buffer the data packets and flood a RREQ packet into the network. The other intermediate nodes transmit the RREQ packet to the intended destination node in MANET. The destination node then will send a uni-cast RREP packet on the reverse route back to the source node. If no RREP packet is received after a fixed number of attempts and within the NTT (net _traversal _time), the data packets from the buffer will be deleted at intermediate nodes, while if more data packets are waited at the source, a new route discovery process will be re-initiated. However, increasing number of RREQ packets will saturate the network which makes it unable for further transmission of data packets (Jacob and Seethalakshrni, 2011). After the source node receives the RREP packet, the source node will cache it and sends its data packets through it to the destination node (Bhatt and et al., 2014). In case of link failure, nodes send back RERR (Route Error) packet to the source node. And then a new route discovery will be initiated by the source node. 2. Enhanced Works Based on DSR: This section documents some of the many reactive routing protocols based on DSR developed by researchers in MANET area. Work by (Bhatt and et al., 2014) proposed an efficient and simple protocol (DSR1) based on DSR. It reduces the number of RREQ messages flooded in order to improve the performance of DSR protocol for MANET. Basically, this protocol considers the alteration in route discovery system at intermediate nodes. The alteration route discovery process includes the checking of network parameters such as node mobility, residual battery and received signal strength of node itself by a defined condition. In this discovery process those nodes are discarded which do not possess the defined conditions. Hence those nodes will not further forward RREQ (Route Request) packets. Hence congestion in network will reduce by reducing RREQ packets. Work by (Shilpa and et al., 2013) proposed a protocol called TDSR (Sequence-Number Aided Timer Based DSR Protocol). This work has tried to include more clarity to route discovery process of DSR protocol, by including T (Timer) parameter in RREQ packet. In TDSR, once a source initiates a RREQ packet for a particular destination node and if, it does not receive RREP (Route Reply) packet within the time duration mentioned in T field of the packet, it will again regenerate new RREQ packet for the same destination with increased Request Number and increased Timer in order to speed up the Route Discovery Process. Work by (Kaosar and et al., 2006) has presented a new scheme of improving the performance of DSR protocol. It has associated expiration time with every established route. Subsequent to, the expiration time the route is removed from the route cache of the nodes in the network. Work in (Huang and Chan, 2007) has presented two methods to enhance route cache correctness, route stability and reduce the number of RERR packets to provide efficient routes for transmitting data packets to
534 E.A. Mohamed, 2014 their destination node. The first method is the RERR-Enhance method in which a failure link packet is sent to all the nodes that had cached the failure link in the network. The second method is the hierarchical link cache structure accompanied with a link stability measurement to improve the cache maintenance and stability of routes. MATERIALS AND METHODS 1. The Proposed Protocol: This paper introduced an Improved Dynamic Source Routing (IDSR) protocol for MANET. However, we present two updates on typical DSR to develop the proposed IDSR protocol as the following: IDSR Route Discovery Algorithm: In common, typical DSR protocol propagates RREQ packets in the network for a single RREP. This cause unnecessary routing overhead, in addition to the congestion and the collisions that may occur in the network. For limit this problem, IDSR utilizes a new mechanism for Route discovery in MANET. Basically, each node initiates a routing table for their active neighbors, and RREQ packets will be sending only to active neighbor nodes in route discover mechanism. Practically, the active neighbored node is that node which sends and receives control packets (i.e. RREQ, RREP and RERR) with current node in a specific time (T), and not a terminal node (i.e. node sends zero RREP because it has one or zero neighbors). However, the process of IDSR route discovery as next: When the source (S) want to send data packets to the destination (D), and S has not a route to D: - S floods a RREQ packets for D in the network: If (the received node) has a route to the Destination node: - Send a RREP packet to The Source Node. - Stop Propagate RREQ packets. Else - Send RREQ packets to Active Neighbored Nodes. - Wait a RREP packet. - Refuse another RREQ packet for same Destination. IDSR Route Maintenance Algorithm: Generally, typical DSR call its route maintenance mechanism only when one of the middle nodes of the source route cannot send packets to the next node forward the destination. Basically, IDSR improved the route maintenance mechanism for reduce the drop data packets in the network, where it uses a new approach to repair failure links in the source route. Practically, each middle node on the active source route utilizes a local ACK packet to monitor the next intermediate node toward the destination. In case of failure link through the source route, each node has to select an alternative sub-route from their active neighbors table to maintain the broken route. However, the process of IDSR route maintenance as next: For each middle node in the source route: - The node waits for a periodic ACK packet from next middle node toward the destination. - If there is no ACK: + Delete all failure routes. + Select alternative sub-route from neighbors table to repair the source route. - If there is ACK: + The status of the route is available. + Wait for next periodic ACK. 2. Simulations: In this paper, we use GloMoSim (Global Mobile Information System Simulator) to simulate our proposed model and evaluate the performance of IDSR with typical DSR. GloMoSim uses a parallel discrete-event simulation capability provided by Parsec (Bilalb and Othmana, 2013). It was designed specifically for scalable simulation in a wireless network environment. Also it can simulate hundreds of nodes. GloMoSim can offers several applications (CBR, ftp, telnet), transport protocols (TCP, UDP), routing protocols (e. g. DSR, AODV and ZRP) and mobility models (i.e. RWP, random drunken, Manhattan mobility). In addition GloMoSim is open source network simulation tool. Simulation Parameters: In this paper, the simulations are being implemented in Global Mobile Simulator (GloMoSim) (Bilalb and Othmana, 2013; Qabajeh and et al., 2013), a simulator for MANETs. The simulations are carried out with 30, 40, 50, 60 and 70 nodes moving with speeds 10 m/sec in the region 600 m X 2200 m with pause time (0, 150,
535 E.A. Mohamed, 2014 300, 350, 600, 750 and 900 sec) between the movements of nodes. The mobility model was RWP (Random Way Point) model. In addition, the transmission range of each node is 250m, while the bandwidth is 2 Mbps, and the size of each data packet is 512 byte. The data traffic rate (or CBR) is 4 packets per sec. Based on these simulation parameters; firstly the protocols are tested under these scenarios by varying the number of source nodes. The second scenarios are built by varying of pause times, and the third scenarios are done by varying of number of nodes in the network. Performance Metrics: This paper evaluates the performance of IDSR protocol with typical DSR in several significant performance metrics as follows (Menon and et al., 2013; Basavaraju, 2013): 1) Packet Delivery Fraction: It is the ratio of the number of data packets is received by destination node to the data packets is sent by source node. 2) Routing Overhead: the ratio of the total of control packets (include RREQ, RREP and RERR) to the total of data packets delivered to the destinations. 3) Dropped packets: The data packets that are dropped due to link failures and collisions. 4) Number of Data Received: The total data packets that are sent by source node and received by destination node. Simulation Results: Based on the previous simulation parameters; this section shows the simulation result of the Improved DSR (IDSR) and typical DSR. Both protocols are tested under several scenarios by varying of: (i) Number of nodes in the network as shows in figures (2, 5 and 8). (ii) Number of source nodes in the network as shows in figures (2, 6 and 9), (iii) Pause time of nodes in the network as shows in figures (4, 7 and 10). However, the simulation results of IDSR and typical DSR that obtained after simulations are compared and discussed in brief as follows. 1- Packet Delivery Fraction: Figures (2, 3, and 4) explain the packet delivery fraction of the IDSR protocol compared with typical DSR in different scenarios. The packet delivery fraction is higher for IDSR as it is compared with typical DSR protocol. This is the outcome of the discovered route by the new route discovery mechanism of the proposed IDSR protocol. 2- The Routing Overhead: From Figures (5, 6, and 7), it is noticed that the routing overhead rate of IDSR is lower than typical DSR protocol. This is the outcome of reducing the number of RREQ packets with the proposed IDSR protocol especially in case of high mobility. However, IDSR decreases the number of RREQ packets in network which reduce the overall routing overhead in the network compared to DSR. Fig. 2: Packet Deliver Fraction against Number of Sources. 3- The Dropped Packet Fraction: As shown in Figures (8, 9, and 10), the average of drop packets of IDSR is decreased compared with typical DSR protocol. That is because IDSR utilized ACK packets to insure the availability of the source route in transmission data process. In addition, IDSR uses an alternative route from the neighbors table to transfer data
536 E.A. Mohamed, 2014 packets when an original source route is failure, which rescues the data packets, and saves the time of the new route discovery mechanism for reestablishment the source route. Fig. 3: Packet Deliver Fraction against Pause Time of Nodes. Fig. 4: Packet Deliver Fraction against Number of Nodes. Fig. 5: Overhead against Number of Sources.
537 E.A. Mohamed, 2014 Fig. 6: Overhead against Pause Time of Nodes. Fig. 7: Overhead against Number of Nodes. Fig. 8: Drop Packets Fraction against No. of Sources. 4- Number of Data Received: Figures (11, 12, and 13) explain the number of data packet received by the IDSR protocol and typical DSR in different scenarios. The number of data packet received is higher for IDSR as it is compared with typical
538 E.A. Mohamed, 2014 DSR protocol. This is the outcome of the discovered route by the new route discovery mechanism of the proposed IDSR protocol. Fig. 9: Drop Packets Fraction against Pause Time of Nodes. Fig. 10: Drop Packets Fraction against Number of Nodes. Fig. 11: Number of Data Received against Number of Sources.
539 E.A. Mohamed, 2014 Fig. 12: Number of Data Received against Pause Time of Nodes. Fig. 13: Number of Data Received against Number of Nodes. Conclusion: This paper proposed IDSR protocol in MANETs. To improve the performance of typical DSR protocol, the improved IDSR protocol has been established which using a new route discovery mechanism based on the active neighbors table to reduce the flooding of RREQ packets in the network, as well to initiate an available route to the destination. Also IDSR utilizes a new way to maintain the active source route based on periodic acknowledgments between the intermediate nodes through the source route. The intention of the mechanism is to rescue data packets, in addition to reduce the waiting time of data transmission processes. In doing so, the routing overhead and drop packets of IDSR will be decreased, while the data delivery fraction will be improved. As result, the simulation results demonstrate that the improved IDSR protocol has better performance than typical DSR protocol in different simulation scenarios of MANET. REFERENCES Abolhasan, M., T. Wysocki and E. Dutkiewicz, 2004. A review of routing protocols for mobile ad hoc networks. Ad hoc networks, 2(1): 1-22. Basavaraju, T.G., 2013. Feasibility Study and Performance Evaluation of Popular Routing Protocols AODV and DSR in Wireless Mesh Networks.International Journal of Computer Science & Network Security, 13(2). Bhatt, U.R., N. Nema and R. Upadhyay, 2014. Enhanced DSR: An efficient routing protocol for MANET. In Issues and Challenges in Intelligent Computing Techniques (ICICT), 2014 International Conference on, IEEE, pp: 215-219.
540 E.A. Mohamed, 2014 Bilalb, S.M. and M. Othmana, 2013. A Performance Comparison of Network Simulators for Wireless Networks. arxiv preprint arxiv:1307.4129. Conti, M. and S. Giordano, 2014. Mobile ad hoc networking: milestones, challenges, and new research directions. Communications Magazine, IEEE, 52(1): 85-96. Dahiya, P. and R. Johari, 2014. VAST: Volume adaptive searching technique for optimized routing in mobile ad-hoc networks. In Advance Computing Conference (IACC), 2014 IEEE International, pp: 1-6. Goswami, S., S. Joardar and C.B. Das, 2014. Reactive and Proactive Routing Protocols Performance Metric Comparison in Mobile Ad Hoc Networks NS2. International Journal of Advanced Research in Computer and Communication Engineering, 3(1): 4908-4915. Gupta, S.B., T. Navneeth, S. Sundar and C.M. Vidhyapathi, 2013. Performance Evaluation of MANET Routing Protocols under Varying Node Mobility. International Journal of Engineering & Technology, 5(3): 2234-2248. Haas, Z.J. and M.R. Pearlman, 2001. The performance of query control schemes for the zone routing protocol. IEEE/ACM Transactions on Networking (TON), 9(4): 427-438. Huang, T.C. and C.C. Chan, 2007. Caching Strategies for Dynamic Source Routing in Mobile Ad Hoc Networks, IEEE, pp: 4239-4243. Jacob, J., V. Seethalakshrni, 2011. Performance Evaluation of Various Routing Protocols in MANET. An International Journal of Engineering Sciences, 5(6): 208-220. Johnson, D.B., D.A. Maltz and Y.C. Hu, 2003. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR). IETF Draft. Kaosar, M.G., A.S.H. Mahmoud and T.R. Sheltami, 2006. Performance Improvement of Dynamic Source Routing Protocol Considering the Mobility Effect of Nodes in Cache Management. In IEEE International Conference on Wireless and Optical Communications Networks, pp: 1-5. Mahajan, S., 2014. Performance Comparison of Dynamic Source Routing Under Varying Traffic Patterns. Networking and Communication Engineering, 6(2). Menon, V.G., V. Johny, T. Tony and E. Alias, 2013. Performance Analysis of Traditional Topology based Routing Protocols in Mobile Ad hoc Networks. International Journal of Computer Science, 2(01). Mohammad, S., M. Alsanabani, T. Alahdal, 2014. Comparison Study of Routing Protocols in MANET. International Journal of Ad Hoc, Vehicular and Sensor Networks, 1(1): 1-9. Paul, H., P. Sarkar, 2013. A study and comparison of OLSR, AODV and ZRP routing protocols in ad hoc networks. International Journal of Research in Engineering and Technology, 2(8). Perkins, C.E. and P. Bhagwat, 1994. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers, ACM Computer Communication Review, vol. 24, London, UK, pp: 234-244. Perkins, C., E. Royer, S. Das, 2003. Ad hoc On-Demand Distance Vector (AODV) Routing. Internet Draft, RFC 3561, IETF Network Working Group. Qabajeh, M.M., A.H.A. Hashim, O.O. Khalifa, L.K. Qabajeh, J.I. Daoud, 2012. Performance Evaluation in MANETs Environment. Australian Journal of Basic & Applied Sciences, 6(1). Shilpa, S., S. Shelja and K. Suresh, 2013. Sequence-Number aided timer based DSR protocol in MANET: TDSR, 2013 4th International Conference on Computer and Communication Technology (ICCCT), pp: 150-156, IEEE.