Residual Battery Power Research Articles

A technique to improve network lifetime in mobile ad hoc networks

SUMMARYEnergy is an important issue in mobile ad hoc networks (MANETs), and different energy‐aware routing mechanisms have been proposed to minimize the energy consumption in MANETs. Most of the energy‐aware routing schemes reported in the literature have considered only the residual battery capacity as the cost metric in computing a path. In this paper, we have proposed, an energy‐aware routing technique which considers the following parameters: (i) a cost metric, which is a function of residual battery power and energy consumption rate of participating nodes in path computation; (ii) a variable transmission power technique for transmitting data packets; and (iii) To minimize the over‐utilization of participating nodes, a limit is set on the number of paths that can be established to a destination through a participating node. The proposed scheme is simulated using Qualnet 4.5 simulator, and compared with Ad hoc On‐Demand Distance Vector (AODV) and Lifetime Enhancement Routing (LER). We observed that the proposed scheme performs better in terms of network lifetime and energy consumption. Copyright © 2014 John Wiley & Sons, Ltd.

Energy Aware Secure Routing for Wireless Ad Hoc Networks

ABSTRACTIn this paper, we present a clustering-based energy aware secure routing protocol that computes trustworthy and energy efficient secure routes for wireless ad hoc networks (WANETs). Clustering in ad hoc networking paradigm is very useful for achieving scalability and robustness as it helps to save the bandwidth, to take simpler routing decisions, thus results in decreased energy dissipation of the network. WANETs are often deployed in such places where recharge or replace of energy sources is difficult. Further, unpredicted mobility and quasi-static nature of nodes and dynamic network topology yield a serious need for battery awareness during routing. In light of this, we first provide a definition of network lifetime based on application-specific criteria. Also a mathematical model for calculating residual battery power has been framed to propose an energy aware routing protocol. Trust-based scheme is used to assure secure end-to-end delivery of packets in the network. Extensive simulation has been carried out to show the efficacy of the proposed protocol to prolong the network lifetime.

Power Consumption Characteristics of Autonomous Decentralized Clustering Based on Local Interaction

Mobile ad hoc networks (MANETs) consist of mobile terminals that directly connect with one another to communicate without a network infrastructure, such as base stations and/or access points of wireless local area networks (LANs) connected to wired backbone networks. Large-scale disasters such as tsunamis and earthquakes can cause serious damage to life, property as well as any network infrastructure. However, MANETs can function even after severe disasters have destroyed regular network infrastructure. We have proposed an autonomous decentralized structure formation technology based on local interaction, and have applied it to implement autonomous decentralized clustering on MANETs. This method is known to configure clusters that reflect the network condition, such as residual battery power and the degree of each node. However, the effect of clusters that reflect the network condition has not been evaluated. In this study, we configure clusters using our method, the back-diffusion method, and a bio-inspired method, which is a kind of autonomous decentralized clustering that cannot reflect the network condition. We also clarify the importance of clustering that reflects the network condition, with regard to power consumption and data transfer efficiency.

Cross Layer Preemptive Route Repair Scheme for MANET

The challenge of mobile adhoc network (MANET) is to keep the path active for long time. Since the path breaks due to node movement and limited battery power. The route is repaired and discovered only after a path breaks in existing routing protocols. Detection of route break and establishment of a new route insisted a high cost on the network. Preemptive route repair can be an alternative. It allows a routing algorithm to maintain connectivity by switching to a new path before a path break. In this paper, ‘Route discovery by cross layer routing protocol ( RDCLRP)’ is proposed. RDCLRP is modification of AODV. RDCLRP is a preemptive route repair routing protocol using cross layer approach. A route is considered to break when the node is moving towards out of transmission range or battery power is going to zero. When a path is about to break, a warning is broadcast showing the possibility of disconnection. A route is discovered in advance before route break to avoid disconnection. The performance of proposed algorithm is investigated for change in traffic. Simulations are run on qualnet 5.0. Proposed algorithm shows improvement compared to an AODV. Results illustrated that the route breakage is reduced by an average of 91%, throughput is improved by 30.62%, delay is reduced by 24.1%, received packets are increased by 24.3% and residual battery power is increased by 16.05%.

