Power-aware Routing Research Articles

Comparative analysis of power aware routing protocols in mobile ad-hoc network

The Mobile Ad-Hoc network is a self-governing wireless network having dynamic topology and scattered mobile nodes. Limited power supply is the major challenge in wireless Ad-Hoc networks. Thus, for overall functioning of the ad-hoc network, efficient power conser-vation mechanism becomes the critical and most important component in ad-hoc network. Various power aware routing mechanism have been evolved to preserve energy, prolonging the life span of its nodes and thus of the network itself. Various other metrics for preserving energy also considered viz. selecting shortest path from source to destination, remaining battery power , fair distribution of traffic load among the nodes and minimizing the total transmission power with a view to increase the network life span and link stability. In this paper, various proposed protocols and recent energy conservation mechanisms are studied for mobile ad-hoc network. After analyzing the existing works it has been observed that there are still several areas where we can give more focus in the future.

A metric for measuring power efficiency and data throughput in mobile ad hoc networks

ABSTRACTMobile ad hoc networks (MANET) are becoming increasingly popular, particularly in the realm of sensor networks. However, most of the ongoing research is centered on protocol development or data delivery characteristics, particularly in the areas of throughput and latency. But in the realm of wireless networks, a new metric needs to be considered, one that takes into consideration the power efficiency across the wireless network. Wireless nodes have a finite amount of energy to operate with, and when that energy is depleted, the node dies and no longer performs its intended functions. In order to maintain a functioning MANET for longer periods of time, the network as a whole needs to be optimized for power efficiency. Ongoing research in the realm of MANETs includes the development of power-aware routing algorithms. A number of them have been developed, often augmenting existing routing protocols. To aid in the validation of network performance improvement, this paper describes a metric that incorporates both power efficiency and data throughput of MANETs. This new network performance metric can be used for selecting the optimal routing protocol for the network scenario.

A new energy based power aware routing method for MANETs

A mobile ad-hoc network (MANET) is a self-configuring and self-directed functioning system that operates without infrastructure and rapidly deploys in a network. The MANET does not need centralized administration. It contains a mobile node for wireless transmission and MANETs that can be established anywhere. In addition, any instance of the ad-hoc network is effective since it is capable of eliminating the complexity of central admission and infrastructure. The MANET is widely in use in many fields such as military applications, mobile communication, and emergency situations. Energy consumption is an important issue in MANET because the mobile nodes are battery powered. In this paper, a dynamic energy ad-hoc on-demand distance vector routing protocol (DE-AODV) is proposed to minimize the packet delay, maximize the network lifetime, and reduce the energy consumption. The increase in node energy and dynamic supply of external energy is through a battery. The energy mechanisms consider whether the mobile nodes are in sleep, active, or transmit mode. The DE-AODV protocol is used to find out the selection of nodes which are energy-efficient and trustworthy to select the shortest route path from source to destination. The routing protocols use the external battery when there is a chance of link failure during packet transmission time. The proposed DE-AODV routing protocol provides efficient output when compared with other existing techniques. Simulation results show that the proposed system achieves better performance when compared with previous protocols in terms of packet delivery ratio, network stability rate, end-to-end delay of packets, end-to-end transmission, and throughput.

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.

RRect: A Novel Server-Centric Data Center Network with High Power Efficiency and Availability

In this paper, we propose a novel server-centric network for data centers, called RRect. Compared to existing server-centric networks, RRect provides a more graceful degradation performance in the presence of component failure. Meanwhile, RRect enjoys a linear diameter to the network order and multiple parallel paths. We present algorithms to find paths and to construct all parallel paths between any pair of servers in RRect. We also show that without using any power-aware routing algorithm, RRect behaves more power efficient in its interconnection network. To meet today's stringent high availability requirement, RRect can be configured into redundancy and failover scheme. In particular, RRect can be configured into both symmetric and asymmetric redundancy modes to cater different applications’ needs, which cannot be implemented in existing server-centric networks. Moreover, RRect gives more flexibility to adjust the network size. Given the same switches, by fine tuning the parameters, RRect provides numerous structures with different sizes, while preserving the properties of short diameter and multiple parallel paths. Our comprehensive simulations show that RRect gives much better graceful degradation performance in the presence of component failure, and RRect saves much energy in the interconnection network. Meanwhile, RRect can maintain the same performance on many critical metrics as BCube, including short diameter and excellent aggregate throughput. All these features make RRect a very empirical structure for enterprise dater center network products.

