Residual Battery Power Research Articles

A Novel Fuzzy Based Beluga Whale Optimization for Enhancing Link Stability and Optimal Route discovery in MANET

The networking field plays a major role and developed significantly over the past decades. The identification of best route in Mobile Ad hoc Networks (MANETs) is a complex problem in the multipath routing method. Besides, multipath discovery is regarded as the other difficult task for improving the existence of the network. Through optimal route discovery, the routing protocol considers several parameters like link failures, topological variations, obstacles, and extended power. In this paper, based on optimal route discovery, a novel Fuzzy Beluga Whale Optimization (FBWO) is proposed for presenting effective routing and enhanced link stability. The Beluga Whale Optimization (BWO) algorithm determines multiple routes in the network for communicating data packets to their destination. However, the discovered routes may be susceptible to link failures due to the complete energy exhaustion of nodes during continuous data transmission. Therefore, the stability of links is assured by evaluating link stability indicators namely probabilistic link reliable time, link expiration time, residual battery power, link received signal strength, and link packet error rate. Moreover, optimal routes in the network are established using a fuzzy rule system by adopting fuzzy rules. Thus, the proposed FBWO approach maximizes the overall performance of the network by establishing optimal routes to broadcast packets along with enhanced link stability and signal strength. The experimental results manifest the FBWO model and achieve superior accuracy in terms of all measures than other existing methods.

Contract-based scheme for computational resource allocation in cloud-assisted parked vehicular edge computing

Having shown promising performance with high flexibility and efficiency in vehicular edge computing (VEC) network, the parked vehicles (PVs) received an increasing number of attentions in recent years. However, PVs’ residual battery power restricts their running time. In addition, there is still no alternate resource pool for the PVs to cope with the emergencies in the previous VEC framework. To alleviate these problems, we model a cloud-assisted parked vehicular edge computing (PVEC) framework, in which the PVs are classified based on their residual battery power. PVs corporate with the cloud servers (CSs) for the computational resources provision. In addition, we formulate the utilities of the service provider (SP) and PVs and design a contract-based resource allocation problem for the maximization of the SP’s utility. Considering that it is intractable to solve the optimization problem directly, the primal problem is simplified and decoupled into two sub-problems. To design the optimal contracts, we solve the sub-problems by Lagrangian multiplier method and dual function. Simulation results prove that the utilities of PVs can reach to the maximum when they choose the contract corresponding to their types. In addition, the simulation results illustrate the superiority of proposed scheme over previous schemes in improving the utilities of the SP and social welfare.

Energy and performance-aware balancing in establishing an emergency wireless communication network

In a disaster situation, natural or human-made disasters, establishing an emergency wireless network in these circumstances is very important to save lives. It is imperative to ensure the network’s ability to connect all people in the disaster area, with an optimum capacity to handle the information traffic while consuming less power. These factors are critical when designing such a network. The clustering technique has improved wireless network performance in throughput and power consumption. However, there are still difficulties when applying this technique to such a situation, essentially selecting cluster heads (CHs) and connecting them to the nearby functional base station (BS). This paper devises an algorithm (CCaCH/SCH-S) to create clusters and select CHs appropriately. Once clusters are created and CHs are selected, the connection between CHs and the relay station (RN) is established using long-range links. CHs are responsible for aggregating data from their members and forward the information to RN. Each cluster consists of a main-cluster with its CH and a sub-cluster with its sub-cluster head (SCH); both use short-range links. In this approach, the selection of CH and SCH was determined by the residual battery power. The proposed approach was investigated against the system capacity, power consumption, and the required time to establish communication to the functional areas. Different network parameters and clustering approaches were simulated using MATLAB. The proposed approach minimized the users’ equipment (UEs) power consumption by 5.9% comparing to a multi-hop approach and 9.4% compared to the single-hop approach. Furthermore, the proposed approach improved the network capacity up to 7% and 32.6% better than multi-hop and single-hop approaches, respectively.

DESR: Differential evolutionary secure routing protocol for mobile ad-hoc networks

Mobile ad-hoc network is an infrastructure-less spontaneously formed wireless environment that is deployed without any centralised unit. All the nodes in this kind of network are assumed to be trustworthy but in the real scenario, a few can be malicious and, therefore, secure and reliable route for data transmission is always a matter of question. This paper presents effective routing solution for mobile ad-hoc networks with differential evolution. The proposed algorithm is termed as Differential Evolution Secure Routing protocol for mobile ad-hoc networks (DESR) with an effective fitness function. The component metrics for the fitness function are the trust factor, residual battery power, and node stability which intend to select most promising routes through the proposed DESR algorithm. The simulation is carried out in various scenarios to evaluate the performance of the differential evolutionary secure routing algorithm with packet delivery ratio, average end-to-end delay, and throughput. Results are compared with two algorithms PSO and TSR.

