Energy Efficient Routing

The low temperature microwave activation of biomass has been investigated as a novel, energy efficient route to bio-oils. The properties of the bio-oil produced were considered in terms of fuel suitability. Water content, elemental composition and calorific value have all been found to be comparable to and in many cases better than conventional pyrolysis oils. Compositional analysis shows further differences

since the wireless node operates on battery power, the energy consumption plays a vital role in wireless sensor network (WSN). Normally the communication consumes much energy when comparing to sensing and data processing. So a controlled communication with the help of the proper routing can save maximum energy. As per the data transmission as well as reception analysis most of the power wasted due to unnecessary route request flow. To minimize the route request, a new shortest path routing protocol introduced. In this paper, it has been analysed the various parameters such as network throughput, Mean Delay, mean jitter, packet delivery ratio based on the comparison of different routing protocols.

WSNs (Wireless Sensor Networks) have recently gained popularity. WSNs are typically deployed in insecure, unstructured areas where their source location reveals critical information about targets. Sensor deployment in WSNs has been seen in a variety of applications that oversee events and send information to base stations. Optimal route selection and source location privacy are critical issues in WSNs. If an intruder determines the source node by studying traffic mode, an attack could be conducted on a target with ease. Previous methods were based on MSROs (Mobile Sink-based Route Optimizations) and Cloud-Based WSN Protection Schemes. This research work chooses the optimum multi-sink node based on the BFAs (Bacteria Foraging Algorithms). But, it does not yield optimal paths to balance the PDRs (Packet Delivery Ratios) and energy dissipation. To seek a solution to this issue, this study proposes ERR-CSLPPs (Efficient and Reliable Routing with Cloud-based Source-Location Privacy Protections) using AAFBOA (Adaptive Adjustment Factor based Butterfly Optimization Algorithm), allowing the approach to choose the mobile sink node. Depending on the ETCs (Expected Transmission Counts), residual energy, and hop count, the optimal paths are chosen with the help of TOPSISs for efficient transmissions. The actual packets are sent over the preferred path. Next, the cloud-like false hotspot is formed to include counterfeit packets into the WSN to confuse the intruder and yield an elaborate privacy location. Counterfeit packets are included along the delivery path of the actual data packet to extend the time needed for tracing the traffic flow. The experiments reveal that the proposed system yields improved performance when matched with the earlier system in terms of overall energy dissipation, node utilization ratio, transmission delay, security, and network lifetimes.

Due to limited energy of sensor nodes in a wireless sensor network, an energy-efficient routing protocol with static clustering and dynamic structure (ERP-SCDS) is proposed in this paper. Utilizing virtual points in a corona-based wireless sensor network, static clusters with dynamic structures are formed in ERP-SCDS. Moreover, next-round cluster heads are selected in advance to avoid a deadlock when the old cluster heads die. Finally, a simple relay node selection mechanism instead of a complicated multi-hop route discovery algorithm is further designed for ERP-SCDS. Integrating these mechanisms enables ERP-SCDS to form balanced cluster sizes to prolong the network lifetime. Via simulations, we demonstrate that ERP-SCDS significantly outperforms LEACH, HEED, and Hausdorff previously proposed in the literature.

One of the effective mechanisms for reducing the cost of data communication in wireless ad hoc networks is energy efficient routing. Mainly the total energy is computed for end to end traversal and then the routes are identified. This paper considers two algorithms Reliable Minimum Energy Cost Routing (RMECR) and Reliable Minimum Energy Routing (RMER) and compares the performance of both. RMECR addresses reliability, energy efficiency and prolonging network lifetime by considering the remaining battery energy of nodes as well as the link quality. RMER find routes that consume minimum energy for traversal. Both of these can be used for end to end traversal and hop to hop traversal. Comparison results show that RMECR performs better than RMER and when will further develop a new algorithm EERCR uses clustering technique ,it will enhance the performance.

