Energy Efficient Routing Scheme Research Articles

Energy Efficient Routing Algorithm for Void Avoidance in UWSN Using Residual Energy and Depth Variance

Underwater Wireless Sensor Networks (UWSN) is attracting the interest of most of the researcher because of the good opportunity to discover and catch the oceanic activities. As we know radio waves could not work efficiently in Underwater so Underwater Acoustic Sensor Networks (UASN) emerged as a most prevalent network to an outstanding range. UASN have some constraints in its deployment as well as acoustic wave communication. This limitation involves large propagation delay, transmission cost, very less bandwidth, high signal attenuation, and restricted accessibility of the nodes and non-availability of the recharging of nodes leads to the development of some energy saving algorithms to prolong the lifetime of the nodes. Routing technique must be rich enough to overcome all these constraints and give an energy efficient path by avoiding void regions and increase the network lifetime. Depth based algorithms proposed in the last decades use depth factor to estimate the path from sender to the sink. By having the holding time calculation they minimize the replication of information. Here, this paper have proposed Energy Efficient Void Avoidance Routing Scheme for UWSN (E2RV) using Residual Energy and Depth Variance it used two hop node information to escape the void shacks in the network area along with this it is using regularized remaining energy and normalized depth of the nodes to estimate the path from data generating node to sink node. In this way E2RV not only removing the void holes but also maintains the energy depletion of the network nodes and upsurge the network lifetime. Simulation results show the improvement of E2RV over previously defined algorithms in terms of packet delivery ratio, duplications, less energy depletion and increased lifetime.

Energy Efficient and Secure Routing Scheme in Wireless Sensor Network

Energy Efficient and Secure Routing Scheme in Wireless Sensor Network

Energy Efficient Routing and Peer to Peer Trust Assessment for Increasing the Network Life Time in Delay Tolerant Networks

In military network environments is resource-constrained arrange conditions, where end-to-end network is not ensured because of successive deferral, an efficient solution is required for trustful and energy efficient routing. Proposed work, provenance trust based routing is combined with energy efficient route to opt for a high network lifetime. Proposed scheme is designed for peer-to-peer trust assessment and maximize the delivery of correct messages received by destination nodes while minimizing message delay and communication cost Provenance alludes to the historical backdrop of responsibility for esteemed data. Proposed scheme avoids malicious node using provenance model and achieves good network lifetime using energy efficient routing strategy. Node’s trust is calculated dynamically in response to changes in the environmental and node conditions.

Traffic load-aware dynamic energy-efficient routing strategy with spectrum reservation and load balance in elastic optical networks

Abstract For reducing the energy consumption in elastic optical networks (EONs) and mitigating the increasement of bandwidth blocking probability (BBP), a spectrum reservation and load balancing routing strategy (SRLBRS) is proposed. In SRLBRS, a spectrum state formula of node is designed to report the link spectrum usage of node-related links on the shortest path of traffic. Then, the node spectrum state can be determined by comparing the spectrum status of node-related links on the shortest path and average spectrum status in the EON. At the same time, the load state of candidate lightpath is decided by node spectrum state and available frequency slots of candidate lightpath. Available spectrum aware reservation grooming algorithm (ASARG) and load balancing routing algorithm (LBRA) are proposed and performed independently based on load state of candidate path. The ASARG focuses on energy saving by reserving lightpath dynamically according to available frequency slots of lightpath. While LBRA focuses on BBP by designing a lightpath cost formula, which is with respect to hops and spectrum continuity. Moreover, a balance index is designed to evaluate the balance between energy efficiency and blocking performance. Compared with the green grooming algorithms of distance-adaptive spectrum resource allocation (GGA + DASRA), simulation results show that the proposed SRLBRS can balance the energy consumption and blocking probability significantly. For instance in terms of balance index, our proposal achieved 57.9% better results averagely in a NSFNET topology.

A rough set calibration scheme for energy effective routing protocol in mobile ad hoc networks

The mobile ad hoc networks are a set of the autonomous nodes which arbitrarily moves out due to their autonomous nature. The topology of the network differs very often. Each and every autonomous node are powered by batteries with inadequate abilities and due to which the nodes fail to communicate the information packets from source to the target. The purpose is to design an energy efficient routing scheme in mobile ad hoc network with the aid of rough set calibration scheme. The rough set calibration scheme ultimately makes use of episodic based association where each and every metric like energy and distance are employed as the entity of rough set. Furthermore, the scheme aids in deciding the energy efficient routing. The analysis reveals that the scheme attempts for energy efficient routing with the aid of rough sets. The results of the simulation make use of the designed protocol with the aid of NS2 and estimate it with other conventional schemes based on which the designed scheme performs better in terms of energy efficiency.

