2013 International Conference on Computer Communication and Informatics (ICCCI -2013), Jan.
04 06, 2013, Coimbatore, INDIA
Optimal Energy Reverse Reactive Routing Protocol (OERRRP): A New Reverse Reactive routing Protocol for the Route Discovery in Ad Hoc Networks
Bhabani Sankar Gouda 1
Department of Computer Science and Engineering National Institute of Science & Technology Brahmapur, India bhabani012@rediffmail.com Chandan Kumar Behera 2
Department of Computer Science and Engineering National Institute of Science & Technology Brahmapur, India ckb.iitkgp@gmail.com Sunil Kumar Nahak 3
Department of Computer Science and Engineering Roland Institute of Technology Brahmapur, India nahaksunil@gmail.com
AbstractAn ad-hoc network is a self-sufficient collection of mobile nodes that occur to exist within a close nearness in an interval of time. In this paper, a new optimal energy conserving reverse reactive routing protocol has been proposed that computes the shortest path in between any source-destination pair on demand. The approach, unlike other energy conserving reactive protocols, finds loop-free, increases in power consumption and optimal path between the end nodes. The optimal energy reverse reactive routing protocol (OERRRP) uses the Dijkstras optimal path routing algorithm. It works on their demand on the whole bandwidth available is significantly less and better energy conservation for the proposed protocol. It has been recognized that OERRRP combines the improvement procedure of the routing protocols while reducing the limitations of the changed approaches which seeks to incorporate the metric residual energy in the process route selection, indeed the residual energy of mobile nodes were considered when making routing decisions. Keywords-Ad hoc mobile networks, Energy AODV, Reactive Routing Protocol, Energy consumption, ER-AODV, Reverse AODV. I. INTRODUCTION (HEADING 1) Mobile Ad-hoc network is a set of wireless mobile nodes dynamically forming a short-term network. The goal of this structural design is to provide communication facilities between end-users without any centralized infrastructure. Energy management in Ad-hoc networks is of paramount significance due to the limited energy availability in the wireless devices. Since wireless communication consumes a significant amount of energy, it is most important to minimize the energy costs for communication. To this ending, there has been a good deal of research works in designing energy efficient protocols. In progress writing about energy efficient or power aware routing protocols can generally be divided into three categories: i) switching on/off radio transmitters to conserve energy [1] [2], (ii) power and topology control by adjusting the transmission range (power) of transmitters [3] [4], and (iii) routings based on the energy efficient metrics [5]. In this paper, we consider the cost of data packets sent in the network, and the cost of control packets used to maintain the network. To do this, we define OERRRP (Optimal Energy Reverse Reactive Routing Protocol). OERRRP is a reactive routing protocol based on a policy which combines two mechanisms used in the basic AODV (Ad hoc On-Demand Distance Vector) protocol [6]. We prefer to select AODV as one of the on demand MANET routing protocols for the reason that; it consumes less energy power than other similar routing protocols such as DSDV and TORA as shown in [7].
In other words, all reactive routing protocol doesnt depend on periodic exchange of routing information or route computations. When a route is required or demand on the network, the node must begin a route discovery process. That means it must broadcast the route request throughout the network and still wait for a respond before it can proceed to send packets to the destination. The route is maintained until the destination is hard to find or until the route is no longer required. Reactive routing protocols use single route reply along reverse path and rapid change of topology causes that the route reply messages (RREP) could not reach to the source node, i.e. after a source node sends several route request (RREQ) messages, the node obtains a route reply (RREP), and this increases in power consumption. To keep away from these difficulties, this tries to multiple route replies. In this method we obtain a routing path with less number of RREQ messages. The remainder of this paper is organized as follows. In Section 2, we give the most important characteristics of AODV routing protocol and reported a brief review of different types 978-1-4673-2907-1/13/$31.00 2013 IEEE 2013 International Conference on Computer Communication and Informatics (ICCCI -2013), Jan. 04 06, 2013, Coimbatore, INDIA
of existing routing protocols. In Section 3, we describe our two mechanisms in detail. Simulation methodology and performance evaluation of our proposal OERRRP are detailed in Section 4, the OERRRP protocol is evaluated against with multiple performance metrics. In s Section 5, concludes the paper by summarizing results. II. REVIEW OF EXISTING ROUTING PROTOCOLS In general, a routing algorithm for mobile ad hoc networks classified into two categories: reactive and proactive routing algorithms [8]. The proactive routing algorithms mostly use either link-state or distance vector algorithms. In both the approaches, a source node stores some information regarding the network topology and recomputed the shortest path(s) to reach the final destinations within network. The On Demand Distance Vector (AODV) is a reactive routing protocol [6]. It is identity-starting, enables multi-hop routing path between participating mobile nodes wishing to establish and maintain an ad hoc network. This protocol builds routes between nodes only as preferred by source nodes. It discovers routes rapidly for new destinations, and doesnt require nodes to maintain routes to non-active destinations. Reactive Routing Protocol (AODV) ensures communication link breakages and breakdowns are handled efficiently. The AODV protocol establishes routes using a Route Request (RREQ) / Route Reply (RREP) query sequence. So, when a node requires path to destination, it broadcasts RREQ message to its neighbors which includes newest known sequence number for that destination. Each node has receiving the message creates a reverse route to the source node and destination sends back RREP message which includes number of hops traversed. Each node has most recent sequence number for the destination of which the source node is aware. Note that if an intermediate node has a new route to the destination it does not forward the RREQ and it generates a RREP toward the source. Each node has receiving the RREP message creates a forward route to the destination. Therefore, each node remembers only the next hop required to reach any destinations, not the whole route. Each node has receives a duplicate of the same RREQ, it drops the packet. Furthermore, On Demand Reactive Routing (AODV) uses sequence numbers to make sure the freshness of routes. In detail, the routes to any destination are updated only if the new path toward that destination has greater sequence number than the old one or it has the same sequence number but with less number of hosts. As a result, AODV protocol builds routes between nodes regarding the shortest path parameter. The Energy Reverse on Demand Protocol (AODV) is a reactive routing protocol which aims to capitalize on the lifetime of the network and improve the performance obtained by the basic AODV routing protocol. As a result, the purpose is to reduce the cost of control packets used to maintain the network by incorporating the mechanism called "Reverse AODV", and routing around nodes that we expect that they have more residual energy than other by integrating mechanism "Energy AODV" into our protocol [19]. Reverse AODV is to establish a routing path with less RREQ messages, which tries to answer using a multiple route replies to gain energy consumption during the send out of control packets and to avoid RREP loss, also improve the performance of routing in MANET [19]. Reverse AODV uses completely same procedure of RREQ of AODV to deliver route reply message to source node. In this mechanism can reply from destination to source if there is at least one path to source node is available. When a source node receives the route reply packet, the data packets routing can start immediately. In link-state protocol, each node maintains its possess idea of the network topology and broadcasts link failure in order or any change in the link overheads to the particular neighbors using flooding method, etc. A node updates regularly its vision of the network topology as and when it receives any kind of the changing information within network. In distance-vector routing protocol, Destination Sequenced Distance Vector (DSDV) routing protocol is one of the opportunity a small number of distance-vector protocols proposed for ad hoc networks [9]. DSDV uses the distributed Bellman-Ford algorithm. Destination sequenced distance vector (DSDV) protocol is a proactive protocol which is based on the Distributed Bellman Ford Algorithm. The improvements made to the Bellman Ford algorithm include the self-sufficiency from loops in routing tables. In this protocol each node have maintain direction-finding table which contains next hop, number of hops to reach the destination, sequence number. Each and every node appends its. DSDV protocol has given large overhead due to routing information of the tables.. Optimized link state routing (OLSR) is fully based on the link state algorithm. OLSR protocol performs hop by hop routing process and each node uses its most recent information to route a packet [11].In this process, MPR (Multipoint Relay nodes) are chosen based on the greedy algorithm. The source node select nodes as MPR which are at one hop away from it and are able to cover the whole network.MPR are used to distribute control message in the network which helps to decrease overhead. Basic design behind the MPR in the network is to decrease flooding in the network. The source node can communicate with its two-hop neighbours through these MPR. The source node pass the control message to its MPR and the nodes which are not belongs to MPR but they are only one-hop neighbors just process the messages without forwarding them. Temporally ordered routing algorithm (TORA), Light weight Mobile routing (LMR) [13] is also reactive routing protocol which is based on the link reversal algorithm. It also consists of two phases like DSR route establishment and route conservation. In the process of route establishment route is discovered by the use of query packets in the network, the route preservation is done by sending failure query messages 2013 International Conference on Computer Communication and Informatics (ICCCI -2013), Jan. 04 06, 2013, Coimbatore, INDIA
to detect route failures in the network. It is based on route discovery on demand bases so these comprise less overhead of control messages hence saving bandwidth but the cost paid for this is increased network latency due to route discovery process. In Dynamic Source Routing (DSR), the protocol is based on the link state algorithm in which source initiates route discovery on their demand of basis. The correspondent sender find outs the route from source to destination and it includes the address of intermediate nodes to the route authentication in the packet during transmission. DSR was designed for special purposes such as multi hop networks for little Diameters. It is a beaconless protocol in which no HELLO messages are exchanged between source and destination nodes to notify them of their neighbours in the ad hoc network [12]. In Optimal Reactive Routing Protocol is also reactive routing protocol. In this protocol, starts with the prior knowledge regarding the cost vector to the neighbors of the start node S and for every intermediate node, without exchanging any control message the ORRP can find the next node on the shortest path and increasing the route finding process with reduces latency. An optimal Reactive Routing Protocol exchange only (n-1) manage messages, on their demand and in spite of being reactive in approach, distinguishes the shortest path. By using sub-optimal paths for delivering data packets increase data communication latency. The routing overhead for ORRP is lower than the other protocols in a reasonably high mobility pattern. This restricts consumption of bandwidth by periodic control packets. On the other hand, even if ORRP is a reactive protocol, the information that the nodes store about the neighbors save considerable time for finding path and demand on the overall bandwidth available is substantially less comparing other reactive protocols like AODV or DSR [18]. Energy Efficient broadcast OLSR [21]: EBOLSR adapts the OLSR protocol in order to maximize the network lifetime for transmit communications. In this process energy efficient MPR [20] selection is done by the residual energy of nodes. By using EBOLSR the weighted residual energy of energy efficient MPR is candidate and its one hop neighbors. The necessary occurrence about this reactive protocol was to choose the energy efficient multipoint relays [MPRs]. Energy-Efficient Location Aided Routing (EELAR) [22]: EELAR is a reactive routing protocol and it is basis of the Location Aided Routing (LAR). It makes significant reduction in the energy consumption of the mobile node batteries by preventive the area of discovering a new route to a smaller region. Therefore, control packet overhead is significantly reduced. In EELAR, a location of wireless base station is used and the networks circular area centered at the base station is divided into six one and the same sub-areas. In this process during route discovery, instead of flooding control packets to the whole network area, they are flooded to only the sub-area of the destination mobile node. The base station supplies locations of the mobile nodes in a position table based on the mobilization. Optimal energy reverses reactive routing protocol (OERRRP) In this paper, we propose a new energy conserving reverse reactive routing protocol for ad hoc networks named Optimal Energy Reverse Reactive Routing Protocol (OERRRP).This, like a few other on demand reactive routing protocol, is essentially sender initiated while each node stores exceptionally small information about the topology. The proposed protocol, in spite of being reactive, it returns shortest path in reasonably small time. It assumes that at any given occasion, any node in the network maintains a list of its neighbors and it stores the information of cost vectors to reach the neighboring nodes from the node within source to destination. During the communication if any kind of change in the topology including deletion of a host or a link must be communicated to the neighboring nodes. We thinks that the fail-safe mode of fault occurrences. Contrasting the proactive table-driven algorithms, the proposed OERRRP does not compute the shortest paths from this information for all possible source and destination pairs between the networks. This save significant suggestion resources and controls the undesired spending of bandwidth. The proposed approach encourage to eliminates another major drawback of proactive algorithms in the sense that as the paths are not calculated in advance, so the cost of maintaining the same bears no end result. The connection setup has been delay for this new reactive algorithm, it is again distinctly less in comparison to DSR, AODV and other on-demand algorithms because the proposed OERRRP utilizes the very small information that it store on the network topology in an efficient manner. The performance comparison for the protocol establishes its pre-distinction. The proposed approach, like AOD and ORRP, assumes symmetric links between neighboring nodes
A. Optimal Route Find Algorithm: (Mi,Mj) S = Set of nodes traversed at any stage. D = D is the set of nodes adjacent to S.
P M =Minimum Cost vector.
P F =Adjacent Cost Vector.
i C =Cost Vector (Varies as per the nodes discover). Mi =Maintaining a list of neighbor.
i F =set of nodes adjacent to node Mi. Find node Mp such that cost vector (Mi, Mp) is minimum Mp D ; ( ) ( ) D D Fp Fp S Mp = . where i S S M = and i D D M = . ( ) while Mp Mj Find shortest path from Mi to Mj along the Dijkstras spanning tree rooted at Mi. 2013 International Conference on Computer Communication and Informatics (ICCCI -2013), Jan. 04 06, 2013, Coimbatore, INDIA
The procedure Find Route (Mi, Mj) finds the shortest path from source Mi to destination node Mj. The shortest route is derived by above expression which assumes that the edges are non-negative. Therefore same procedure can be adopted for calculation of OERRRP. (Assuming ). III. PERFORMANCE EVALUATIONS A. Simulation Environment To evaluate and compare the efficiency of these routing protocols in a Mobile Ad-Hoc network, we performed extensive simulations in NS-2.34. Each Experimental simulation results are carried out under a constant mobility. The simulation parameters are listed in Table 1. TABLE I. SIMULATION PARAMETERS Experiment Parameter Experiment Value Description Simulation Time 499S Simulation Duration Terrain Dimension [1500*1500]m X,Y Dimension of Motion No. of mobile nodes 5,10,15,20,25 No. of nodes in a network Node placement Random Waypoint Change Direction randomly Mobility Speed 0-10 mps Mobility of nodes No. of Connection 4 Connections Mobility model Random Mobility direction Routing Protocols ORRRP,AODV,DSR Path-finding MAC Protocol Wireless Protocol
B. Simulation Results and Analysis No of nodes Vs Throughput The total number of nodes was a variety of each time and the throughput was intended at destination during entire simulation period whose amount was as in fig. 1.
Figure. 1: No of nodes Vs Throughput OERRRP shows higher throughput compare to DSR, ORRP and AODV. The OERRRP has much more routing packets than DSR because the OERRRP avoids loop and freshness of routes while DSR uses stale routes. Its throughput is higher than other two routing protocols at high mobility. No. of nodes Vs Packet Drop A packet is dropped in two cases: when the buffer is full when the packet needs to be buffered and the time that the packet has been buffered exceeds the limit. Packet dropping was observed for several nodes and varied the nodes each time and the dropped was counted at destination node during entire simulation period.
Figure 2: No. of nodes Vs Packet Drop Efficient protocols can wisely find out routing direction thus packets dropping rate reduces for them. The packet dropped for DSR is less than that of AODV and OERRRP as it outperforms with fewer nodes and no periodic update is maintained in DSR. Packet Received Vs Propagation Delay Packet receiving value were performed for several promulgation delays in case of all MANET protocols, whose nature of packet deviation becomes as in fig 3. DSR protocol performs better when the promulgation delay of nodes increases because number of nodes become more stationary will lead to additional stable path from source to destination. DSR is superior to AODV as well as OERRRP especially when the nodes propagation delay begins to rise. For OERRRP, it shows significant dependence on route stability, thus its packet received rate is lower. Although, the amount of packet received is inversely proportional to propagation delay, DSR has the best performance than AODV and OERRRP.
Figure 3: Packet Received Vs Propagation Delay 2013 International Conference on Computer Communication and Informatics (ICCCI -2013), Jan. 04 06, 2013, Coimbatore, INDIA
Throughput vs. Simulation Time Throughput was expanded at destination node against various dimension of wireless networks and varied the simulation point in time uniformly for each protocol whose measure was as in fig 4.Throughput is the average rate of successful transmission message delivery over a communication channel. This data may be sended over a physical or logical link, or pass through a confident network node. The throughput is frequently measured in bits per second (byte/sec), and from time to time in data packets per second or data packets per time slot. This is the measure of how rapidly an end user is able to receive data. It is determined as the ratio of the total data received to required promulgation time. A higher throughput will directly impact the users observation of the quality of service.
Figure 4: Throughput vs Simulation Time Based on the fig 4, it is shown that AODV perform better when the time increases because nodes become more stationary will lead to more stable path from source to destination. AODV has higher throughput than OERRRP and DSR because of avoiding the formation of loops and it uses stale routes in case of broken links. The rate of packet received for OERRRP is better than the AODV because this periodic broadcast also add a large overhead into the network. For OERRRP, the routing overhead is not likely affected as generated in AODV. For OERRRP, it shows significant dependence on route stability, thus its throughput is lower when the time decreased. Packet Delivery Fraction Packet Delivery Fraction (PDF) is the ratio of number of data packets successfully delivered to the destination. The figure 5 shows the better performance of OERRRP as compare to DSR, AODV and ORRP. OERRRP provides considerable improvement of PDF. This indicates that OERRRP is more resistive in stressful situation than DSR, AODV and ORRP because it uses transmit power control. The transmit power control reduces the collision rate of the packets. Even the stress (number of connections and traffics) is high; every data packet must be transmitted with appropriate power level.
Figure 5: Packet Delivery Fraction Vs Number of Nodes Average Energy consumption In the process of Average energy consumption is the ratio of total energy consumed by all the nodes in the network by the number of nodes. The figure 6 shows the graph of average energy consumption vs. number of nodes and the nodes in OERRRP will consume less energy as compare to the nodes in DSR, AODV and ORRP. It shows the average energy consumption of OERRRP, DSR, AODV, and ORRP on different number of nodes. We measure up to the values of average energy consumption on different number of nodes.
Figure 6: Average Energy Consumption Vs Number of Nodes End to End Delay The estimated average time from the founding of a packet transmission at a source node until packet release to a destination. It includes delays caused by shielding of data packets during route discovery, queuing at the interface queue, retransmission setbacks at the MAC, propagation and transfer time.
Figure 7: End to End delay Vs Number of Nodes
2013 International Conference on Computer Communication and Informatics (ICCCI -2013), Jan. 04 06, 2013, Coimbatore, INDIA
The figure 7 shows the graph of end to end delay between DSR, AODV, ORRP and OERRRP. Here the Delay of DSR, AODV, and ORRP is slightly less than the proposed OERRRP CONCLUSIONS We have compared the performance of OERRRP with different reactive protocols. It is found that the optimal routing for OERRRP is lower than the other protocols in a logically high mobility pattern. On the other hand , even if energy efficiency is not the design goal of these routing protocols, each routing protocol reacted in a different way with energy aware metrics. This is due to the route discovery and maintenance mechanisms of the routing protocols. The sources of power consumption are communication and computation, communication often being the chief power consumer. In contrast to simply establishing correct and efficient routes between pair of nodes, one important goal of a routing protocol is to keep the network functioning as long as possible. This goal can be accomplished by minimizing mobile nodes energy during active communication. Transmission power control and load distribution are two approaches to minimize the active communication energy. DSR, AODV, ORRP algorithm and proposed a method OERRRP to save energy which leads to increase in network lifetime. Even if OERRRP is a reactive protocol, the information that the nodes store about the neighbors save considerable time for finding optimal path comparing with other reactive protocols like AODV ,ORRP or DSR. Again, in spite of being a reactive algorithm, ORRRP returns the shortest route. We analyzed the proposed OERRRP and simulation results show that the performance of OERRRP is better than DSR, AODV and ORRP according to packet delivery ratio, average energy consumption, throughput and end to end delay. We concluded OERRRP works better than DSR, AODV, and ORRP in giving more lifetimes to the network by consuming less amount of energy as compare to DSR, AODV and ORRP. REFERENCES [1] L. M. Feeney and M. Nilsson. Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In IEEE INFOCOM, 2001. [2] Y. Xu, J. Heidemann and D. Estrin, Adaptive energyconserving routing for multihop ad hoc networks, Technical Report TR-2000-527,2000. [3] Ramanathan and Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, IEEE Infocom 2000, 2000. [4] B. Chen, K. Jamieson, H. Balakrishnan, et R. Morris, "Span: An Energy- Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks," ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2001), Rome, Italy, juillet 16- 21, 2001. [5] L. M. Feeney. An energy consumption model for performance analysis of routing protocols for mobile ad hoc networks. Mobile Networks and Applications, 6(3):239249, Juin 2001. [6] C. Perkins, Ad hoc on demand distance vector (AODV) routing, Internet-Draft, draft-ietf-manet-aodv-04.txt, pages 3-12, October 1999, Work in progress. [7] Ya Xu, John Heidemann, and Deborah Estrin, Adaptive Energy- Conserving Routing for Multihop Ad Hoc Networks, Research Report527, USC/Information Sciences Institute, October, 2000. [8] C. Deverapalli, L. Joiner, S. -M. Yoo and H. Choo; "Performance Comparison of Various Routing Protocols in Mobile Ad Hoc Networks"; Proc. of The 2002 International Conference on Wireless Networks; Las Vegas, Nevada, USA. [9] C. E. Parkins, P. Bhagwat; "Highly Dynamic Destination Sequence Distance Vector Routing (DSDV) for Mobile Computers",Proceedings ofACM SIGCOMM 1994, pp. 234-244, Aug. 1994. [10] C. Cheng, R. Reley, S. P. R. Kumar, J. J. Garcia-Luna-Aceves; "A loop- free extended Bellman-Ford routing protocol without bouncing effect"; ACM Computer Communications Review, Vol.19(4), 1989, pp. 224- 236. [11] P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum, L. Viennot, Optimized link state routing protocol for ad hoc networks, IEEE INMIC, Pakistan, 2001. [12] M.S. Corson, A. Ephremides, A distributed routing algorithm for mobile wireless networks, ACM/Baltzer Wireless Networks 1 (1) (1995) 6181. [13] E.M. Royer, C.-K. Toh, A review of current routing protocols for ad hoc mobile wireless networks, IEEE Personal communications 6 (2) (1999) 4655. [14] S. Das, C. Perkins, E. Royer, Ad hoc on demand distance vector (AODV) routing, Internet Draft, draft-ietf-manetaodv-11.txt, work in progress, 2002. [15] C. E. Perkins, "Ad-hoc on-demand distance vector routing," in MILCOM '97 panel on Ad Hoc Networks, Nov. 1997. [16] M. S. Corson and A. Epheremides; "A distributed Routing Algorithm for Mobile Wireless Networks"; ACM Journal on Wireless Networks Vol 1(1), January 1995. [17] D. Park and M. S. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," IEEE Infocom, 1997. [18] Chaki, R.ORRP: Optimal Reactive Routing Protocol for Mobile Ad- Hoc Networks, Computer Information Systems and Industrial Management Applications, 2007. CISIM '07. 6 th International Conferences on June 2007. [19] Said Khelifa, Zoulikha Mekkakia Maaza, An Energy Reverse AODV Routing Protocol in Ad Hoc Mobile Networks, World Academy of Science, Engineering and Technology 44 2010. [20] Tai Hieng Tie, Chong Eng Tan and Sei Ping Lau, Alternate Link Maximum Energy Level Ad hoc Distance Vector Scheme for Energy Efficient Ad-hoc Networks Routing, International Conference on Computer and Communication Engineering, 11-13, Kuala Lumpur, Malaysia, May 2010. [21] Floriano, De Rango, Marco Fotino and Salvatore Marano, EE-OLSR: Energy Efficient OLSR Routing Protocol For Mobile Ad-hoc Networks, Military Communications, San Diego, CA, USA, Issue 17- 19, Nov. 2008. [22] M. Mohammed, Energy Efficient Location Aided Routing Protocol for Wireless MANETs, International Journal of Computer Science and Information Security, Vol. 4, Issue 1 & 2, 2009.