Assistant Professor & Head. Keywords- MANETs, Routing Protocol, Energy Consumption, protocol stack, mobile nodes.

Transcription

1 Volume 4, Issue 3, March 2014 ISSN: X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: Improving Packet Transmission Rate of Ad hoc Network by Battery Power Awareness Anmol Suryavanshi PG Scholar Computer Science & Engineering JDCT,Indore, India Nitesh Rastogi Assistant Professor & Head Computer Science & Engineering JDCT,Indore, India Abstract energy efficient routing scheme deals with efficient utilization of energy resources. by controlling the early depletion of the battery, adjust the power to decide the proper power level of a node and incorporate the low power strategies into the protocols used in various layers of protocol stack. ad hoc wireless networks are power constrained since nodes operate with limited battery energy. if some nodes die early due to lack of energy, they cannot communicate with each other. therefore, inordinate consumption of nodes energy should be prevented. in fact, nodes residual energy utilization after threshold should be increase the energy utilization of networks. here we proposed a new energy utilization scheme in manet. in this scheme we set a threshold value for energy consumption by mobile nodes in our network. if the energy level of any node/s in the network reaches to threshold level that are participated in communication means it will be active in the network. but here we apply one condition, number of nodes that having a energy remaining after threshold value is also utilized in communication. according to our proposed approach a new energy aware efficient routing to make aware our network about the energy of nodes by that we remove the problem of suddenly loss of session to recognize the unfaithful nodes and extend the life cycle of network. Keywords- MANETs, Routing Protocol, Energy Consumption, protocol stack, mobile nodes. I. INTRODUCTION A Mobile Ad Hoc Network (MANET) consists of a set of mobile hosts that carry out basic networking functions like packet forwarding, routing, and service discovery without the help of an established infrastructure. Nodes of an ad hoc network rely on one another in forwarding a packet to its destination, due to the limited range of each mobile host s wireless transmissions. An ad hoc network uses no centralized administration. This ensures that the network will not cease functioning just because one of the mobile nodes moves out of the range of the others. Nodes should be able to enter and leave the network as they wish. Because of the limited transmitter range of the nodes, multiple hops are generally needed to reach other nodes. Fig 1.1 A Mobile Ad Hoc Network (MANET) The topology of ad hoc networks varies with time as nodes move, join or leave the network. This topological instability requires a routing protocol to run on each node to create and maintain routes among the nodes. Mobile ad-hoc networks can be deployed in areas where a wired network infrastructure may be undesirable due to reasons such as cost or convenience. It can be rapidly deployed to support emergency requirements, short-term needs, and coverage in undeveloped areas. So there is a plethora of applications for wireless ad-hoc networks. As a matter of fact, any day-today application such as electronic and file transfer can be considered to be easily deployable within an ad hoc network environment. Also, we need not emphasize the wide range of military applications possible with ad hoc networks. Not to mention, the technology was initially developed keeping in mind the military applications, such as 2014, IJARCSSE All Rights Reserved Page 755