An Update based Energy-Efficient Reactive Routing Protocol for Mobile Ad Hoc Networks

Low cost energy-efficient (power based) routing protocols of mobile ad hoc networks (MANETs) increase the lifetime of static networks by using received signal strength (RSS) and battery power status (PS). They require GPS service to find the exact location of mobile nodes. The GPS devices themselves consume power because they need excessive updates to find the stationary nodes for efficient routing. To overcome this, RSS is being used as a metric, followed by, residual battery power. The recent protocols, based on these concepts, provide energy efficient routes during the route discovery phase only. Topological changes make these routes weak in due course of time. To update routes, HELLO process can be used, which however creates unnecessary overhead, delay and consumes power. Hence, these protocols do not update the routes. We propose an energy-efficient reactive routing protocol that uses the RSS and PS of mobile nodes. Proposed Link Failure Prediction (LFP) algorithm uses the link-layer feedback system to update active routes. We use ns2 for simulation of the proposed algorithm. Comparing the results of proposed scheme and existing scheme, in terms of energy consumption, link failure probability, and retransmission of packets, we observe that the proposed scheme outperforms the existing one.

ANFIS and agent based bandwidth and delay aware anycast routing in mobile ad hoc networks

Anycast is a point to point flow of packets for obtaining services or sending data to one of a multitude of destinations that share one address. To meet needs of real time and multimedia applications, anycast routing in Mobile Ad hoc Networks (MANETs) must provide faster service with better Quality of Service (QoS). This paper proposes an Adaptive Neuro-Fuzzy Inference System (ANFIS) based multiple QoS constrained anycast routing in MANETs by using a set of static and mobile agents. Three types of agents are used in the scheme: static anycast manager agent, static optimization agent, and mobile anycast route creation agent. The scheme operates in the following steps. (1) Optimization agent at the client optimizes membership functions for bandwidth, link delay and packet loss rate to develop Fuzzy Inference System (FIS) by using ANFIS. (2) Anycast route creation agents are employed by the client to explore multiple paths from source (client) to all anycast members (servers) through intermediate nodes. These agents gather intermediate node's information such as available bandwidth, link delay, residual battery power, and stability of anycast servers. The information is passed on to the client. (3) Anycast manager agent at the client performs finding QoS factor by using optimized FIS for every path, and selects QoS anycast path based on QoS and server stability factor, and (4) Anycast route creation agent is also employed for maintaining the QoS path in the event of node/link failures. The simulation results demonstrate reduction in end-to-end delay and control overhead, improvement in packet delivery ratio and path success ratio, as compared to shortcut tree based anycast routing (SATR) in MANETs.

Performance Analysis of Route Discovery by Cross Layer Routing Protocol- RDCLRP

Wired and wireless network is based on the TCP / IP architecture but it is not sufficient to cope with the dynamics of the MANET. Cross layer design can be an alternative architecture for MANET. Frequent route break is one of the major problems of mobile adhoc network (MANET). Path breaks due to less available battery power and mobility of nodes. Most of the battery power is consumed in flooding of control packets. A key challenge in the design of efficient routing protocol is to reduce link breakage and flooding of control packets. Route breakage can be reduced if the possibility of route breakage is predicted and a handoff is done without drop of data packets. If route breakage is reduced, the more battery power will be available with nodes. In turn it reduces the possibility of route breakage and the possibility of flooding. This is a cumulative effect. So a novel preemptive route repair algorithm is proposed named as RDCLRP- Route discovery by cross layer routing protocol to reduce frequency of control packet flooding and route breakage. Three variants of RDCLRP and their results are illustrated. In this paper, the impact of the number of nodes on performance of RDCLRP are investigated and analyzed. The results show 55.6% reduction in link breakage, 14.7% improvement in residual battery power and an average of 6.7% increase in throughput compared to basic AODV.

A Novel Routing Scheme for Mobile Ad Hoc Network

