Received on Accepted on Abstract:

Transcription

1 ISSN: X CODEN: IJPTFI Available Online through Research Article IMPLEMENTING A MODIFIED POWER AWARE ROUTING PROTOCOL USING AODV PROTOCOL IN MANET Siddharth Samal* 1, Dr. Pradeep Reddy C.H. 2, S.Bharath Bhushan 3 1,2,3 School of Information Technology & Engineering, VIT University, Tamilnadu, India. siddharthsamal.ind@gmail.com Received on Accepted on Abstract: The MANETs are infrastructure-less systems having no central server. MANETs can be used in different areas such as sensor networks, military battlefield, PANs and disaster area network etc. The mobile nodes used in the MANETs are small and weight is light. These nodes (hosts) are supplied by limited power resources such as batteries. There are many traditional routing protocols such as DSR, AOD, TORA etc, but they do not deal with the energy consumption in the mobile nodes. They only consider about the routing that is how to establish a path between source to destination by avoiding the energy constraints. So here in this paper we propose a new method by modifying the traditional AODV protocol called EPRAODV routing protocol which will introduce a power efficient plan in the MANETs. In this method we are going to add one additional parameters like energy in the header of the route request packet. We implement our proposed protocol EPRAODV by studying through simulation using NS-2. The simulation results show that the EPRAODV is able to provide more power efficiency and as well as throughput than AODV over the lifetime of the system and also drag out the lifetime of the each connection. Keywords: MANET, AODV, DSR, EPRAODV, PAN. Introduction: This is the world of Information technology and in this technology world the internet has a great impact in the evolution of communication. So communication between two objects is possible through internet. The increase in the wireless portable devices such as mobile phones and laptops is taking to ad-hoc wireless communication is known as MANETs. Now the wireless sensor networks and MANETs are the most research topics. So typically a MANET is a collection of mobile nodes that come together to form a network without forming a infrastructure. They can be deployed rapidly and also self configured. They can avoid the cost, installation and maintenance of the network infrastructure. A IJPT Sep-2016 Vol. 8 Issue No Page 15600

2 node in a MANET can act as a router and as well as a host. These nodes can create routes dynamically among themselves by means of air without having any infrastructure. There are some applications of MANETs. Such as:- Military Scenarios: MANET underpins strategic system for military correspondences and robotized war zones. Rescue Operations: It gives Disaster recuperation, implies substitution of settled framework system if there should arise an occurrence of ecological calamity. Information Networks: MANET gives backing to the system to the trading of information between cell phones. Device Networks: Device Networks underpins the remote associations between different cell phones so they can convey. Free Internet Connection Sharing: It likewise permits us to impart the web to other cell phones. Sensor Network: It comprises of gadgets that have capacity of detecting, calculation and remote systems administration. Remote sensor system consolidates the force of every one of them three, similar to smoke indicators, power, gas and water meters. There are many existing routing protocols for a MANET. It is classified either as proactive or reactive[9].a proactive or also known as table driven routing protocol in which the route is already known when a packet needs to be forwarded. The family of distance vector protocols is an example of this. On the other hand the reactive or also known as on-demand routing protocol is the one where route generates when source needs it. In other words, when source requires a route to the destination, it initiates route discovery process by sending route request(rreq) packet to know all the possible routes to the destination. Example of it is type of protocols are DSR, AODV etc. As the limited battery is a major and necessary challenge in the MANET because it is very important to have battery power in devices to prolong the life time of the network and avoid the early failure of the node. So power aware routing protocol is used for this purpose. The power aware routing protocol uses power aware metrics[] to know the routes in the MANET. By using these metrics it can save a huge amount of energy and cost for the total network. For example it has been proved that by using the power aware metrics in a shortest cost routing algorithm over a shortest-hop routing can reduce the cost of routing by 5-30%. So in this paper our focus is primarily on the power consumption. As we are integrating the existing AODV protocol with the power aware routing protocol to develop a new protocol called EPRAODV protocol for our proposed approach. Related Works: From the past decade there has been a lot of research work going on the energy consumption in the MANETs. Different types of protocols have been proposed for this only. As it is very hard to reduce the energy in the protocol stack because of the mobility of the nodes. The proposed protocols have advantages and disadvantages also. A IJPT Sep-2016 Vol. 8 Issue No Page 15601