2 battlefield in an unknown territory where an infrastructure network is almost impossible to have or maintain. In such situations, the ad hoc networks having self-organizing capability can be effectively used where other technologies either fail or cannot be deployed effectively [1]. As a result, some well-known ad hoc network applications are: Collaborative Work: for some business environments, the need for collaborative computing might be more important outside office environments than inside. After all, it is often the case where people do need to have outside meetings to cooperate and exchange information on a given project. Crisis-management Applications: these arise, for example, as a result of natural disasters where the entire communications infrastructure is in disorder. Restoring communications quickly is essential. By using ad hoc networks, a communication channel could be set up in hours instead of days/weeks required for wire-line communications. Personal Area Networking and Bluetooth: a personal area network (PAN) is a short- range, localized network where nodes are usually associated with a given person. These nodes could be attached to someone s pulse watch, belt, and so on. In these scenarios, mobility is only a major consideration when interaction among several PANs is necessary. MANETs have several significant characteristics and challenges. They are as follows: A. Dynamic topologies: Nodes are free to move arbitrarily. Thus, the network topology may change randomly and rapidly at unpredictable times, and may consist of both bidirectional and unidirectional links. B. Bandwidth-constrained, variable capacity links: Wireless links will continue to have significantly lower capacity than their hardwired counterparts. In addition, the realized throughput of wireless communications, after accounting for the effects of multiple access, fading, noise, and interference conditions, is often much less than a radio's maximum transmission rate. C. Energy-constrained operation: Some or all of the nodes in a MANET may rely on batteries or other exhaustible means for their energy. For these nodes, the most important system design optimization criteria may be energy conservation. Our work is on efficient energy consumption. D. Security: Mobile wireless networks are generally more prone to physical security threats than fixed-cable nets. The increased possibility of eavesdropping, spoofing, selfish behavior and denial-of-service attacks should be carefully considered. These characteristics and challenges create a set of underlying assumptions and performance concerns for protocol design which extend beyond those guiding the design of routing within the higher-speed, semi-static topology of the fixed Internet.Topology of the network changes frequently and unpredictably since its host moves randomly. Therefore, routing is an integral part of ad hoc communication, and has received interests from many researchers. In traditional on-demand routing schemes like Ad Hoc On Demand Distance Vector Routing (AODV) scheme [2], when route disconnects, nodes of the broken route simply drop data packets because no alternate path to the destination is available until a new route is established. When the network traffic requires real time delivery (voice, for instance), dropping data packets at the intermediate nodes can be costly. The Power aware scheme in Ad hoc routing Protocol enables dynamic, self starting, multi hop routing between participating mobile nodes wishing to establish and maintain an ad hoc network. It allows mobile nodes to maintain routes to destinations with more stable route selection. This scheme responds to link breakages and changes in network topology in a timely manner and also takes care of nodes that do not have better power status to participate in route selection. One distinguishing feature of Power aware ad hoc routing scheme is its use of Power status for each route entry. Given the choice between two routes to a destination, a requesting node is required to select one with better power status and more active. II. LITERATURE SURVEY Several approaches have been developed to address the energy efficiency issues in Ad-Hoc Networks. These techniques differ in the methodology as well as the layer of the protocol stack at which they function [3]. Algorithms belonging to the category may operate at the MAC layer level, Network layer level, or in between. The following section covers the most significant algorithms that belong to these categories. Power-Aware Routing- Authors explore power-aware metrics to use with Routing Protocols on top of their MAC power savings protocol, PAMAS [4]. They indicate that the strategy followed by the different Routing Protocols that are not power conscious would lead to fast depletion of battery power and hence quick degradation of the Network operation. We have already discussed these metrics. The authors implemented the first and fourth metrics (minimize energy consumed per packet and minimize cost per packet, respectively). In their simulations, the authors used sparsely populated Networks and they did not consider mobility in their simulations. The reason behind not using mobility is that the evaluation is done for power management and not routing. In our view, mobility has a considerable effect on the performance of power efficient mechanisms. Maximum Battery Life Routing- A power-aware Routing Protocol that distributes power consumption evenly over nodes and minimizes the overall transmission power is proposed in [5]. This protocol uses the γ conditional max-min battery capacity routing (CMMBCR) scheme. It uses battery capacity instead of a cost function as a route selection metric. When all nodes on some possible routes between a source and a destination have sufficient remaining energy above a certain value, γ, the route with the minimum total transmission power (MTRP) among these routes is chosen. If all routes have nodes with low battery capacity, routes that include nodes with the lowest battery capacity should be 2014, IJARCSSE All Rights Reserved Page 756

