Energy Efficient Routing Algorithm Research Articles

Energy Efficient Routing Algorithm Based on Harmony Search

Under the premise of limited node energy, an efficient and energy-saving wireless sensor network routing algorithm was proposed to prolong the lifetime of overall network. By analysing the operation pattern of wireless sensor network, the energy model and transmission model was introduced, and BTPHS algorithm based on the above two was proposed. BTPHS algorithm divided the network lifetime into 3 periods. According to the characteristics of the energy distribution and energy consumption in different periods of the network, two new node selection strategies were proposed and a new objective function as a reference standard was provided. The adjustment process of the HS algorithm is abandoned, which makes less parameters in proposed routing algorithm. The experiment results indicate that BTPHS algorithm can prolong the lifetime of overall WSN network effectively.

A New Preventive Routing Method Based on Clustering and Location Prediction in the Mobile Internet of Things

In the world of the Internet of Things (IoT), wireless sensor networks (WSNs) are an impressive technology. These networks are extremely resource constrained and require the design of energy-efficient routing techniques. The clustering and location prediction routing method based on multiple mobile sinks (CLRP-MMSs) for the Mobile Internet of Things (MIoT) is presented in this article. Recently, mobile sinks are used in routing more durability and energy saving in WSN. In this work, first, the entire nodes are divided into clusters, and then each cluster selects a cluster head (CH) by calculating the CH choosing function (CHCF). When clustering runs on networks with moving nodes, the possibility of disconnecting the nodes from CH nodes will cause a lot of data loss. It will change the amount of energy and rate of data received, but the amount of wasted energy is reduced by predicting the location and reducing the sink and CH nodes' distance. The simulation results using NS-2 clearly showed that the proposed method improves energy consumption at least 28.12% and increases throughput at least 26.74% compared to energy efficient routing algorithm with mobile sink support and high-available and location-predictive data gathering scheme using mobile sink methods.

Q-Learning-Based Data-Aggregation-Aware Energy-Efficient Routing Protocol for Wireless Sensor Networks

The energy consumption of the routing protocol can affect the lifetime of a wireless sensor network (WSN) because tiny sensor nodes are usually difficult to recharge after they are deployed. Generally, to save energy, data aggregation is used to minimize and/or eliminate data redundancy at each node and reduce the amount of the overall data transmitted in a WSN. Furthermore, energy-efficient routing is widely used to determine the optimal path from the source to the destination, while avoiding the energy-short nodes, to save energy for relaying the sensed data. In most conventional approaches, data aggregation and routing path selection are considered separately. In this study, we consider the degrees of the possible data aggregation of neighbor nodes when a node needs to determine the routing path. We propose a novel Q-learning-based data-aggregation-aware energy-efficient routing algorithm. The proposed algorithm uses reinforcement learning to maximize the rewards, defined in terms of the efficiency of the sensor-type-dependent data aggregation, communication energy and node residual energy, at each sensor node to obtain an optimal path. We used sensor-type-dependent aggregation rewards. Finally, we performed simulations to evaluate the performance of the proposed routing method and compared it with that of the conventional energy-aware routing algorithms. Our results indicate that the proposed protocol can successfully reduce the amount of data and extend the lifetime of the WSN.

Energy-efficient location-based routing algorithms for three dimensional mobile ad hoc networks

Energy-efficient location-based routing algorithms for three dimensional mobile ad hoc networks

Mobile Sink Based Improved Energy Efficient Routing Algorithm Using Cluster Coordinator Node in Wireless Sensor Network