An energy-efficient routing scheme by using GPS information for wireless sensor networks

A wireless sensor network (WSN) (or IoT network) is a collection of distributed nodes. These nodes gather data from various sensors and relay that information to a central point through a wireless network. Therefore, the data can be aggregated and have something useful done with it. These types of networks deal primarily with the transmission of small amounts of data that needs to be sent very efficiently. In this paper, we propose an energy-efficient routing algorithm based on the global positioning system (GPS) information. Proposed scheme track the destination's location based on the beacon messages of the main route nodes. Through the experiments, proposed scheme shows improvements in the data packet delivery ratio and reduces the amount of routing control message overhead compared with existing routing protocols such as energy-efficient ant-based routing algorithm (EEABR) and ladder diffusion.

QoS-Predicted Energy Efficient Routing for Information-Centric Smart Grid: A Network Calculus Approach

As the proportion of information content in the power grid increased, information-centric smart grid (iCenS) has drawn much attention in recent years. By introducing features of information-centric networking on decentralization, multi-path transmission, and in-network caching to distributed power systems, the iCenS enabled more efficient demand response, disruption tolerant, and mobility support. However, due to the strict quality of services (QoSs) requirement of power grid and a large number of resource-limited infrastructures existed in iCenS, it still faces the following challenges. First, multi-path addressing will cause redundant packets and the transmission of duplicate packet consumes the node energy which may lead to link failure; the delayed transaction of key component information like tele-protection will induce electricity accidents. Second, it is hard to model the traffic of iCenS without introducing extra computing burden because of its interest-driven feature and constantly updated forwarding information base. In this paper, we propose a QoS-predicted energy efficient routing (QPER) scheme for iCenS, which leverage on the network calculus. Upon collecting the real-time state information of the iCenS nodes, the QPER rapidly predicts the QoS boundary and energy consumption of each link for upcoming traffic flows by establishing the service curve and arrival curve. The simulation results validate that our method is superior to traditional multicast routing algorithm in terms of delay, energy consumption, packet loss, and others. Simultaneously, providing various routing methods for different service information can ensure the stability and minimize the security risks.

A energy balanced routing scheme in wireless sensor networks based on non-uniform layered clustering

To tackle the unbalanced distribution of clusters problem and the 'hot spot' problem for routing in wireless sensor networks (WSNs), a balanced non-uniform layered energy efficient routing scheme (BLEE) is proposed in this paper. Here, two major contributions are involved in the design of BLEE. Firstly, driven by the intelligence (via the knowledge of nodal energy consumption) for non-uniform network layer construction, a novel numerical model is proposed to calculate the number of layers and scale of each cluster. Secondly, upon the guidance of above analysis, a combined intra/inter-cluster communication pattern is proposed to prolong the network lifetime. Both numerical and simulation results demonstrate that BLEE outperforms well known literature works, in terms of reduced energy consumption and prolonged network lifetime.

An Energy Efficient Routing Scheme for Mobile Wireless Sensor Network with Mobile Sink

In wireless sensor network, the sensor nodes find the route towards the sink to transmit the sensory information such as temperature, pressure etc of a particular area. The sensor nodes transmit the data directly to sink or it relays the data through neighbor nodes using single or multi-hop links. Each time when nodes send their data to static sink, the data is passed through the nearer nodes of sink to it. As soon as the nodes near to the sink become dead, the entire network will be useless as there will be no communication to the sink node. So, to conserve the energy we use mobile sink approach. Thus with the inclusion of mobile sink in WSN, new paradigm called mobile wireless sensor network came into existence. In this paper, to conserve energy and to perform energy efficient routing, we have proposed chain-based energy efficient routing scheme for mobile wireless sensor network (CB-EERM)which is using mobile sink and media access approach where sink moves from one position to another position in sensor field and sojourn at a particular location to collect the whole aggregated data from the various leader(aggregator)nodes in chain using media access approach. The proposed mobile scheme CB-EERM is validated through simulation and compared with traditional static approach using metrics such as energy consumption, throughput, delay and packet delivery ratio where proposed approach outperforms the existing scheme.

A New Energy Efficient Routing Scheme for Data Gathering

A New Energy Efficient Routing Scheme for Data Gathering

Energy-efficient anycast scheduling and resource allocation in optical grids