3 avoided to extend the lifetime of the nodes. If the value of γ is zero, the CMMCBR reduces to MTRP. If the value of γ is equal to the maximum (100), the CMMBCR scheme reduces to the Min-Max battery cost routing (MMBCR) scheme. Analysis of Energy Efficient Routing Techniques- The main focus of research on Routing Protocols in MANETs has been Network performance [6]. There has been some study on Energy aware Routing Protocols for MANETs. Presented below is a brief review of some of them. Minimum Energy Routing- Author proposes a routing algorithm based on minimizing the amount of energy per bit required to get a packet from source to destination [1]. III. PROBLEM DEFINITION The nodes in an ad hoc network are constrained by battery power for their operation. To route a packet from a source to a destination involves a sufficient number of intermediate nodes. Hence, battery power of a node is a precious resource that must be used efficiently in order to avoid early termination of a node or a network. Thus, energy aware routing is an important issue in such networks. Power aware routing are the major means of increasing the life of a node. The lifetime of a network is usually defined according to the following criteria: The time until the first node burns out its entire battery budget; The time until a certain proportion of the nodes fails; and The time until network partitioning occurs. The communication related power consumption is mainly due to transmit-receive module present in the nodes. Whenever a node remains active, that is, during transmission or reception of a packet, energy gets consumed. Even when the node is not actively participating in communication, but is in the listening mode waiting for the packets, the battery keeps discharging. The computation power refers to the power spent in calculations that take place in the nodes during routing and power adjustments. A. Energy Awareness- Network partitioning interrupts communication sessions and can be caused by node movement or by node failure due to energy depletion. Whereas the former cannot be controlled by the routing protocol, the latter can be avoided through appropriate routing decisions. Operational lifetime is therefore defined in this survey as the time until network partitioning occurs due to battery outage. A few reasons for energy deterioration in MANETs are limited energy of the nodes, difficulties in replacing the batteries, lack of central coordination, constraints on the Battery source, selection of optimum transmission power, and channel utilization. IV. PROPOSED SOLUTION Ad hoc wireless networks are power constrained since nodes operate with limited battery energy. If some nodes die early due to lack of energy, they cannot communicate with each other. Therefore, inordinate consumption of nodes energy should be prevented. In fact, nodes residual energy utilization after threshold should be increase the energy utilization of networks. Here we proposed a new energy utilization scheme in MANET. In this scheme we set a threshold value for energy consumption by mobile nodes in our network. If the energy level of any node/s in the network reaches to threshold level that are participated in communication means it will be active in the network. But here we apply one condition, number of nodes that having a energy remaining after threshold value is also utilized in communication. According to our proposed approach a new energy aware efficient routing to make aware our network about the energy of nodes by that we remove the problem of suddenly loss of session to recognize the unfaithful nodes and extend the life cycle of network. Energy efficient routing scheme deals with efficient utilization of energy resources. By controlling the early depletion of the battery, adjust the power to decide the proper power level of a node and incorporate the low power strategies into the protocols used in various layers of protocol stack. There are little issues and solutions which witnesses the need of energy aware routing in ad hoc wireless networks. As we have shown earlier, idle energy consumption constitutes a significant percentage of the overall energy consumed by the wireless interfaces of network nodes. Therefore, reducing this energy should be a cornerstone in any energy conservation efforts. As will be seen, our proposed algorithm, addresses the issue of idle energy consumption in a manner fair to all network nodes. Different nodes are given equal opportunities to conserve idle energy. When idle energy is addressed, another factor remains that may still affect energy fairness within the network. From an energy point of view, this causes two issues: Nodes are not treated as equal, which means that some nodes will run out of energy faster than the others due to their strategic location, thus causing them to cease to serve their own users faster than others. This presents a local problem that affects node users. Network partitioning may occur. Since some nodes may be critical for routing between certain nodes at some point of time, if these critical nodes run out of energy, routing between these nodes can no longer be done. This presents a global problem that affects parts of the network or the whole network depending on the case. If node 7 value reaches to threshold level now at that time it generate a energy alert message only important packets are delivered though node 7 till their energy level reaches to minimum threshold level. Then route update function will call. A. Description of Proposed Algorithm. 2014, IJARCSSE All Rights Reserved Page 757