Energy Efficient and robust routing with RPAR Protocol in Ad Hoc Networks

In ad hoc network, the topology of network changes frequently due to the mobile nature of nodes where the communication is possible without any fixed network infrastructure. Mobile nodes are battery operated and so energy efficient routing should be provided which increases the network life time. The existing routing mechanisms do not consider both hop count and energy of nodes for data transmission. In this paper we propose a routing mechanism where data transfer from source to destination is based on the minimum hop count and residual energy of mobile nodes. The proposed RPAR protocol shows better performance when compared to existing Energy power aware routing protocol .The analysis is carried out by using network simulator (NS-2), the simulation results shows that the proposed routing mechanism provides energy efficient and reliable routing in ad hoc networks.

Secured energy optimized Ad hoc on-demand distance vector routing protocol

A Mobile Ad hoc network (MANET) forms a group of mobile nodes which are active and exchange messages using interconnections between the nodes. The mobile network is the new generation of wireless network and differs from the wired network in the use of power-aware routing protocols, ease of routing configuration and network infrastructure. The proposed work identifies and resolves the black hole attack and provides security to the routing protocol by using a secured energy-optimized expanding ring search (ERS) algorithm. Also, this technique reduces the energy consumption and improves the network lifetime. In addition, this work focuses on improving the packet delivery ratio (PDR), throughput and security using the advanced encryption standard (AES) cryptographic algorithm.

An on-demand power and load-aware multi-path node-disjoint source routing scheme implementation using NS-2 for mobile ad-hoc networks

Ad-hoc network consists of a group of mobile nodes with a restricted power supply resources that can communicate with each other without any established infrastructure or centralized administration. The unbalanced distribution of traffic loads among network's nodes led to a power dissipation of overloaded nodes, the loss of these vital nodes causes link failure which could lead to critical topological changes, affect the network operations and its lifetime. This paper summarized the energy consumption problem in ad-hoc wireless networks and the existing power aware routing protocols classification. The main objective of this paper is to introduce and implement a new power and load-aware routing scheme that is based on DSR protocol's scheme. A new cost function was drawn, that allows source nodes to find a multiple node-disjoint power and load aware optimal paths to their destinations, as a way to extend the operational life of nodes and thereby maximize the network lifetime. Simulation results showed that the protocol that is based on this proposed scheme can prolong network lifetime by almost 30% with low traffic loads, and by 40% with high traffic loads compared to pure DSR.

QoS-Based Protocol for Routing in Wireless Sensor Networks

A sensor network consists of many sensor nodes scattered throughout a geographic area. The sensor nodes communicate by radio to ensure the network operations and to route the data to the sink. The problem we are interested in this work relates to the optimization of the quality of service (QoS) in wireless sensor networks. In this paper, we proposed a routing protocol adaptive to the QoS at the network layer. Therefore, a variant of the RPAR protocol was proposed and we called: Greedy Realtime Power Aware Routing (GRPAR), to ensure an optimal quality of service. Simulation results showed that GRPAR improves the performance compared to RPAR in terms of end-to-end delay, packets delivery ratio and energy conservation.

A New Energy-Efficient Hybrid and Clustering Routing for Wireless Sensor Networks

Wireless sensor networks (WSN) are anticipated to play major role in the development and deployment of many emerging technological solutions such as Internet of Things (IoT) and smart places. The energy-efficiency issue has been widely investigated in WSNs, it is still in its infancy, creating hurdles for the further evolution of WSNs. To improve the energy efficiency, many power-aware routing protocols have been investigated. One of the most effective solutions is the hybrid distributed clustering routing approach. Although this scheme has shown superiority against it counterparts, it exhibits more energy consumption in the long-range transmission between the cluster heads (CHs) and the BS. Thus, in an attempt to solve this problem, this paper proposes two energy-efficient techniques that focus on the data transmission between CHs and the BS and the energy consumed during this operation. In the first proposed technique, the CHs deliver data to the BS indirectly via one regular sensor, namely anchor. On the other hand, CHs in the second technique send data to the BS via multiple regular sensors. By virtue of the proposed mechanism, we investigate a new data transmission approach between different objects, including anchors, CHs and BSs that affect the energy efficiency. Intensive simulation experiments show that the proposed mechanisms are more energy-efficient.

Achieving energy efficiency in data centers with a performance-guaranteed power aware routing