It is imperative to perform energy-effective data transmission over a Wireless Sensor Network (WSN) to maintain the efficacy of the network; the sensor nodes in the network are responsible for relaying the data from the source to the destination node. To this end, a Mobile sink is introduced by the researchers to enhance the transmission ability. Though it is proved to be efficacious still energy consumption of the nodes is higher that in turn affects the reliability of the network. Researchers have developed various methods in which they have used the mobile sink that work in a static method. Thus, a novel approach is designed in which the network is evenly divided into five sections in which sensor nodes are equally distributed. The data transmission occurred through the Cluster Coordinator node (CCO) as they are rechargeable and assist in passing data to the mobile sink in each cluster with high efficacy. The simulation of the model is performed in MATLAB software for different network areas and different radius of sink mobility to evaluate the efficacy of the network in energy consumptions. The comparison with the traditional method demonstrated that incorporation of the CCO enabled the network to consume less energy and increase the network life span of the WSN area for data communication.

Equal Area Partition‐Based Energy Efficient Routing Algorithm for Circular WSN

Wireless sensor network (WSN) is communicating method with each other without the assistance of communication cable. The circular environment is an important application scenario in WSN. As a core technology, routing algorithm is the brain of WSN monitoring system. In this paper, we propose a new routing algorithm named Equal Area Partition Based Energy Efficient Multipath Algorithm (EAPEEM), which tries to exploit sector equal area model in node deployment, data transfer, and route maintenance. Existing algorithms, as compared to our existing models, do not fully match with routing and nodes. One attractive feature of our protocol is its balanced network transmission capacity and improved node energy utilization, which can reduce the possibility of system damage. Simulations show that EAPEEM can retain at least 28.6% of batteries and expand stability by more than 43%.

A novel energy efficient routing algorithm for MPLS-MANET using fuzzy logic controller

A novel energy efficient routing algorithm for MPLS-MANET using fuzzy logic controller

Energy-Efficient Routing Algorithm Based on Small-World Characteristics

Water quality sensor networks are widely used in water resource monitoring. However, due to the fact that the energy of these networks cannot be supplemented in time, it is necessary to study effective routing protocols to extend their lifecycle. To address the problem of limited resources, a routing optimization algorithm based on a small-world network model is proposed. In this paper, a small-world network model is introduced for water quality sensor networks, in which the short average path and large clustering coefficient of the model are used to construct a super link. A short average path can reduce the network’s energy consumption, and a large coefficient can improve its fault-tolerance ability. However, the energy consumption of the relay nodes near the heterogeneous node is too great, and as such the energy threshold and non-uniform clustering are constructed to improve the lifecycle of the network. Simulation results show that, compared with the low-energy adaptive clustering hierarchy routing algorithm and the best sink location clustering heterogeneous network routing algorithm, the proposed improved routing model can effectively enhance the energy-utilization. The lifecycle of the network can be extended and the data transmission amount can be greatly increased.

Novel Approaches to Realize the Reliability of Location Privacy Protocols in Monitoring Wireless Networks

Wireless sensor network (WSN) technology presents significant advantages for Internet of Things (IoT). Sensor-based IoT networks are designed to operate in unattended, harsh, and complex environments. However, WSNs are resource-constrained. Due to the operating environment settings, there exist great challenges in the privacy and reliability of WSN communications. To achieve secure and reliable communications, it is necessary to devise reliable routing protocols and provide a method to evaluate the performance of the protocols. To guarantee location privacy of source nodes, numerous source location privacy (SLP) routing protocols are presented in the literature. However, the existing literature fails to evaluate the SLP reliability of the protocols. This article achieves three main objectives. First, a new relay ring routing (ReRR) protocol is proposed to address some limitations of fake packet-based SLP routing protocols. The routing algorithm of ReRR is specifically designed to provide long-term SLP protection. Second, unlike previous articles that focus solely on measuring the magnitude of SLP protection using performance metrics such as safety period, capture ratio, attack success rate, and capture probability, this article proposes a novel approach to measure the SLP reliability of the protocols. In the third objective, we conduct a series of experiments to analyze the performance of ReRR and fake packet-based protocols. Using the proposed approach, the SLP reliability of the protocols is evaluated. Experiment results reveal that the proposed ReRR protocol exhibits advantageous performance features. It is observed that the fake packet-based routing protocols achieve strong SLP protection by integrating multiple routing techniques such as packet flooding and random distribution of fake packet traffic. However, the achieved SLP protection is short-term and less reliable. On the other hand, the proposed ReRR protocol employs an energy-efficient routing algorithm to guarantee reliability and long-term SLP protection. In addition, the ReRR protocol ensures improved network lifetime.