4 Proposed Connection Establishment and Route Update Algorithm & With Threshold Value and Minimum Threshold value. Initial energy = E (Suppose E = 100) Threshold energy = Ɵ1 (20% of X) //for alert the energy level. Minimum threshold energy = Ɵ2 (5% of E) // for recharge If {( E > Ɵ1 ) && (radio range from source to next hop < 250m ) && (next hop == destination)} Then { Establish connection from source to destination } Else { no connection establishment} If {(E Ɵ1)} { nodes will broadcast the message in network only important packets are forward & those who already establish connection transfer their data before energy level reaches to minimum threshold level } 3) If{(E == Ɵ2)} { Node will be in charging mode & route will update } 4) If{( node energy charge up == 100) && ( radio range from source to next hop 250m)} { Go to step 1 } End The maximize the lifetime of network nodes and hence the network operation as a whole. The main goals of the algorithm are fair energy conservation via: Rotating sleep periods equally among network nodes thus giving nodes equal opportunity for reducing energy consumption Assisting routing algorithms in making routing decisions based on energy fairness Little impact on network operation, for example, introduces slight or no additional traffic or energy cost. From a functional point of view, proposed algorithm can be considered to consist of two main units. One of these units handles the energy conservation operation. This is done through managing the nodes energy level periods. The other unit or aspect of the algorithm takes care of supporting the routing protocol, as far as energy management decisions are concerned. It helps to ensure the routing protocol makes routing decisions that serve a specific goal. For example, whenever possible, nodes carry out routing duties that are proportional to their energy levels compared to each other. B. Energy Consumption Management When algorithm is enabled, nodes operate in one of two main modes: asleep or awake. In order to ensure maximum energy fairness, algorithm enforces a configurable two-step cycle of operation for each node of the network. One portion of the cycle is a asleep or minimum threshold level period while the other portion is a wakeup period. While awake, a node can communicate normally with other nodes as per the routing protocol that is in use. The length of the mandatory wakeup period affects the connectivity of the network as nodes establish their knowledge of the current neighbors and network conditions during this period. While sleep mode, a node cannot exchange data with the external world. The only exception is sending broadcast messages that pertain to the routing protocol. In this case, the node goes to what is called threshold level state, where it wakes up for the duration of the broadcast and then it goes back to the sleep state to resume sleeping for whatever is left of the current sleep period. The reason behind not allowing unicast traffic and allowing only the sending of broadcast traffic is as follows. If we are to allow the node to send unicast messages during the sleep period, the node will have to abort the sleep and make sure it remains awake for the period of exchanging the control messages (RTS, CTS and ACK) as well as the data with the other end. This will not only complicate the operation of the algorithm, but will also potentially deprive the node from having a decent sleep period since the amount of time taken by this exchange can be unpredictably long in cases such as transmission errors. This contradicts with the goal of fair energy conservation for all nodes. However, we still allow broadcast messages to be sent by the nodes have forwarded the important packets. since the interruption of the sleep mode will be minimal in this case and at the same time this permission will help preserve healthy operation of the routing algorithm. While the node is asleep ( threshold level) other nodes may have some traffic that they need to send or forward to it. In order to make sure that this traffic will not be lost, nodes need to know when the node in question will start its sleep period and when it will become awake again which in turn determines if the node is asleep or awake. With this knowledge, the sending nodes buffer the traffic going to the sleeping node during its sleep period and then release it when it wakes up. This can be achieved via going-to-sleep and waking-up notifications that the node can send to the outside world upon going to sleep and waking up, respectively. Those nodes that not participated in important packet transmission are goes to sleep mode. C. Proposed algorithm Based Routing Now AODV generate a RREQ message to their neighbours if node energy is greater than threshold value then establish connection and forwarded request up to destination. Then all the nodes send back the RREP message to their sender according to energy condition criteria. 2014, IJARCSSE All Rights Reserved Page 758