Nowadays, data centers are designed to offer the highest performance in case of high traffic load and peak utilisation of the network. However, in a realistic data center environment, the peak capacity of the network is rarely reached and the average utilisation of devices varies between 5% and 25% which results into a huge loss of energy since most of the time links and servers are idle or under-utilized. The high impact of this wasted power on environmental effects, energy needs and electricity costs raised the concerns to seek for an efficient solution to make data centers more power effective while keeping the desired quality of service. In this paper, we propose a power-aware routing algorithm that saves a considerable amount of energy with a negligible trade-off on the performance of the network and a guaranteed reliability of the system. The key idea is to keep active only the vital and critical nodes participating in the communication traffic and ensuring the reliability while the unneeded devices are turned-off. Vital nodes between clusters (parts of the network) are calculated only once during the initialization of the system and consequently used with a constant time complexity. Besides its short computation time, our routing algorithm guarantees over 50% of energy saving by maintaining the minimum number of needed devices and over 20% when adding backup routes. This power efficiency is accompanied by a guaranteed performance and reliability against failures.

Power Aware Routing in Mobile Ad Hoc Networks by using Power Aware Matrices

Power Aware Routing in Mobile Ad Hoc Networks by using Power Aware Matrices

Analyse the Performance Metric of Power Aware Routing in Mobile AdHoc Networks

Analyse the Performance Metric of Power Aware Routing in Mobile AdHoc Networks

A Multi Criterion Fuzzy based Energy Efficient Routing Protocol for Ad hoc Networks

AbstractThe routing protocol for an ad hoc network should be efficient in utilizing the available resources to prolong the network lifetime. A Multi Criterion Fuzzy based Energy Efficient Routing Protocol (MCFEER) for Ad hoc Networks selects the path on constraints like bandwidth, battery life, hop count and buffer occupancy. In the route discovery phase, fuzzy system is applied for optimal route selection by destination node leading to successful data transmission. Multiple stable paths are preserved in route cache for usage during the route maintenance phase. The results are competitive when compared with Power aware Energy Efficient Routing (PEER) protocol using standard metrics, which ensures better network quality and efficiency.

PTNet: An efficient and green data center network

In recent years, data centers have witnessed an exponential growth for hosting hundreds of thousands of servers as well as to accommodating a very large demand for resources. To fulfill the required level of demand, some approaches tackled network aspects so to host a huge number of servers while others focused on delivering rapid services to the clients by minimizing the path length between any two servers. In general, network devices are often designed to achieve 1:1 oversubscription. Alternatively, in a realistic data center environment, the average utilization of a network could vary between 5% and 25%, and thus the energy consumed by idle devices is wasted. This paper proposes a new parameterizable data center topology, called PTNet. PTNet offers a gradual scalability that interconnects small to large networks covering different ranges of sizes. This new interconnection network provides also a small path length between any two servers even in large sized data centers. PTNet does not only reduce path length and latency, it also uses a power-aware routing algorithm which saves up to 40% of energy with an acceptable computation time. In comparison to existing solutions (e.g. Flatnet, BCube, DCell and Fat-tree), PTNet shows substantial improvements in terms of capacity, robustness, cost-effectiveness and power efficiency: this improvement reaches up to 50% in some cases.

A Survey on Secure and Power Aware Routing Protocols in Wireless Sensor Networks

A Survey on Secure and Power Aware Routing Protocols in Wireless Sensor Networks

Multi-constraint multi-objective QoS aware routing heuristics for query driven sensor networks using fuzzy soft sets