A clustering algorithm based on nonuniform partition for WSNs

Abstract Wireless sensor networks (WSNs) have great application potential in partition parameter observation, such as forest fire detection. Due to the limited battery capacity of sensor nodes, how to reduce energy consumption is an important technical challenge. In this paper, we propose an energy efficient routing algorithm of adaptive double cluster head (CH) based on nonuniform partition for WSN. Firstly, according to the distance information from the base station (BS) to every sensor node, the network is divided into several uneven partitions. Secondly, CH is selected for each partition as the primary cluster head (PCH). Because of the cluster-level routing, the CHs close to the BS need to forward more data than the CHs in other areas, which consumes more energy. Therefore, an adaptive double CH method can be used to generate a secondary cluster head (SCH) in the cluster near the BS according to the parameters. Finally, the PCH is responsible for data collection, data integration, and data transmission. while the SCH is in charge of data routing. Simulation results show that the proposed algorithm can reduce the energy consumption and extend the life of the WSNs, compared with LEACH protocol and the HEED protocol.

A novel energy efficient routing algorithm for MPLS-MANET using fuzzy logic controller

MANET is one kind of self-configuring and dynamic wireless network that has numerous transferable consumer equipments. Mobile nodes communicate with each other without any fixed central base station to monitor the nodes and to transfer data between the nodes. Multi-protocol label switching (MPLS) is a scalable network that is used within the MANET. These networks have many issues like node failure, link failure, finite transmission bandwidth, broadcasting messages and the establishment of the dynamic link. In this paper, the routing over MPLS based MANET is made by the combination of fuzzy logic controller based routing (FLCR) which is optimised by particle swarm optimisation (PSO). By optimising the FLC with PSO, the optimum node is selected for generating the effective transmission path. This proposed method is named as FLCR-MPLS-MANET method. The performance of the FLCR-MPLS-MANET method is analysed in terms of alive nodes, dead nodes, energy consumption, throughput and bandwidth. The performance of FLCR-MPLS-MANET method is compared with the existing method Dist-MANET and BECIT. This Dist-MANET considered only the distance while generating the transmission path in the network. The bandwidth of the FLCR-MPLS-MANET method increased at 43.13% and 95.23% compared to the Dist-MANET and BECIT respectively.

Performance evaluation of Energy Efficient algorithm using Spatial Trusted and Energy Aware Trusted Distance routing in WSN

Energy efficient routing is the most important design criterion for WSN (Wireless Sensor Network) as the nodes are either powered by batteries, or by other external power sources. In a Sensor network, the nodes communicate with each other in a multi-hop fashion. The availability of each node is equally important to the proper functioning of the network. The power failure of nodes greatly affects the overall performance of the network. The Quality of Service (QoS) has been measured using the parameters of data quality, energy utilization and position of the sensor nodes. In this paper Energy efficient routing algorithm called Location and Energy Aware Trusted distance source routing (LEATDSR), Energy-aware Spatial Trusted Routing algorithm (ESTR) and Intelligent Weighted Fuzzy Cluster based Secure Routing Algorithm (IWFCSRA) were analyzed in term of energy efficiency performance. This paper implements LEATDSR, ESTR and IWFCSRA by using NS2 simulator. Energy Consumption and Security Analysis are used to evaluate LEATDSR, ESTR and IWFCSRA routing protocols performance analysis in WSN.

An Efficient Energy Aware Semigraph-Based Total Edge Domination Routing Algorithm in Wireless Sensor Networks

