Efficient Power Aware Routing Research Articles

An Individual Node Delay Based Efficient Power Aware Routing Protocol for Wireless Heterogeneous Sensor Networks

Miscellaneous node transmission ranges builds up Wireless Heterogeneous Sensor Networks (WHSNs). Designing an efficient, reliable and scalable routing protocol for WHSNs with intermittent asymmetric links is a challenging task. In this paper, we propose an efficient power aware routing scheme for WHSNs, which can provide loop-free, stateless, source-to-sink routing scheme without using prior information about neighbor. It uses both symmetric and asymmetric links to forward data from source to sink. The source node broadcasts location information to all its neighbor nodes. Each neighbor node calculates a delay slot based on the information obtained from the source to forward its power value to it. The node that has a minimum delay slot forwards the power earlier than the other nodes during contention phase and the delay slot is used to suppress the selection of unsuitable low-power nodes at that time. We also prove that our protocol is loop-free assuming no failures in greedy forwarding. By simulations we show that our protocol significantly outperforms the existing protocols in WHSNs.

Optimizing Transmission Power and Energy Efficient Routing Protocol in MANETs

Energy is the important criterion for a decentralized network. By the cooperative physical layer network coding scheme, the requirement of energy transmission can be reduced. This could be implemented using two routing algorithms namely CCSPR and COSPNCR. An algorithm is constructed for reducing power consumption and rate control. In contradiction of the conventional power aware algorithms, an efficient power aware routing (EPAR) method is proposed which distinguishes the capability of nodes by its residual battery power, and through the expected energy that spent in reliably data packets forwarding on a specific link. To evaluate this, the data routing is performed with high mobility in dynamic environment. By using this algorithm, less cost path can be chosen and data rate can also be controlled. Thus energy consumption can be decreased and hence lifetime of a node can be improved. This approach first identifies the path having high lifetime and through that path, the communication will take place. This work consumes a lesser amount of energy for the routing, thus makes power efficient routing. Hence the throughput is increased and the power consumption is reduced. The conventional shortest path routing method on regular line and the grid line networks attains the gain of energy savings up to 45–75% correspondingly. By using EPAR algorithm, the energy consumption rate is minimized, so the network life time and the performance are improved. The energy consumption rate can be decreased to 80% by using EPAR approach in Mobile Ad hoc Networks.

Performance Analysis of Energy Efficient Multicast Routing Protocols in Manet

Mobile ad-Hoc Networks (MANETs) are a collection of energy constraint mobile nodes which forms a body free network that doesn't need any centralized governance. The mobile nodes in MANETs are powered by way of a few energy sources generally a battery that can't be recharged in many actual lifestyles situations. The nodes in MANETs are liable for routing the information in the network. Untied nodes in transportable particularly appointed structures no doubt depend on the dexterous usage in their energy source. This makes the energy consumption in terms of energy saving one of the most crucial aspects of MANET that need to be taken into consideration. Several energy-aware routing protocols were proposed in this location to perform efficient usage of energy in MANET. Considered one of which is energy efficient power aware Routing y (EPAR) that prolongs lifespan of nodes in the network. The route that has nodes with maximum energy is chosen through this protocol and the information packets are transmitted with minimal energy utilization. on this paper, it examine the performances of a number of the energy aware routing protocols which includes EPAR, MTPR and DSR based totally on parameters like packet delivery ration, delay, and power consumption by using various multicast group size the use of good sized simulation.

Performance Analysis of Efficient Energy Routing Protocols in MANET

The rapid evolution in the field of mobile computing is driving a new alternative way in which mobile devices form a self-creating, self-administering and self-organizing wireless networks called Mobile Ad hoc Networks (MANETs). In MANET, the aware of power heterogeneity is an important technical challenging problem to increase the energy efficiency of each node. The mobile nodes in MANETs have different transmission power and power heterogeneity. This paper analyzes the performance evaluation of three Efficient Energy Routing Protocols such as EPAR (Efficient Power Aware Routing Protocol), MTPR (Minimum total Transmission Power Routing) and DSR (Dynamic Source Routing). The Efficient Power Aware Routing protocol (EPAR) mainly considers the node capacity by its remaining battery power and the expected energy spent for forwarding data packets reliably. EPAR uses mini- max formulation method for the selection of the route that has maximum packet delivery ratio at the smallest Residual Battery Power. With different network scenarios, EPAR is dominating in terms of Residual Battery Power, Power Consumption, Network lifetime and Throughput with respect to time and routed data packets.

Notice of Violation of IEEE Publication Principles: Designing Energy Routing Protocol With Power Consumption Optimization in MANET