A new energy consumption technique for mobile ad hoc networks

A dynamic temporary network is created through wireless mobile nodes without the need for considerable infrastructure as well as a central manager. In a mobile ad hoc network, routing protocols allow a mobile for transmission and receiving packets. In the last decade, many variants have come up for the AODV. A minimum number of hop counts are chosen for enhancing routing protocols to include additional factors that can have an impact on path selections. As the distance between each node grows, the transmission power also rises accordingly. Hence, this impacts the network’s entire performance and the most important feature is the quality of service. Most of the traditional routing protocols include energy consumption levels of the nodes and various parameters, like residual battery power, consumption of energy per packet and energy needed per transmission. A new technique is proposed in this paper to enhance the routing efficiency by making use of lion optimization algorithm after identifying all possible paths in the network. This technique not only enhances the energy efficiency of each node but also the performance metrics.

Correlation analysis and statistical characterization of heterogeneous sensor data in environmental sensor networks

In wireless sensor networks, missing data is an inevitable phenomenon due to the inherent limitations of the sensor nodes, such as battery power constraints of nodes, missing communication links, bandwidth limitation, etc. Missing data adversely affects the quality of data received by the sink node. Since the data acquired by the sensor nodes in a multimodal environmental sensor network are spatially and temporally correlated, these correlations play a pivotal role in missing data recovery and data prediction. This paper proposes an analytical framework to characterize the correlation between two different pairs of modalities in an environmental sensor network using a set of classical and robust measures of correlation coefficient estimates. Monte Carlo simulation is performed to approximately model sensed environmental data characteristics. Three classical estimates (Pearson’s correlation coefficient, Spearman’s rank correlation coefficient, and Kendall’s-tau rank correlation coefficient), and four robust estimates of correlation coefficients are used to establish the correlation between different pairs of sensed modalities in the data characteristics. The efficacy of these estimates is obtained using the two performance metrics, mean-squared error (MSE) and relative estimation efficiency (RE). Stationarity analysis among the acquired environmental variables shed light upon the best estimates of the correlation coefficient, which could be used for prediction of temperature modality in a known region of slope/stationarity in the data characteristics. The robustness of the correlation coefficient estimates in the presence of outliers present in the data due to noise, errors, low residual battery power of sensor nodes, etc. is also investigated.

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.

CABMD: A new clustering algorithm based on membership degree of node for mobile ad hoc networks

In this paper, we propose clustering algorithm based on the membership degree of node for mobile ad hoc networks (CABMD). The aim of CABMD focuses on cluster-head election and cluster formation. The cluster - head election is based on quality of node that is calculated by a combination of characteristics such as connectivity, energy and mobility of nodes. The node has the best quality among all of the nodes is elected as first cluster-head and forms its cluster based on the membership degree of the node that is related to its quality and distance between the cluster-head and node. This procedure follows for election of next cluster-heads and formation of their clusters until all of the nodes in the network are elected as cluster-heads or cluster-members. This study uses the characteristics of CEMCA algorithm and tries to improve its performance by a new method. We apply membership degree for clustering, so that the performance of clusters in the network will be improved. We have simulated our algorithm (CABMD) by NS-2 in order to measure the performance of it. Our results will be compared with the Weighted Clustering Algorithm (WCA), connectivity, energy and mobility driven weighted clustering algorithm (CEMCA) and connectivity, residual battery power, average mobility, and distance algorithm (CBMD).

Ant-based self-healing routing for enhancing lifetime of wireless sensor networks

In self-healing routing (SHR), receivers autonomously decide whether to forward the packet using only knowledge of their hop distances of the destination but neither energy estimation nor residual battery power is analysed. Hence, failure may occur on the intermediate nodes causing the data loss in transmission. To overcome the disadvantages of SHR and enhance the lifetime of WSN, self-healing routing using ant colony optimisation (ACO) is proposed. In our proposed solution, the RREQ and RREP procedures are executed by the forward ant (FANT) and backward ant (BANT) respectively using ACO technique. Source node broadcast a FANT to the neighbouring nodes along the destination which collects the hop distance and residual energy of each node. The next hop is selected based on the probability of pheromone. On reaching the destination, a BANT is transmitted through the reverse path. The collected hop distance and residual energy of each node by the BANT is analysed at the source. By simulation results, we show that the ant-based self-healing routing reduces the delay and energy consumption while increasing the packet delivery ratio.