In recent years, optical grid networks has been used as an ideal infrastructure to support high-performance computing environment, data intensive applications and interconnection of data centers. Due to rapid increase in the high-bandwidth applications, the power consumption of communications equipment for such networks has been increasing steadily over the past decade. Therefore, energy efficient routing schemes and traffic models can be developed to reduce the energy consumption. In many applications it is possible to select the destination node from a set of possible destinations, which have the required computing/storage resources. This is known as anycasting compared to unicasting where there is only one destination for each communication. In this paper we adopt the sliding scheduled traffic model, where setup and tear down times may vary within larger window frame. We propose a novel problem that exploits knowledge of demand holding times using anycasting model. We show how the flexibility of anycast routing can lead to additional energy saving. The problem was formulated as an integer linear program to optimally schedule demands (in time) and route them in order to minimize overall network energy consumption. The problem of energy consumption is addressed by switching off idle network components in low utilization periods. We analyze the performance of the proposed approach for anycast and unicast routing models. Our simulation results demonstrate that the proposed approach can lead to significant reductions in energy consumption, compared to traditional routing schemes.

Increasing network lifetime by energy-efficient routing scheme for OLSR protocol

Increasing network lifetime by energy-efficient routing scheme for OLSR protocol

A Limited Energy Consumption Model for P2P Wireless Sensor Networks

One of the most critical and challenging issues when developing wireless sensor networks (WSNs) is how to extend the network lifetime. Sensors are energy-constrained devices that require developing minimization techniques and mechanisms in order to exploit perfectly the energy and to prolong as long as possible the overall network lifetime. In this paper, we propose a limited energy consumption model for P2P wireless sensor networks, which takes a benefit of the Chord assets and adapts this last one so that it will be suitable for P2P WSNs. Chord in its basic form optimizes the path length by minimizing the number of hops, but it does not optimize the energy, since it was designed for wired networks. The key idea of our proposal is to optimize both the number of hops and the energy consumption to provide an energy-efficient routing scheme for P2P WSNs. The proposed enhanced Chord scheme makes a use of only Cluster-Heads (with the strongest level of energy) to construct the ring, which reduces the Chord topology while preserving the network connectivity. In the enhanced Chord scheme, Cluster-Heads are elected automatically and dynamically over the time, which helps to extend the network longevity. Simulation results show that the proposed scheme proves good performances in terms of hops number, alive nodes over the time and energy efficiency.

Relay participated–new-type building energy management system: An energy-efficient routing scheme for wireless sensor network–based building energy management systems

With the development of wireless sensor networks, many building energy management systems are getting to adopt wireless sensor network as their communication infrastructure. However, the existing wireless sensor network protocols cannot satisfy the energy-saving demand of building energy management systems. Considering the characteristics of the building energy management system wireless sensor networks, a novel energy-efficient routing scheme is proposed called relay participated–new-type building energy management system. Nodes in the building energy management system wireless sensor networks are divided into two types: energy-limited nodes (battery powered) and energy-unlimited nodes (main powered, solar charger, or heat energy powered). Relay participated–new-type building energy management system allows energy-unlimited nodes to temporarily receive packets that are routed to a nearby energy-limited nodes. In this way, time synchronization for low-power sleep at media access control layer is no longer required, which reduces the delay and control overhead at media access control layer dramatically. Relay participated–new-type building energy management system reduces energy usage of energy-limited nodes and extend the lifetime of wireless sensor networks in new-type building energy management systems. Simulation results show that the relay participated–new-type building energy management system protocol significantly improves energy efficiency of limited energy nodes and reduces latency as compared to ad hoc on-demand distance vector–sensor medium access control and low-energy adaptive clustering hierarchy.

Derived Genetic Algorithm Optimizer for Energy Efficient Routing in Wireless Sensor Network

Wireless sensor network is a type of network with spatially distributed nodes for the application of particular data. It consists of large number of sensor nodes with one or more base stations. The data is sent from sensor nodes to base station straightly or in multihop manner. Increasing the lifetime of network and less energy utilization are two key concerns for WSNs. Some energy-saving routing algorithms decrease total energy utilization of WSN, but they are difficult one in sending the data packets on many key nodes in order that these nodes drain out battery energy quickly through reducing network lifetime. In order to increase the energy efficiency and network lifetime, Derived Genetic Algorithm Optimizer for Energy Efficient Routing (DGAO-EER) scheme is introduced. GA is an effective one for energy efficient path finding in sensor network. GA collects the useful information about individuals from current nodes (i.e., gene). Initially, fitness function is presented to allocate the fitness value for every individual node. This function is used to find the nearby nodes to send the packets from source to sink node. Then, the data transfer of genetic information is carried out between two neighboring node to find another two neighboring nodes is called as crossover operation. Mutation restores the lost genetic values quickly when the node chooses the neighboring node. This process helps in increasing the lifetime of the network and energy efficiency. Performance results shows that the proposed DGAO-EER obtains the better performance in terms of energy consumption rate, energy drain rate, routing over head and routing delay as compared to the state-of-the-art works.