5 Fig.1.2 Energy based connection establishment The red colour nodes in the network are low level energy nodes so no connection will establish according to proposed algorithm. The numbers of nodes in the network are only take part in communication if they have a sufficient energy except the important packet condition. Now in a given simulation time if all the nodes are reaches to threshold level then in that case (if required) the RREQ and RREP procedure are calling for forwarding important packets in the network between two energy levels. Shown in figure 1.2 Fig.1.3 Routing with Important Packets Now if the energy level of maximum number of nodes are in between threshold and minimum threshold value then same RREQ and RREP route discovery procedure will call till energy reaches to minimum threshold value. Here only the communication is possible among low level energy nodes. Now if the energy of nodes is reaches to minimum threshold value then in that case the nodes are not take part in communication and route will update. V. EXPECTED RESULTS After the study and demonstrate and simulation of suggest aprraoh following points will gets as reluts. Efficient utilization of battery power of nodes which imoprove lifetime of network. Make continue data transmissions in the network against link breakage. Enhance performance of network in term throughput and packet delivery. Reduce delay of data packets between source and destination. VI. CONCLUSION This strategy mainly optimizes the power depletion and maintains a more or less uniform power usage among all the nodes in the network while maintaining effective throughput. In our simulation, we observe a sharp performance and power usage gains using the proposed algorithm. A proposed scheme has been utilizes power status of each mobile node and alternate paths. This scheme can be incorporated into any ad hoc on-demand routing protocol to improve reliable packet delivery in the face of node movements and route breaks. Alternate routes are utilized only when data packets cannot be delivered through the primary route. As a case study, it has been applied to AODV and performance has been studied via simulations. Simulation results have indicated that new technique provides robustness to mobility and enhances protocol performance. 2014, IJARCSSE All Rights Reserved Page 759

6 However, this scheme may not perform well under sparse traffic networks. Its performance has been found much better than other existing protocols in dense medium as probability of finding active routes increases.according to our simulation result we also get important packet transmission concept. This one is the one unique concept to utilizes energy remaining after threshold level. REFERENCES [1] Forman G., Zahorjan J. The challenges of mobile computing. IEEE Computer 1994; 27(4): [2] Perkins C. Ad Hoc Networking: Addison-Wesley: 2001; [3] N. Vassileva, F. Barcelo, A Survey of Routing Protocols for Maximizing the Lifetime of Ad Hoc Wireless Networks, International Journal of Software Engineering and Its Applications, Vol. 2, No. 3, pp , 2008 [4] S. Singh, M. Woo, C. Raghavendra, Power-aware Routing in Mobile Ad Hoc Networks, Proceedings of the ACM Mobile Computing and Networking Conference, Dallas, Texas, pp , 1998 [5] C. Toh, Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks, IEEE Communications Magazine, pp. 2-11, 2001 [6] L. M. Feeney and M. Nilsson, Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment, Proceedings of IEEE INFOCOM 2001, Vol. 3, Anchorage AK, pp , 2001 [7] V. Rishiwal, M. Yadav, S. Verma, S. K. Bajapai, Power Aware Routing in Ad Hoc Wireless Networks, Journal of Computer Science and Technology, Vol. 9, No. 2, pp , 2009 [8] R. Kravets and P. Krishnan, Power Management Techniques for Mobile Communications, Proceedings of the ACM Mobile Computing and Networking Conference, Dallas, Texas, October 1998, pages [9] Li Q, AslamJ, Rus D. Online Power-aware Routing inwireless Ad-hoc Networks. Proceedings of Int l Conf. on Mobile Computing and Networking (MobiCom 2001) [10] Perkins C, Bhagwat P. Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. Computer Communications Review 1994; [11] Pei G, Gerla M, Chen T-W. Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks. Proceedings of IEEE Int l Conf. on Communications (ICC) 2000; [12] Johnson D, Maltz D. Dynamic Source Routing in ad hoc wireless networks. Mobile Computing (edited by Imielinski T, Korth H); Kluwer Academic, 1996; [13] Perkins C, Royer E. Ad-hoc On-Demand Distance Vector Routing. Proceedings of 2nd IEEE Workshop on Mobile Computing Systems and Application , IJARCSSE All Rights Reserved Page 760