Wireless sensor networks (WSNs) are group of spatially distributed atomic sensors which are deployed widely in unattended environments. Each sensor node is capable of monitoring environmental parameters like temperature, pressure, humidity, vibration etc. And WSNs has wide range of applications starting from home automation to military surveillance. However, one of the noticeable issues in WSNs is its efficient energy usage because sensor nodes are battery powered, which cannot be replaced or recharged once deployed in target area. Since communication module consumes most of the node power, energy efficient topology construction and routing algorithm design plays the vital role for energy conservation. For energy efficient optimized topology construction selected nodes are being chosen to construct a virtual backbone. One of the principle practices followed for virtual backbone construction for optimized topology is Dominating Set (DS) of graph theory. However, generating a virtual backbone by DS or Connected Dominating Set (CDS) is NP-hard problem because of larger network size. To overcome this issue, in this paper an energy aware Total Edge Domination based semigraph model (TEDS) is proposed. The performance ratio of proposed TEDS algorithm is measured as $$\left( {3 + {{ln\Delta^{\prime}}} + \frac{1}{{{{\Delta^{\prime}}}}}} \right)\left| {{{opt}}} \right|$$ , where |opt| represents size of the network constructed using proposed model. The time complexity of the proposed model is measured as O(m) and message complexity $${\text{O}}\left( {mn + \frac{m}{{\Delta^{\prime}}}} \right)$$ , where $$\Delta^{\prime}$$ is the maximum edge degree of the network. In addition, the performance of the network is simulated using the NS-2 simulator, and the performance metrics were studied.

Energy efficient resource optimization in cooperative Internet of Things networks

Internet of Things (IoT) network has been envisioned as a promising technology to satisfy the exponentially growing mobile traffic requirements. Cooperative communication technique has been proposed to significantly improve energy efficiency in resource-constrained network. In this paper, we focus on resource allocation optimization and optimal relay selection to maximize the energy efficiency of the IoT networks. Using different cooperative techniques, we have studied the resource optimization problems for a single-hop network topology and a generic cooperative multi-hop network topology. Based on dual optimization framework, we formulate an optimal algorithm to reduce the total transmit power through channel allocations and optimal relay selection for each source to destination communication link while satisfying the quality of service (QoS) requirements. We derive the closed-form expressions for the outage probabilities of the cooperative relaying protocols to improve data transmission and propose an energy efficient power routing algorithm to enhance energy efficiency. Simulation results show an effective performance gain of the proposed algorithm as compared with other existing power saving algorithms in terms of system throughput and energy efficiency.

EARPC – Energy Aware Routing Protocol for Cooperative MIMO Scheme in WSNs

Wireless sensor networks are typically operated on batteries. Therefore, in order to prolong network lifetime, an energy efficient routing algorithm is required. In this paper, an energy-aware routing protocol for the co-operative MIMO scheme in WSNs (EARPC) is presented. It is based on an improved cluster head selection method that considers the remaining energy level of a node and recent energy consumption of all nodes. This means that sensor nodes with lower energy levels are less likely to be chosen as cluster heads. Next, based on the cooperative node selection in each cluster, a virtual MIMO array is created, reducing uneven distribution of clusters. Simulation results show that the proposed routing protocol may reduce energy consumption and improve network lifetime compared with the LEACH protocol

Survey on wireless sensor networks: energy efficient optimization routing algorithms