Ant-based self-healing routing for enhancing lifetime of wireless sensor networks

In self-healing routing (SHR), receivers autonomously decide whether to forward the packet using only knowledge of their hop distances of the destination but neither energy estimation nor residual battery power is analysed. Hence, failure may occur on the intermediate nodes causing the data loss in transmission. To overcome the disadvantages of SHR and enhance the lifetime of WSN, self-healing routing using ant colony optimisation (ACO) is proposed. In our proposed solution, the RREQ and RREP procedures are executed by the forward ant (FANT) and backward ant (BANT) respectively using ACO technique. Source node broadcast a FANT to the neighbouring nodes along the destination which collects the hop distance and residual energy of each node. The next hop is selected based on the probability of pheromone. On reaching the destination, a BANT is transmitted through the reverse path. The collected hop distance and residual energy of each node by the BANT is analysed at the source. By simulation results, we show that the ant-based self-healing routing reduces the delay and energy consumption while increasing the packet delivery ratio.

Enhancing Quality of Service in Heterogeneous Wireless Network using EDLAS

The transmission through different interfaces of the different wireless network is a challenging issue. This paper presents an enhanced dynamic link aggregation scheme (EDLAS), an enhanced technique for the transmission of data through different interfaces present in different wireless networks. The proposed technique uses the existing sequential and parallel DLAS technique by using the fuzzy. The fuzzy system decides whether to transfer data by using sequential or the parallel DLAS depending upon the number of the chunks, user mobility, the number of users, chunk size. The work is implemented using the MATLAB. The simulation results generated using the MATLAB shows the effectiveness of the technique with increased throughput with same residual battery power.

Cluster-based adaptive power control protocol using Hidden Markov Model for Wireless Sensor Networks

ABSTRACTThis paper presents strategies for an efficient and dynamic transmission power control technique, in order to reduce packet drop and hence energy consumption of power-hungry sensor nodes operated in highly non-linear channel conditions of Wireless Sensor Networks. Besides, we also focus to prolong network lifetime and scalability by designing cluster-based network structure. Specifically we consider weight-based clustering approach wherein, minimum significant node is chosen as Cluster Head (CH) which is computed stemmed from the factors distance, remaining residual battery power and received signal strength (RSS). Further, transmission power control schemes to fit into dynamic channel conditions are meticulously implemented using Hidden Markov Model (HMM) where probability transition matrix is formulated based on the observed RSS measurements. Typically, CH estimates initial transmission power of its cluster members (CMs) from RSS using HMM and broadcast this value to its CMs for initialising their power value. Further, if CH finds that there are variations in link quality and RSS of the CMs, it again re-computes and optimises the transmission power level of the nodes using HMM to avoid packet loss due noise interference. We have demonstrated our simulation results to prove that our technique efficiently controls the power levels of sensing nodes to save significant quantity of energy for different sized network.

New threshold-based Relay Selection Algorithm in Dual Hop Cooperative Network

Abstract: Cognitive radio and cooperative communications emerged as networking technologies that solve the radio spectrum scarcity and the fading effects in wireless communications while improving the reliability, the performance and the adaptability of the network. In this work, we are aiming to achieve cooperative diversity via the use of an energy harvesting underlay cognitive radio network operating in decode and forward (DF) relay selection. The selection targets to satisfy the interference threshold and residual battery power conditions by the use of Green relays that permits to enable or disable a relay depending on a comparison between its residual .energy level and the set threshold.

A Device-Centric Scheme for Relay Selection in a Dynamic Network Scenario for 5G Communication