3 new protocol called as PAW-AODV protocol [2]. It is shown that PAW-AODV is able to give more throughput than the traditional AODV protocol in the life time of the network. The simulation results are studied through QUALNET simulator. Another protocol called efficient power aware routing (EPAR)[3]. This protocol is the modification of the DSR protocol. Here they evaluated the routing protocols such as EPAR, MTPR and DSR in different network scales by taking into account of power consumption. This new protocol has reduced the power by 20% in the total power consumption and also the packet delivery ratio will be good. The one major disadvantage of this protocol is that if the network is small then the energy consumption is less but for medium and large networks it produces good results in terms of energy and throughput. Three different techniques [7] for conserving energy such as:-techniques to minimize route request, power control technique, topology control technique. These three techniques will save the energy in different layers of the network. But one the disadvantage is that there is a great chance of link failure in the network. There is another protocol called energy aware routing protocol (E-AODV)[8] which is an improvement of traditional AODV protocol. They have used the Network Simulator version 2.33(NS-2.33) for the simulation. They have shown that with a small change in the principle of AODV protocol can balance the energy consumption between nodes and hence increases performances the lifetime of a network. But one disadvantage of this protocol is that if the network is complex then the performance may be reduced. The protocol called Power aware adhoc on-demand distance vector(paaodv) routing for MANETs [1] is simply the extension of AODV protocol which will reduce the power by 25% from the base protocol. Here they have consumed the power by incorporating the power information at the time of route discovery only. But here the performance is mainly depends upon the size of the network. By studying various papers above we conclude that all proposed protocol for optimizing the power in MANET can be achieved the goal efficiently but still there are some pros and cons the protocols.so here in this paper we are going to fix the issues of power by developing this new protocol called EPRAODV. Proposed Work: We are going to calculate the energy in the route discovery process itself. As we know that source will initiate the route discovery process in the reactive based protocol. In the route discovery process can be done by sending and receiving two packets called route request packet and route reply packet. The RREQ packet will broadcast through the network until it reaches its destination. Then a RREP packet will be forwarded from the source to destination in the unicast way. The header format for route request packet( RREQ) is like:-source address, Source sequence no, IJPT Sep-2016 Vol. 8 Issue No Page 15602

4 Broadcast_id Destination address, Destination sequence no, Hop count and new added parameter Min energy. The source address is the location of source. EPRAODV (FOR ENERGY): Source wants to send Route available? Source can send Send RREQ Set min energy=initial energy of source Calculate residual energy of each node Intermediate node? Destination? Min_power>=residua l power? Seen RREQ before? Drop RREQ Replace min_power by residual power Continue the process until reached destination Send RREP to source Reached destination? Duplicate packet? Calculate the energy efficient path Drop RREQ go for destination Figure-1: EPRAODV IJPT Sep-2016 Vol. 8 Issue No Page 15603

5 The source sequence no acts like a time stamp. The Broadcast_id is a unique id which will increment when the source issues a new route request. Then Destination address is for the location of the destination. If the sender has no idea about the Destination Sequence no then this field will be empty. Hop count is how many hop it has covered from source to destination and finally the Min energy is for the energy left in the each node. The intermediate node will forward the RREQ packet to the next node and if they have duplicate packet then simply discard them. If the intermediate node has any updated information then they will send the route reply packet to the source otherwise they will broadcast further. After getting the RREQ packet now the destination will send the RREP packet in a unicast manner. So the packet header format for the route reply packet(rrep) is like:-source address, Destination address, Destination sequence no, Hop count,min energy. All the properties are same like route request packet but it will be in a reverse manner. Each node contains a routing table to know the routing information so that the destination can send the reply packet. The Routing table also contains:-destination, Next hop, Hop count, Min energy. We will discuss the total working procedure by taking an example and the architecture for the proposed work is given below. Explanation: Step-1 When the source wants to send the data it if the route is already available then it can send but if the route is not available then it will send the route request. Step-2 Now set the minimum energy=initial energy of the source node and calculate the residual energy of the each node. Calculation of Residual Energy: We all know that E=P*T i.e. Energy= Power*time (1) Let T(t) be the transmitted time, so it can be written as T(t)=(size of packet*8)/bandwidth (2) The transmitted energy E(t) can be written as E(t)=p(t)*T(t) (3) The received energy E(r)=p(r)*T(t) (4) The consumed energy can be calculated by IJPT Sep-2016 Vol. 8 Issue No Page 15604