Adhoc networks such as DTNs (Delay Tolerant Networks) can be set up on an urgent basis without the need of infrastructure in order to analyze a post disaster situation and offer a peer-to-peer communication via intermediate nodes. In this paper, we propose map based DTN architecture to represent a post disaster situation and imitate the movement pattern of civilians and rescue entities on the real map. The rescue entities as well civilians build the network of nodes and carried out the mobile devices, to send and receive the messages. We also propose the routing protocol for DTN in the above map based architecture. The routing protocol selects the next forwarder based on time to return, speed and historical information such as dissimilarity coefficient and encounter information. Also the buffer management policy is proposed to transfer the message to the fittest node instead of dropping in case of buffer overflow. The map based architecture and the routing protocol have been implemented in the Opportunistic Network Environment (ONE) simulator. The performance of the proposed routing protocol is compared against the existing protocols such as Epidemic, Prophet and MaxProp to verify its performance in the map based DTN architecture for a post disaster situation. The results have shown that the proposed routing protocol outperforms than the existing approaches in terms of routing efficiency, average hop count and message drop count with comparable average delivery delay.

In the proposed paper are discussed results of an industry project concerning energy management in building. Specifically the work analyses the improvement of electrical outlets controlled and activated by a logic unit and a data mining engine. The engine executes a Long Short-Terms Memory (LSTM) neural network algorithm able to control, to activate and to disable electrical loads connected to multiple outlets placed into a building and having defined priorities. The priority rules are grouped into two level: the first level is related to the outlet, the second one concerns the loads connected to a single outlet. This algorithm, together with the prediction processing of the logic unit connected to all the outlets, is suitable for alerting management for cases of threshold overcoming. In this direction is proposed a flow chart applied on three for three outlets and able to control load matching with defined thresholds. The goal of the paper is to provide the reading keys of the data mining outputs useful for the energy management and diagnostic of the electrical network in a building. Finally in the paper are analyzed the correlation between global active power, global reactive power and energy absorption of loads of the three intelligent outlet. The prediction and the correlation analyses provide information about load balancing, possible electrical faults and energy cost optimization.

—In this paper, we have proposed a two-tiered wireless sensor network (WSN) in which sensor nodes transmit data packets to their connected relay nodes (cluster heads). Each sensor node is associated with at least one relay node in the network. The proposed strategy determines the best set of relay nodes for upper-tier communication. These relay nodes are periodically reselected on the basis of residual energy information of sensor nodes. Relay node reselection mechanism balances the energy consumption of sensor nodes in a network. Moreover, greedy algorithm is used to create a set of possible routing solutions. With the help of genetic algorithm (GA), we find a best routing path from a set of possible routing solutions.

Energy consumption plays a crucial role in wireless sensor networks as these networks are designed to be placed in hostile and non-accessible areas. While battery-driven sensors will run out of battery sooner or later, the use of renewable energy sources such as solar power extends the lifetime of a sensor network. We propose a solar-aware, scheduled clustered routing protocol A-sLEACH which is an extension to sLEACH for routing and MTE for radio model. Simulation results of applying such scheme shows better performance compared to MTE and sLEACH.

In this paper, we propose a novel medium access control (MAC) protocol, called SYN-MAC (for SYNchronized MAC), based on a binary countdown approach tailored for wireless networks. SYN-MAC has several attractive features such as simplicity, robustness, high efficiency, fairness, and quality of service capability. We evaluate SYN-MAC in terms of collision probability, system throughput, and packet delay, via both analysis and simulation. Our results show that, with properly chosen parameters, SYN-MAC can achieve a very low collision probability, packet delay tolerance, and extremely high channel efficiency (of > 90%) under a wide range of traffic load. As a result, SYN-MAC may serve as an alternative to IEEE 802.11 for the wireless stations in synchronized networks.

Ad hoc mobile devices heavily depend on the performance of batteries. Optimizing the power consumption is a very crucial issue. To maximize the lifetime of mobile ad hoc network, the power consumption rate of each node must be reduced. In this paper we present a novel energy efficient routing algorithm based on mobile agents to deal with the routing mechanism