Device-centric architecture is an aspect of fifth generation communication whereby devices/user equipment is able to directly communicate with other devices with minimal involvement by the base station (BS). However, devices that are not within their proximity area communicate with other devices (relay). In this paper, we propose a device-centric scheme for relay selection in a dynamic network scenario. In this scheme, once the communicating devices have reached the maximum distance threshold, they exchange neighbor tables and find common devices (relay) for further communication. In addition, we propose a new relay selection scheme for scenarios, where the devices have more than one device (relay) in common. The proposed relay selection scheme is based on several parameters, including signal-to-noise ratio (SNR), signal-to-interference plus noise ratio, residual battery power, buffer space, and reliability; this provides more reliable and efficient communication. The current relay schemes, including max–min and max–max, are network assisted; the network/BS decides the relay, which increases the load on the BS side. The BS selects relay based on channel state information or SNR, which does not provide efficient or reliable communication. Our proposed device-centric scheme depends less on the BS during relay selection, which reduces network overhead, and the relay selection scheme provides more efficient and reliable communication. A comparison with other relay selection schemes shows that our scheme is 30% more effective in each case.

A multi-criterion fuzzy logic intra-cluster and inter-cluster-based stable cluster head election approach in large scale WSN

Extending the lifetime of wireless sensor networks (WSNs) is a major concern in recent years. The main problem seems in the recent proposed approaches is that these use direct communication among nodes with the rotation of cluster heads (CHs) periodically to distribute energy consumption among various cluster heads (CHs). Energy saving mechanisms based only on metrics related to nodes' residual power cannot be directly applied to find stable CHs. The reason is that a sensor node or a CH having more residual power is willing to accept all requests, because it has enough residual battery power, therefore, much traffic will be injected to that node. In that case, a sharp decay of node's backup battery power. In this research paper, a multi-criterion fuzzy logic intra-cluster and inter-cluster based multi-hop routing protocol is proposed. The simulation results confirm that our proposed approach is more efficient than state-of-the-art approaches.

A multi-criterion fuzzy logic intra-cluster and inter-cluster-based stable cluster head election approach in large scale WSN

Extending the lifetime of wireless sensor networks WSNs is a major concern in recent years. The main problem seems in the recent proposed approaches is that these use direct communication among nodes with the rotation of cluster heads CHs periodically to distribute energy consumption among various cluster heads CHs. Energy saving mechanisms based only on metrics related to nodes' residual power cannot be directly applied to find stable CHs. The reason is that a sensor node or a CH having more residual power is willing to accept all requests, because it has enough residual battery power, therefore, much traffic will be injected to that node. In that case, a sharp decay of node's backup battery power. In this research paper, a multi-criterion fuzzy logic intra-cluster and inter-cluster based multi-hop routing protocol is proposed. The simulation results confirm that our proposed approach is more efficient than state-of-the-art approaches.

Energy-efficient stable routing using QoS monitoring agents in MANET

Abstract In mobile ad hoc network (MANET), the most important issue is to provide a stable and reliable route for the uninterrupted communication. In order to overcome these issues, in this paper, we propose a stable and energy-efficient routing technique. In the proposed method, quality of service (QoS) monitoring agents collect and calculate the link reliability metrics such as link expiration time (LET), probabilistic link reliable time (PLRT), link packet error rate (LPER) and link received signal strength (LRSS). In addition, residual battery power (RBP) is implemented to maintain the energy efficiency in the network. Finally, route selection probability (RSP) is calculated based on these estimated parameters using fuzzy logic. Simulation results show that the proposed routing technique improves the packet delivery ratio and reduces the energy consumption.

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.

Energy Competent Routing Protocol Design in MANET with Real Time Application Provision

With the increase of mobile activities in technological environment, it is a challenge to develop and maintain robust networking system with provision of high connectivity. In this context, Mobile Adhoc Network (MANET) is a feasible solution because it is dynamic in nature and the self-configured nodes of MANET can communicate intelligently in adverse and dynamic mobile situations. Though Adhoc on Demand Distance Vector (AODV) Routing protocol handles the networking issues efficiently, still power and delay efficiency has always been a challenging task in MANET due to the resource constrained nodes which are supplied with limited battery power during the operation in the network. Hence while performing various networking activities; gradually the battery power reduces resulting in delay in processing of packet and forwarding them to the next node during transmission. This causes overall end to end delay in the total transmission. Therefore many researches are still going on in the direction of designing robust and reliable protocols. In this paper the authors have developed a robust and energy efficient routing protocol for MANET with real time support. Their approach is different as it calculates the remaining residual battery power, bounded delay and packet processing rate of the intermediate node before selecting a node to forward the packet in the direction of destination. The cost function calculated using the above three factors along with the condition of congested node is also checked to correctly choose a load balanced path from source to destination. Simulation results show that the proposed protocol performs better than the conventional AODV protocol in terms of better network life time, throughput, delay and packet delivery ratio.

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.