Mobile Ad hoc Network (MANET) is a collection of mobile users without any support of fixed infrastructure. The nodes in these networks have several constraints such as transmission power, bandwidth and processing capability. In addition to it an important parameter of interest is the residual battery power of the nodes. Conventional routing schemes do not take this aspect into consideration. Therefore this paper proposes a routing strategy that takes this aspect into consideration by modifying the Route Request (RREQ) packet of the Ad hoc On demand Distance Vector (AODV) routing protocol. The protocol chooses a threshold below which a node is not allowed to relay data/control packets. The results show a remarkable improvement in the value of Packet Delivery Ratio (PDR), throughput and at the same time the network lifetime is not affected.

A Self-Optimizing Scheme for Energy Balanced Routing in Wireless Sensor Networks Using SensorAnt

Planning of energy-efficient protocols is critical for Wireless Sensor Networks (WSNs) because of the constraints on the sensor nodes' energy. The routing protocol should be able to provide uniform power dissipation during transmission to the sink node. In this paper, we present a self-optimization scheme for WSNs which is able to utilize and optimize the sensor nodes' resources, especially the batteries, to achieve balanced energy consumption across all sensor nodes. This method is based on the Ant Colony Optimization (ACO) metaheuristic which is adopted to enhance the paths with the best quality function. The assessment of this function depends on multi-criteria metrics such as the minimum residual battery power, hop count and average energy of both route and network. This method also distributes the traffic load of sensor nodes throughout the WSN leading to reduced energy usage, extended network life time and reduced packet loss. Simulation results show that our scheme performs much better than the Energy Efficient Ant-Based Routing (EEABR) in terms of energy consumption, balancing and efficiency.

Energy-aware Source Routing Protocol for Lifetime Maximization in Mobile Ad Hoc Networks

In this paper, we propose an energy-aware source routing protocol for maximizing a network lifetime in mobile ad hoc network environments. The proposed routing protocol is based on the source routing and chooses a path that maximize the path lifetime, by considering both transmit/receive power consumption and residual battery power in the mobile nodes from the perspective of source-destination end-to-end. This paper proposes a new routing cost and designs a new routing protocol for minimizing the control packet overhead occurred during the route discovery. Simulation results show that the proposed scheme has similar performances to the conventional routing schemes in terms of the number of transmission hops, transmission rate and total energy consumption, but achieves the performance improvement of 20 percent with respect to the lifetime.

Energy Saving and Survival Routing Protocol for Mobile Ad Hoc Networks

In this paper we propose a method to enhance the life time as well as improve the performance of the mobile ad hoc networks (MANET). Since MANET consists of devices that run on batteries, having limited amount of energy and due to the self-configuring and dynamic change of topology, all operations are performed by the node itself. More ever if any new technology and advancement are introduced in the MANET then the overhead of computation will also be performed by the individual nodes. All these computation will consume a lot of battery energy during the process of communication between sources to destination. In such scenario, we have considered DSR routing protocol as our base protocol and we attempt to make some modification on it which acts into an efficient energy saving and survival DSR (ESSDSR). We have considered DSR because it is one of the protocol which does not take energy into account and once the dedicated path is established between source to destination then it will keep sending through that path until the link is broken due to any of the intermediate node dies out of energy or mobility of the node away from its neighbor nodes and so it is considered as one of the unconventional routing protocol. Whereas ESSDSR acts not only as an energy efficient routing protocol but also shows an energy survival instinct. It establishes a path from source to destination where packet transmission can be sent for a longer period of time through the nodes having high level of residual battery power. It also informs the source node if any node has low battery energy, so that a new path can be discovered for the same destination prior the path get disconnected and data transmission get affected. And so the number of packet drops and retransmission can be reduced. Hence we can conclude that our proposed method enhances the performance of the networks as well as enhances the network life time. We have implemented our proposed protocol in ns-2.34 and evaluated the life time of the networks as well as the node's life time has been improved as compare to traditional DSR with a higher ratio.