In this paper, a fuzzy based distributed power aware routing scheme considering both energy and bandwidth constraints, especially for query driven applications in the asynchronous duty-cycled wireless sensor networks are devised. The proposed multi-constraint, multi-objective routing optimization approach under strict resource constraints guarantees reliability and fast data delivery along with efficient power management in spite of unreliable wireless links and limited power supply. In query driven applications, the request from the sink to the individual sensor node will be a broadcast message, whereas the individual sensor nodes replies back to sink as unicast messages. In the proposed work, the fuzzy approach and “A Star” algorithm are utilized for satisfying energy and bandwidth constraints to route the broadcast messages of the sink while querying all the sensor nodes in the network. Every node will be provided with a guidance list, which is used to decide the next best neighbor node with good route quality for forwarding the received multi-hop broadcast messages. The route quality of the every node is estimated with fuzzy rules based on the network parameters such as maximum remaining energy, minimum traffic load and better link quality to increase the network lifetime. The provision of overhearing the broadcast messages and acknowledgements within the transmission range minimizes the effort to search for the active time of nodes while routing the broadcast messages with asynchronous scheduling. Further, in the proposed work only the time slot of its nearest neighbor relay node (to which packets are to be forwarded) is learnt to reduce the number of message transmissions in the network. For the unicast message replies, the fuzzy membership function is modified and devised based on the routing metrics such as higher residual energy, minimum traffic loads and minimum hop count under energy and bandwidth constraints. Also, the multi-hop heuristic routing algorithm called Nearest Neighbor Tree is effectively used to reduce the number of neighbors in the guidance list that are elected for forwarding. This helps to increase the individual sensor node’s lifetime, thereby maximizes the network lifetime and guarantees increased network throughput. The simulation results show that the proposed technique reduces repeated transmissions, decreases the number of transmissions, shortens the active time of the sensor nodes and increases the network lifetime for query driven sensor network applications invariant to total the number of sensor nodes and sinks in the network. The proposed algorithm is tested in a small test bed of sensor network with ten nodes that monitors the room temperature.

PALS: Saving Network Power With Low Overhead to ISPs and Applications

Power saving in the network infrastructure has received great attention in recent years. Power-aware traffic management is proposed in many works, in which a subset of routers/links are preferentially used to carry traffic while other links are activated only when traffic load is high. However, it remains challenging how to minimize the overhead to both ISPs and applications, which is important to the successful deployment of power-aware traffic management in a real network. This paper presents PALS, a new Power-Aware Link State routing based traffic management protocol. Compared with previous solutions, PALS remarkably reduces the overheads to ISPs and applications by the following innovations. First, PALS minimizes the forwarding table expansion due to dynamic power-aware routing, by using destination based routing instead of pairwise routing (e.g., MPLS). Second, PALS limits packet reordering for applications, by never splitting traffic between an IE (ingress-egress) router pair to multiple paths. Third, PALS significantly reduces the computation complexity of the power-aware routing algorithm, by running a simple path selection algorithm at each ingress router with the knowledge of local traffic information as well as global link utilization, which are much easier to obtain than global traffic matrix required by the state-of-the-art solutions (e.g., Zhang , IEEE ICNP 2010). Extensive simulations and testbed experiments show that, although bearing the simplicities to minimize the overhead, PALS saves satisfactory network power, with quick response to traffic variance and negligible impact on the packet delivery performance for applications.

Dynamic and Secure Joint Routing and Charging Scheme with Mobile Power Back Ferry Nodes in Mobile Adhoc Networks

Recent introduction of hybrid architectures in Mobile Adhoc NETworks (MANETs) made researchers to concentrate on routing techniques to prolong the network lifetime with improved performance and scalability. Major research activity has been carried out to explore and improve constrained lifespan of the network by proposing on - demand power aware routing protocols. However, these protocols try to increase the network life time but doesn’t guarantee a network remain operational forever. Charging of premature failure nodes which were frequently used as relying nodes is essential to prolong network lifespan. Therefore, to improve network connectivity and lifespan, it’s essential to charge energy drained nodes based on their expected lifetime. Hence, we propose a dynamic and secure routing cum energy recharging scheme using Mobile Power Back Ferry Nodes (MPBF) to recharge energy drained nodes. Consumption of energy from the MPBF nodes affords a most trustworthy energy supply than deriving energy from other sources. This approach retains the node energy to maximum time with improved battery life by selecting a gateway based on link weight age. Secure Source- Based Loose Synchronization (SOBAS) protocol is used for authenticated power transfer. The total number of MPBF nodes required for the optimum energy conservation is determined by the target detection mechanism assigned by the Secured Sink Trail (SST). Using this joint methodology, the network lifetime and percentage of energy consumption of mobile nodes under two different scenarios (a) Variable node velocity and network traffic with fixed node density (b) Variable node density and node velocity with fixed network traffic are analyzed. We evaluate the proposed scheme performance through NS2 simulations. The results show that the proposed scheme can retain the network lifetime for a longer duration. Its performance is compared with power aware and ACO based Dynamic Power Control and load balanced energy efficient routing protocols under different QoS scenarios.

An Efficient Position based Power Aware Routing Algorithm in Mobile Ad-hoc Networks

An Efficient Position based Power Aware Routing Algorithm in Mobile Ad-hoc Networks