6 E_con(t)=M(t)*c1+M(r)*c2 (5) Siddharth Samal*et al. /International Journal of Pharmacy & Technology <1,1,1,6_,0,10J> 1 <1,1,2,6,_,1,10J> <1,1,1,6,_,1,10J> Dest next Hop E J 2 3 dest Next Hop E J <1,1,2,6,_2,10J> <1,1,1,6,_,2,8J> Dest next Hop E J 5 4 dest Next hop E J <1,1,2,6,_,5,9J> Dest next Hop E J 6 <1,1,1,6,_,4,8J> Dest next Hop E J Figure-2: Energy Calculation (Here E_con(t) is the energy consumption of a node after time t. M(t) is the no of packets send by the node after time t and M(r) is the no of packets received after time t. c1 and c2 are the constants). So the residual energy can be calculated by Initial energy-consumed energy i.e. E_res=E-E_con (6) IJPT Sep-2016 Vol. 8 Issue No Page 15605

7 Step-3 Siddharth Samal*et al. /International Journal of Pharmacy & Technology If it is an intermediate node then check if the minimum power>=residual power if yes then replace the minimum power by residual power in the packet header and as well as in the routing table. If not then continue this process until reach the destination Step-4 When it will reach the destination then calculate the energy efficient path by looking its routing table and do prepare the destination to send the route reply packet. Now let us discuss it with a suitable example:- Let there are 6 nodes in a network, from 1-6.Here 1 is the source and 6 is the destination. So when source wants to send the data first it will do the route discovery by sending RREQ packet. Let us consider the residual energy of nodes in joule are:- Node 1=10J, Node 2=12J, Node 3=13J, Node 4=8J, Node 5=11J, Node 6=9J The source node 1 has to broadcast the packet to node 2 and node 3. At this point the source node is having the energy 10J. Node 2 has the residual energy of 12J. So this 12J is replaced by the 10J as it is minimum. Similarly Node 3 has 13J and it is replaced by 10J also. This value will add to the routing table of the both node. Then from the node 2 the packet will broadcast to the node 4 and node 5. Node 4 and 5 has the residual power 8J and 11J respectively. So 10J will be replaced by the 8J at node 4 and 11J will be replaced by 10J at node 5. Then node 3 will also broadcast the packet to the node 4 and node 5. But it will discard the packet as it has already seen the packet. Now node 6 will get the packet from node 4 and node 5 having the energy 8J and 9J respectively. Here the node 6 will consider the best path having the minimum of energy. So we are considering the minimum energy, hence the path <6,4,3,1> is chosen for the route reply. Hence we can find the best energy efficient path. Results and Discussions: The network simulator used here is NS The simulated network consisted of 50 nodes randomly scattered in a 200*200 at the beginning of the simulation. The tool setdest was used to generate the mobile scenarios. The nodes are moving at six different speed having the range between 0 to 10 m/s and a uniform pause time of 10s. The simulation parameters for the protocol evaluation is shown below:- IJPT Sep-2016 Vol. 8 Issue No Page 15606

8 Energy Siddharth Samal*et al. /International Journal of Pharmacy & Technology No of nodes 50 Area size 2000*2000 Mobility model Antenna model Channel capacity MAC type Link layer type Two Ray Ground Omni Antenna 2Mbps Mac/802_11 LL Transmit power 0.6J Receive power 0.2J Initial energy 7.1J Routing protocol Packet size AODV, EPRAODV 512 bytes Figure-3: Simulation Parameters. Now we will compare the energy and packet delivery of our proposed EPRAODV protocol with the existing AODV protocol. The simulation results are described below:- Energy consumption: AODV EPRAODV No of Nodes Figure-4: Energy Consumption IJPT Sep-2016 Vol. 8 Issue No Page 15607