Identification of Critical Node for the Efficient Performance in Manet

This paper considers a network where nodes are connected randomly and can fail at random times. The critical-node test detects nodes, whose failures are malicious behavior, disconnects or significantly degrades the performance of the network. The critical node is an element, position or control entity whose disruption, is immediately degrades the ability of a force to command, control or effectively conducts combat operations. If a node is critical node, then more attention must be paid to it to avoid its failure or removal of a network. So how to confirm critical nodes in the ad hoc network is the premise to predict the network partition. A critical node is the most important node within the entity of a network. This paper suggests methods that find the critical nodes of a network based on residual battery power, reliability, bandwidth, availability and service traffic type. The metrics for evaluation has been considered as packet delivery ratio, end-to-end delay and throughput.

An Optimized Energy Consumption Algorithm for Manet

Power-optimization is an essential issue for all types of mobile hosts in the network. This paper proposes a new approach for optimizing power consumption in mobile ad hoc networks (MANETs) that consents to maximum life time of mobile hosts while transmitting a packet from the source to destination. It can be implemented by avoiding nodes which has a minimum residual battery power. The proposed approach is implemented by introducing a threshold value on each node and transmitting the equal length of packet on the route. This threshold indicates whether the node should be included in making routing decisions for a packet and length of the packet considered for equal power consumption. Extensive simulation results are presented to verify the effectiveness of the proposed approach.

( k , r )-Dominating set-based, weighted and adaptive clustering algorithms for mobile ad hoc networks

The creation of stable, scalable and adaptive clusters with good performance, faster convergence rate and with minimal overhead is a challenging task in mobile ad hoc networks (MANETs). This study proposes two clustering techniques for MANETs, which are (k, r)-dominating set-based, weighted and adaptive to changes in the network topology. The set of dominating nodes functions as the clusterheads. The scenario-based clustering algorithm for MANETs (SCAM) is a greedy approximation algorithm, whereas the distributed-SCAM (DSCAM) selects the (k, r)-dominating set through a distributed election mechanism. These algorithms achieve variable degree of clusterhead redundancy through the parameter k which contributes to reliability. Similarly, flexibility in creating variable diameter clusters is achieved with the parameter r. To improve the stability of the created clusters, the affiliation of other nodes with the clusterhead is decided based on the quality of the clusterhead, which is a function of connectivity, stability, residual battery power and transmission range. Mechanisms are available for accounting the group mobility and load balancing. The performance of these algorithms are evaluated through simulation and the results show that these algorithms create stable, scalable and load-balanced clusters with relatively less control overhead in comparison with the existing popular algorithms.

QoS Aware Power and Hop Count Constraints Routing Protocol with Mobility Prediction for MANET Using SHORT

A mobile ad hoc network (MANET) is composed of mobile nodes, which do not have any fixed wired communication infrastructure. This paper proposes a protocol called “Delay, Jitter, Bandwidth, Cost, Power and Hop count Constraints Routing Protocol with Mobility Prediction for Mobile Ad hoc Network using Self Healing and Optimizing Routing Technique (QPHMP-SHORT)”. It is a multiple constraints routing protocol with self healing technique for route discovery to select a best routing path among multiple paths between a source and a destination as to increase packet delivery ratio, reliability and efficiency of mobile communication. QPHMP-SHORT considers the cost incurred in channel acquisition and the incremental cost proportional to the size of the packet. It collects the residual battery power of each node for each path; selects multiple paths, which have nodes with good battery power for transmission to satisfy the power constraint. QPHMP-SHORT uses Self-Healing and Optimizing Routing Technique (SHORT) to select a shortest best path among multiple selected paths by applying hops count constraint. It also uses the mobility prediction formula to find the stability of a link between two nodes.

Application oriented connected dominating set-based cluster formation in wireless sensor networks