One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the energy dissipated throughout the wireless sensor network in order to minimize maintenance and maximize overall system performance. Any communication protocol that involves synchronization of peer nodes incurs some overhead for setting up the communication. We introduce a new algorithm, e3D (energy-efficient Distributed Dynamic Diffusion routing algorithm), and compare it to two other algorithms, namely directed, and random clustering communication. We take into account the setup costs and analyze the energy-efficiency and the useful lifetime of the system. In order to better understand the characteristics of each algorithm and how well e3D really performs, we also compare e3D with its optimum counterpart and an optimum clustering algorithm. The benefit of introducing these ideal algorithms is to show the upper bound on performance at the cost of an astronomical prohibitive synchronization costs. We compare the algorithms in terms of system lifetime, power dissipation distribution, cost of synchronization, and simplicity of the algorithm. Our simulation results show that e3D performs comparable to its optimal counterpart while having significantly less overhead.

Mobile sinks are proposed for load-balancing and achieving uniform energy-consumption in wireless sensor networks. However, advertising the location of the mobile sink to the network introduces an overhead in terms of energy consumption and packet delays. In this paper, we propose a new routing protocol, Ring Routing, which aims to minimize this overhead while preserving the advantages of mobile sinks. Simulation results show that the performance of Ring Routing is not very far from the lower bound in terms of delay and energy consumption.

With the evolution of electronics, wireless sensor networks have been very popular in many domains of human life such as health, industry and military. This popularity has taken the attention on to the researches about wireless sensor networks. Wireless Sensor Networks are especially very favorable in conditions where it is physically difficult and dangerous for human being to gather information. Therefore, lifetime of those networks must be prolonged as much as possible, since it will be also infeasible to replace the energy depleted sensors with the new ones deployed in such geographical areas that are difficult and dangerous for human being to enter. In this paper, we present a localized energy aware routing method LEERA-MS and an alternative LEERA-MS-TH method that are used incorporation with an energy efficient sleep-wakeup schedule which is included with pipelining mechanism we have proposed before. Employing multiple sinks improve the performance by providing the fairly distribution of the load. Simulation results show that this routing method applied on a multiple sinks topology when employed together with the pipelined sleep-wakeup schedule provides 40% longer lifetime for wireless sensor networks.

The modern and innovative medical applications based on wireless network are being developed in the commercial sectors as well as in research. The emerging wireless networks are rapidly becoming a fundamental part of medical solutions due to increasing accessibility for healthcare professionals/patients reducing healthcare costs. Discovering the routes among hosts that are energy efficient without compromise on smooth communication is desirable. This work investigates energy efficiency of some selected proactive and reactive routing protocols in wireless network for healthcare environments. After simulation and analysis we found that DSR is best energy efficient routing protocol among DSR, DSDV and AODV, because DSR has maximum remaining energy.

In the information society, no human activity stands still, including the electric power industry. As a result, there has been a shift from a traditional grid architecture to a new information and communication technology architecture. The object of the study of this article is a smart power supply system. The purpose of the study is to consider problems for implementing the concepts of "Smart Grid" and "Internet of energy." To do this, a brief overview was made of the traditional electricity supply system, as well as promising renewable energy sources and its promising directions. In order for several RSE to exist in the same power grid without any problems, it is necessary to use energy routers that are able to connect several power grids operating on different sources. The received system monitor by the power grid management systems (SCADA, distributed control system). There are also discussed the SCADA tasks and features. The above all leads to the implementation of two innovative concepts in the field of energy: Smart Grid and Internet energy.

The modern and innovative medical applications based on wireless network are being developed in the commercial sectors as well as in research. The emerging wireless networks are rapidly becoming a fundamental part of medical solutions due to increasing accessibility for healthcare professionals/patients reducing healthcare costs. Discovering the routes among hosts that are energy efficient without compromise on smooth communication is desirable. This work investigates energy efficiency of some selected proactive and reactive routing protocols in wireless network for healthcare environments. After simulation and analysis we found that DSR is best energy efficient routing protocol among DSR, DSDV and AODV, because DSR has maximum remaining energy.

Ad hoc mobile devices heavily depend on the performance of batteries. Optimizing the power consumption is a very crucial issue. To maximize the lifetime of mobile ad hoc network, the power consumption rate of each node must be reduced. In this paper we present a novel energy efficient routing algorithm based on mobile agents to deal with the routing mechanism