Wireless Sensor Network is extensively utilized in numerous places, such as protection surveillance. In Wireless Sensor Network, sensing unit networks are particular arbitrarily in addition to likewise in-network relying upon the technique is used to extend the network. As sensing unit nodes make use of strength from batteries for noticing the facts in addition to forwarding data, it uses the capability for those answers. The sizable troubles in cordless networks include power optimization, protection, directing, and project type. In this paper, current procedures in escaping power utilization of Wireless Sensor Network in addition to distinctive protocols and also Methods are researched. Additionally, destiny research have a look at on strength efficiency in Wireless Sensor Network putting forward new terms as well as targets for in addition examination is mentioned. Depiction of optimizing strategies like particle swarm optimization set of rules as well as ant swarm optimization Formula is already possible for lowering the electricity loss and complements the life of sensor community but those strategies take in greater time. This paper gives surveying extraordinary different optimization techniques below the multi-objective facet that takes region in tradeoffs. Information extracting in sensing unit networks is the technique of obtaining software-enabled plans in addition to patterns with gratifying accuracy from a constant, speedy, in addition to probable non-ended flow of facts streams from sensor networks. Various boundaries in preceding optimization Algorithms and suggesting a great deal better treatment through applying Data extracting Strategies for Wireless Sensing unit Networks is carried out.

DS Evidence Theory-Based Energy Balanced Routing Algorithm for Network Lifetime Enhancement in WSN-Assisted IOT

Wireless sensor networks (WSNs) can provide data acquisition for long-term environment monitoring, which are important parts of Internet of Things (IoT). In the WSN-assisted IoT, energy efficient routing algorithms are required to maintain a long network lifetime. In this paper, a DS evidence theory-based energy balanced routing algorithm for network lifetime enhancement (EBRA-NLE) in WSN-assisted IOT is proposed. From the perspective of energy balance and minimization of routing path energy consumption, three attribute indexes are established to evaluate the forward neighboring nodes. Then a route selection method based on DS evidence theory is developed to comprehensively evaluate the nodes and select the optimal next hop. In order to avoid missing the ideal solution because of the excessive difference between the index values, the sine function is used to adjust this difference. The simulation results show that the proposed EBRA-NLE has certain advantages in prolonging network lifetime and balancing energy between nodes.

DQN-based energy-efficient routing algorithm in software-defined data centers

With the rapid development of data centers in smart cities, how to reduce energy consumption and how to raise economic benefits and network performance are becoming an important research subject. In particular, data center networks do not always run at full load, which leads to significant energy consumption. In this article, we focus on the energy-efficient routing problem in software-defined network–based data center networks. For the scenario of in-band control mode of software-defined data centers, we formulate the dual optimal objective of energy-saving and the load balancing between controllers. In order to cope with a large solution space, we design the deep Q-network-based energy-efficient routing algorithm to find the energy-efficient data paths for traffic flow and control paths for switches. The simulation result reveals that the deep Q-network-based energy-efficient routing algorithm only trains part of the states and gets a good energy-saving effect and load balancing in control plane. Compared with the solver and the CERA heuristic algorithm, energy-saving effect of the deep Q-network-based energy-efficient routing algorithm is almost the same as the heuristic algorithm; however, its calculation time is reduced a lot, especially in a large number of flow scenarios; and it is more flexible to design and resolve the multi-objective optimization problem.

An Exploration into Energy Efficient Algorithms Based on the Techniques of Particle Swarm Optimization in MANET

This paper throws understanding into nature inspired meta-heuristic algorithm; Particle Swarm Optimization based technique in designing various energy efficient MANET routing algorithms. Mobile ad hoc network (MANET) is a framework-less system of self-directed mobile nodes. Owing to the dynamic topological property of MANET, it’s very rigid task to calculate the performance of routing protocol under unpredictable network conditions and the performance of the network will degrade. The performance of Mobile Ad-hoc network is measured by metrics such as packet delivery ratio, battery power and total delay in delivery. Regular variation in topology affect route selection and lifespan of network, hence it is essential to optimize these metrics parameters. There are various protocols developed for routing. These routing paths are established to send data packets through the shortest path without a satisfying multi-objective approach. The purpose of the research is to discuss different approaches of swarm based intelligence routing algorithms used in MANET under dynamic conditions by comparing the measured metrics and to design a novel effective PSO based routing procedure for MANET.

A novel energy efficient obstacle aware routing algorithm for MANET

A novel energy efficient obstacle aware routing algorithm for MANET