AbstractClustering is a fundamental mechanism used in the design of Wireless Sensor Network (WSN) protocols. The performance of WSNs can be improved by selecting the most suitable nodes to form a stable backbone structure with guaranteed network coverage. This paper proposes a base station-controlled centralized algorithm for static sensor networks and a distributed, weighted algorithm for dynamic sensor networks. The solutions are based on a (k,r)-Connected Dominating Set, which is suitable for cluster-based hierarchical routing. The clusterhead redundancy parameterkimproves reliability, the multi-hop parameterraddresses the scalability issue and the combined weight metric improves the network lifespan and reduces the number of re-affiliations. To create a stable and efficient backbone structure, the backbone sensor nodes are selected based on quality, which is a function of the residual battery power, node degree, transmission range, and mobility of the sensor nodes. Simulation experiments are conducted to evaluate the performance of both the algorithms in terms of the number of elements in the backbone structure, re-affiliation frequency, load balancing, network lifespan, and the power dissipation. The results establish the potential of these algorithms for use in WSNs.

Scenario-Based Cluster Formation and Management in Mobile Ad Hoc Networks

This article proposes a scenario-based algorithm for cluster formation and management in mobile ad hoc networks. Depending on the application a centralized or distributed algorithm based on (k, r) –Dominating Set is used for the selection of clusterheads and gateway nodes. Here k is the minimum number of clusterheads per node in the network and r is the maximum number of hops between the node and the clusterhead. The non-clusterhead node can select the most qualified dominating node as its clusterhead from among the k dominating nodes. The quality of the clusterhead is a function of various metrics, which include connectivity, stability and residual battery power. Long-term service as clusterhead depletes their energy, causing them to drop out of the network. Similarly, the clusterhead with relatively high mobility than its neighbors leads to frequent clusterhead election process. This perturbs the stability of the network and adversely affects the network performance.

Power aware multiple QoS constraints routing protocol with mobility prediction for MANET

A mobile ad hoc network (MANET) is composed of mobile nodes, which do not have any fixed wired communication infrastructure. The protocol called 'Power aware Multiple Quality of Service (QoS) constraints Routing Protocol with Mobility Prediction (PMQRPMP)' is the extension of the existing protocol called 'Multiple QoS constraints Routing Protocol with Mobile Predicting (MQRPMP)'. It adds a power constraint along with QoS constraints mentioned in MQRPMP to select a best routing path among multiple paths between a source and a destination as to increase packet delivery ratio (PDR), reliability and efficiency of mobile communication. It collects the residual battery power of each node for each path; selects a path, which has nodes with good battery power for transmission to satisfy the power constraint. It uses the mobility prediction formula to find the stability of a link between two nodes.

State-of-Charge Estimation for Electric Scooters by Using Learning Mechanisms

Because of its nonlinear discharge characteristics, the residual electric energy of a battery remains an open problem. As a result, the reliability of electric scooters or electric vehicles is lacking. To alleviate this problem and enhance the capabilities of present electric scooters or vehicles, we propose a state-of-charge learning system that can provide more accurate information about the state-of-charge or residual capacity when a battery discharges under dynamic conditions. The proposed system is implemented by learning controllers, fuzzy neural networks, and cerebellar-model-articulation-controller networks, which can estimate and predict nonlinear characteristics of the energy consumption of a battery. With this learning system, not only could it give an estimate of how much residual battery power is available, but it also could provide users with more useful information such as an estimated traveling distance at a given speed and the maximum allowable speed to guarantee safe arrival at the destination

DEAR: A Device and Energy Aware Routing protocol for heterogeneous ad hoc networks

Energy efficient routing in ad hoc networks has been the subject of intensive study in recent years. Most work has been focused on residual battery power related cost metrics for a homogeneous ad hoc network, where all the nodes are considered identical in terms of functioning and available resources. In this paper, we propose a Device and Energy Aware Routing protocol (DEAR) for a heterogeneous wireless ad hoc network where there exist two different classes of nodes, battery-powered nodes and externally powered nodes. By embedding both the energy and the device-type awareness into the routing protocol, we force the externally powered nodes to forward more traffic and perform more routing functions than a battery-powered node. The simulation results show that DEAR protocol achieves better system lifetime when compared to the conventional energy efficient routing protocols.