Notice of Violation of IEEE Publication Principles Designing Energy Routing Protocol with Power Consumption Optimization in by Shivashankar, H.N. Suresh, G. Varaprasad, and G. Jayanthi, in the IEEE Transactions on Emerging Topics in Computing, Vol.2, No.2, June 2014, pp.192-197 After careful and considered review, it has been determined that the above paper is in violation of IEEE's Publication Principles. One of the authors, Golla Varaprasad, falsified reviewer names and provided them as recommended reviewers for the manuscript. As technology rapidly increases, diverse sensing and mobility capabilities have become readily available to devices and, consequently, mobile ad hoc networks (MANETs) are being deployed to perform a number of important tasks. In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose efficient power aware routing (EPAR), a new power aware routing protocol that increases the network lifetime of MANET. In contrast to conventional power aware algorithms, EPAR identifies the capacity of a node not just by its residual battery power, but also by the expected energy spent in reliably forwarding data packets over a specific link. Using a mini-max formulation, EPAR selects the path that has the largest packet capacity at the smallest residual packet transmission capacity. This protocol must be able to handle high mobility of the nodes that often cause changes in the network topology. This paper evaluates three ad hoc network routing protocols (EPAR, MTPR, and DSR) in different network scales, taking into consideration the power consumption. Indeed, our proposed scheme reduces for more than 20% the total energy consumption and decreases the mean delay, especially for high load networks, while achieving a good packet delivery ratio.

Implementing an Energy Aware Issues in MANET by Designing Efficient Routing Protocol

Ad Hoc Networks (MANETs) are multihop wireless networks in which all nodes cooperatively maintain network connectivity. In such a multihop wireless network, every node may be required to perform routing in order to achieve end to end communication among nodes. These networks are energy constrained as most ad hoc mobile nodes today operate with limited battery power. Hence, it is important to minimize the energy consumption of the entire network in order to maximize the lifetime of ad hoc networks. Since the emergence of mobile computing, reducing energy consumption of battery operated computing devices has become a very active research area. The widespread popularity of mobile computing devices, such as laptops, handheld devices and cell phones, motivates this research area. These nodes need to be energy conserved to maximize the battery life. Thus, development of energy efficient routing protocols is needed due to the limited battery power of all nodes. In this paper, we have considered two reactive protocols such as DSR and modified DSR (Efficient Power Aware Routing, EPAR) for MANETs and evaluated the energy performance metrics in all the four modes (transmitting, receiving, idle & sleep) and the residual energy. Finally, by the observations we conclude that EPAR offers the best combination of energy consumption and network life time performance.

Efficient power aware routing algorithm for mobile ad hoc networks

AbstractIf the battery of a node is drained out, then it cannot be communicated with other nodes and the number of dead‐nodes makes the network partition. In order to overcome this problem, we propose a new routing algorithm for mobile ad hoc networks. It uses the residual battery capacity, transmission power, and hop‐count to route the data packet. Here the proposed model has simulated with the help of 100 mobile nodes using the network simulator and has tested under various conditions. It compares with the ad hoc on‐demand distance vector protocol, minimum total transmission power, and min–max battery cost routing models. The proposed model has shown better results in terms of node lifetime and network lifetime. The mobile nodes start to die at 400, 420, 440, 470, and 508 s for AODV, MTPR, MMBCR, CMMBCR, and proposed models, respectively. If the system has 145 J, then the AODV model transmits 38 000 of data packets, whereas the MTPR, MMBCR, CMMBCR, and proposed models will transmit 37 600, 47 240, 41 580, 42 700, and 42 955 of data packets, respectively. Copyright © 2009 John Wiley & Sons, Ltd.

An efficient online‐battery aware geographic routing algorithm for wireless sensor networks

AbstractWireless sensor networks (WSNs) are being used in a wide variety of critical applications such as military and health‐care applications. Such networks, which are composed of sensor nodes with limited memory capacity, limited processing capabilities, and most importantly limited energy supply, require routing protocols that take into consideration these constraints. The aim of this paper is to provide an efficient power aware routing algorithm for WSNs that guarantees QOS and at the same time minimizes energy consumption by calculating the remaining battery capacity of nodes and taking advantage of the battery recovery process. We present an online‐battery aware geographic routing algorithm. To show the effectiveness of our approach, we simulated our algorithm in ns2 and compared it with greedy perimeter stateless routing for wireless networks and battery‐aware routing for streaming data transmissions in WSNs. Copyright © 2009 John Wiley & Sons, Ltd.