An energy efficient and load balanced distributed routing scheme for wireless sensor networks with holes

Abstract In this paper we present a new approach to route packets in the presence of routing holes. In our proposal, nodes cooperate to determine the approximate polygon of a specific hole and then exchange information about the approximate polygon. Based on the hole covering parallelogram and the hole view angle of a specific node, packets can be forwarded along an escape route that bends around the hole. We rigorously prove that the Euclidean stretch of an escape route is bounded. Simulation results show that the proposed scheme can save more than 16% of the energy consumption and 7% of the network lifetime in the comparison with existing routing algorithms. The average length of routing paths in our approach is less than 60% of other routing schemes.

Self-servicing energy efficient routing strategy for smart forest

Monitoring the health and population of all forms of wildlife is a challenge for experts. Nature can be unforgiving with incidents of earthquakes, forest fires, tsunamis, and floods appearing without warning. The effects of industrialization take a toll on wildlife as well. As a result, many species of animals have reportedly gone extinct. The practice of installing wireless sensor networks in forests or in remote environments is not new. In this paper, we present a novel approach in deploying static and mobile sensors in forests. The sensors are distributed at random locations throughout a forest region to cover the maximum area possible. Data collected by these sensors is uploaded to cloud for further analysis. At the core of our model, we propose an energy-efficient algorithm by means of which individual sensors are able to transmit data over shortest path. In simulated experiments, results reveal that our method yields a stable packet delivery ratio. It is also observed to be more energy efficient compared to models that use cluster head selection in wireless sensor networks. Using this model, a region in a forest or wildlife habitat can be monitored for an extended period without compromising network throughput.

Addressing Mobility in RPL With Position Assisted Metrics

Mobility is still an open challenge in wireless sensor networks (WSNs). Energy efficient routing strategies designed for static WSNs, such as routing protocol for low-power and lossy networks (RPL), generally have a slow response to topology changes. Moreover, their high signalling cost to keep up-to-date routes in the presence of mobile nodes makes them inefficient in these scenarios. In this paper, we introduce Kalman positioning RPL (KP-RPL), a novel routing strategy for WSNs with both static and mobile nodes, based on RPL. The objective of KP-RPL is to provide robust and reliable routing, considering the positioning inaccuracies and node disconnections that arise in real-life WSNs. This considers the original RPL for the communication among static nodes and position-based routing for mobile nodes, which use a novel RPL metric that combines Kalman positioning and blacklisting. The simulation results show that the reliability and the robustness of the network in harsh conditions are enhanced compared with geographical routing. Moreover, KP-RPL reduces the density and the number of simultaneously active anchor nodes for positioning. As a result, the infrastructure cost is lower, and the network lifetime is extended.

SARDS: Secured Anonymous Routing with Digital Signature in Wireless Sensor Network

A Wireless Sensor Network has witnessed a massive research towards security as well as energy efficiency in past decades. However, there are few studies that have witnessed a cost effective secure routing technique with energy effectiveness till date. Objectives: Our objective is to use public key cryptography for ensuring energy-efficient routing technique in Wireless Sensor Network. Method/Analysis: The proposed paper presents a technique called as SARDS (Secured Anonymous Routing with Digital Signature) that performs verification of the routing information exchanged among the sensors in Wireless Sensor Network. SARDS uses elliptical curve cryptography as the backbone of security formulations and performs authentication of all the communicating nodes present in the network. Findings: The system also allows a dual layer of security by introducing a novel signature based scheme towards public key encryption policy. The outcome of the study shows SARDS to excel best in performance in comparison of existing security and energy efficient routing schemes. Application/Improvements: Proposed SARDS technique offers 1) A novel public key encryption, 2) A novel digital signature scheme, and 3) A novel privacy or anonymous scheme. The outcome of the proposed system is also found to be superior as compared to existing protocols e.g. SecLEACH, LEACH and PEGASIS.

Power Aware and Energy Efficient Multipath Routing Scheme for WSNs

Power Aware and Energy Efficient Multipath Routing Scheme for WSNs