9 Packet delivery Siddharth Samal*et al. /International Journal of Pharmacy & Technology From the above figure it is shown that the energy consumption of the nodes by using the EPRAODV protocol is less compared to the AODV protocol. We can see from the beginning its self the node consumes less power and it remains less compeered to the AODV protocol throughout the delivery of the packet. When the no of nodes increases the energy is reduced. So EPRAODV is better than AODV. Packet Delivery Ratio: AODV EPRAODV No of Nodes Figure-5: Packet Delivery Ratio. Here we can see that the packet delivery from source to destination is in case of EPRAODV is more compared to the AODV. As the packets are delivered effectively from the starting to the ending but it is not true in case of the AODV protocol. At the beginning EPRAODV performance is not good but when the no of nodes increases it end to end delivery ratio is very good compared to AODV. Hence the throughput of EPRAODV is comparatively better than the AODV protocol. Conclusion & Future Work: Here in this paper we propose an EPRAODV protocol to address the power consumption issues in the MANETs. From the above simulation results we conclude that EPRAODV can carry more number of packets due to its energy consumption technique. The existing protocol works properly if the network is very small but if the system is a complex one then the protocol does not work properly. But our proposed protocol that is EPRAODV can work efficiently in the complex scenarios. EPRAODV saves a lot of energy at the time of packet forwarding and packet receiving thus it increases the lifetime of the network. Here in the EPRAODV algorithm we have not provided any type of security mechanism. This may include in the future work of this paper. IJPT Sep-2016 Vol. 8 Issue No Page 15608

10 References: Siddharth Samal*et al. /International Journal of Pharmacy & Technology 1. Binod kumar Pattanayak, Manoj kumar Mishra, et all, power aware ad hoc On demand Distance vector(paaodv) Routing for MANETs,2011,Vol Chee-wah Tan, Snajay kumar Bose, Modifying AODV for efficient power-aware Routing in MANETs, IEEE conference. 3. Shivashankar, Suresh, et all, Designing energy Routing Protocol with Power Consumption Optimization in MANET,IEEE Transaction on Emerging Topics in Computing. 4. Yanjun Yao, Qing Cao, Cao, EDAL:An Energy efficient Delay-Aware, and Lifetime balancing data collection protocol for heterogeneous wireless sensor Networks 2015,Vol Di Tang, Tong tong Lee, Jian Ren, Cost-Aware-Secure Routing(CASER) protocol design for wireless sensor networks 2015,Vol Gina Mantinez, Shufang Li,Chi Zhou, Westage-Aware Routing in Energy-Harvesting,2014,Vol Niranjan kumar Ray, Ashok kumar Turuk, 2010, Energy efficient Techniques for wireless Adhoc Network, IJCICT pp Charu Gupta,Pankaj Sharma Implementation of Energy Aware Routing Protocol for Mobile Adhoc Networks,2011,Vol Dr S.S. Dhenakaran, A.Pravathavarthiri, An Overview of Routing protocol in Mobile Adhoc Networks,IJARCSSE,2013,Vol Arati, Dr S.S. Tyagi, Study of MANET: Characteristics, Challenges, Application and security Attacks,IJARCSSE,2013,Vol S. Shakkottai, T. S. Rappaport, and P. C. Karlsson, Cross- layer design for wireless networks", IEEE Communications Mag., 2003 Vol 4, pp S.Muthuramalingam et al. A Dynamic Clustering Algorithm for MANETs by modifying Weighted Clustering Algorithm with Mobility Prediction,2010,Vol 2,pp Kim, D., Garcia-Luna-Aceves, J.J.,Obraczka, K., Cano, J.-C., and Manzoni P, Routing Mechanisms for Mobile Ad hoc Networks based on the Energy Drain Rate,2006,Vol 2,,pp IJPT Sep-2016 Vol. 8 Issue No Page 15609

11 14. P. Peter,S. Perrearu, Performance analysis of reactive shortest path and multi-path routing with load balance, 2003, pp C.K., Minimum battery life to support ubiquitous mobile computing in wireless ad hoc Networks,,2001,pp L. Lin, N. Shroff, and R. Srikant, Asymptotically optimal energy-aware routing for multihop wireless networks with renewable energy sources, 2007,Vol 15, pp K. Zeng, W. Lou, K. Ren, and P. Moran, Energy-efficient geographic routing in environmentally powered wireless sensor networks, 2007, pp Z. A. Eu and H. P. Tan, Adaptive opportunistic routing protocol for energy harvesting wireless sensor networks, 2012,pp J. Hee Ryu, S. Song, and D. -H. Cho, New clustering schemes for energy conservation in two-tiered mobile ad-hoc networks, 2001,pp C. E. Perkins, E. M. Royer, S. R. Das and M. K. Marina, Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks, 2001,pp Corresponding Author: Siddharth Samal*, IJPT Sep-2016 Vol. 8 Issue No Page 15610