Energy Aware Routing Protocol Research Articles

Mobility and Energy Aware Routing Protocol for Healthcare IoT Application

Internet of Things (IoT) is one of the emerging technologies in the world and it changes the life style of the people. Nowadays, there is a drastic increase of sensor enabled physical devices connected in the internet and at the same time, quick responsiveness is very important for transferring the data from source to destination. Hence, routing plays a crucial role in IoT. In IoT routing protocol, the requirement is dynamically varying depends on the on the application. The mobility based IoT application like healthcare, smart school, animal tracking and etc. The term mobility denotes entire node can move dynamically from one place to another place within the coverage area of the network. In this paper, we introduce the Mobility and Energy aware routing protocol (ME-RPL), which consider the metrics received signal strength (RSSI), expected transmission count (ETX), battery depletion index (BDI). The DODAG root node sends the DODAG Information Object (DIO) control messages to the entire participant node in LLN. If the participant node is within the coverage of existing DODAG, then it can choose the preferred parent based on the routing metric. The simulation has done using COOJA simulator in different IoT mobility scenario. The proposed work (ME-RPL) provides the better result in terms of packet delivery ratio and network lifetime, than other similar protocol RPL, mRPL, D-RPL.

Optimal cluster head selection framework to support energy aware routing protocols of wireless sensor network

Data transfer to the base station from the sensor node through the choice of an optimal cluster head is a huge challenge posed for the routing protocol, in the case of the wireless sensor network. An energy proficient clustering scheme relying on artificial bee colony algorithm and fractional artificial bee colony algorithm tends to maximise the network energy and lifetime of nodes through the selection of an optimal cluster head. However, the growing complexity of the network architecture requires substantial improvement. This paper develops a weighing model as a cost function to represent the optimal cluster head selection problem. Further, the traditional ABC is enhanced by adopting a novel adaptive concept called dynamic scout bee, and hence ABC-DS algorithm is derived in this paper. According to the concept of ABC-DS, multiplicating the scout bee generation enhances the number of alive nodes and the energy of cluster head. Comparative study between the performance of the proposed ABC-DS routing mechanism against that of ABC and FABC-based routing is conducted. The simulation results show that the proposed scheme increases the number of alive nodes with 25% of maximum normalised network energy than the existing protocols.

Optimal cluster head selection framework to support energy aware routing protocols of wireless sensor network

Optimal cluster head selection framework to support energy aware routing protocols of wireless sensor network

Average Link Stability with Energy-Aware Routing Protocol for MANETs

This paper suggests the A-LSEA (Average Link Stability and Energy Aware) routing protocol for Mobile Ad-hoc Networks (MANETs). The main idea behind this algorithm is on the one hand, a node must have enough Residual Energy (RE) before retransmitting the Route Request (RREQ) and declaring itself as a participating node in the end-to-end path. On the other hand, the Link Life Time (LLT) between the sending node and the receiving node must be acceptable before transmitting the received RREQ. The combination of these two conditions provides more stability to the path and less frequent route breaks. The average results of the simulations collected from the suggested A-LSEA protocol showed a fairly significant improvement in the delivery ratio exceeding 10% and an increase in the network lifetime of approximately 20%, compared to other re-active routing protocols.

A trustworthy and energy-aware routing protocol in software-defined wireless mesh networks

A privacy-aware, secure and energy-aware green routing (PSGR) scheme was proposed.The PSGR defends against internal attacks and achieves strong privacy protection.The PSGR integrates a dynamic repu...

Energy-Aware Clustering-Based Routing in Wireless Sensor Networks Using Cuckoo Optimization Algorithm

Since sensor nodes make use of battery energy, energy consumption and limitation of sensor nodes is regarded as a fundamental challenge and problem in wireless sensor nodes. Recently, in wireless sensor networks (WSNs), clustering-based energy-aware routing protocols divide neighboring nodes into separate clusters and select local cluster heads so as to combine and transmit information of each of the clusters to the central station. In this way, they attempt to maintain energy consumption balance by the network nodes. When compared with other methods, clustering methods have been able to achieve the best efficiency with regard to the enhancement of network lifetime. In this paper, using cuckoo optimization algorithm, an energy-aware clustering-based routing protocol was proposed in WSNs which is able to cluster the network and select optimal cluster heads. The proposed method considered four criteria with regard to selecting cluster heads in the targeted cuckoo algorithm, namely the remaining energy of nodes, distance to the base station, within-cluster distances and between cluster distances. The results of simulating the proposed method in Matlab environment indicated it is better than other algorithms such as low energy adaptive clustering hierarchical (LEACH), application-specific low power routing, LACH-EP and LEACH with distance-based threshold with regard to the first node die on average and packet delivery rate for six scenario.

A Cognitive Routing Protocol for Bio-Inspired Networking in the Internet of Nano-Things (IoNT)

In this paper, we propose a framework for data delivery in nano-scale networks, where numerous wireless sensors are distributed on a human body, small object, tiny plant root, etc. Our framework caters for green energy-efficient applications in the Internet of Nano Things (IoNT) where data is relayed via nano-routers from a multifarious nanonodes towards a gateway connected to a large-scale network such as the Internet. We consider the entire network energy while choosing the next hop for our routed packets in the targeted wireless nanosensor network. Our delivery approach considers resource limitations in terms of hop count, and remaining energy levels. Moreover, extensive simulations are performed and the results confirm the effectiveness of the proposed approach in comparison to other baseline energy-aware routing protocols.

Secure and energy aware routing protocol (SEARP) based on trust-factor in Mobile Ad-Hoc networks

A Mobile ad-Hoc Network is an anthology of nodes which is an infrastructure less network and hence can be easily established and deployed instantly. In addition to their normal operation, the entire nodes in this breed of network act as routers as well. Because of the mobility and dynamic nature of the network, the entire nodes are liberated to travel indiscriminately and hence topology of a MANET changes very frequently. This invites the complexity of routing the packets from source to destination. Also, as a MANET is a multihop network, the packets should pass through intermediate nodes which always need not be genuine all the time which poses many security issues in MANET’s. And all nodes are self-configurable runs on limited capacity battery sources these may possess security and routing issues. Our paper discusses a secure and energy aware routing protocol by considering the nodes mobility and trust-level of a node and implemented our method SEARP using NS2.

A novel energy-aware routing protocol in intermittently connected delay-tolerant wireless sensor networks

In delay-tolerant wireless sensor networks, messages for sensor data are delivered using opportunistic contacts between intermittently connected nodes. Since there is no stable end-to-end routing path like the Internet and mobile nodes operate on battery, an energy-efficient routing protocol is needed. In this article, we consider the probabilistic routing protocol using history of encounters and transitivity protocol as the base protocol. Then, we propose an energy-aware routing protocol in intermittently connected delay-tolerant wireless sensor networks, where messages are forwarded based on the node’s remaining battery, delivery predictability, and type of nodes. The performance of the proposed protocol is compared with that of probabilistic routing protocol using history of encounters and transitivity and probabilistic routing protocol using history of encounters and transitivity with periodic sleep in detail, from the aspects of delivery ratio, overhead ratio, delivery latency, and ratio of alive nodes. Simulation results show that the proposed protocol has better delivery probability, overhead ratio, and ratio of alive nodes, in most of the considered parameter settings, in spite of a small increase in delivery latency.

An energy-aware routing protocol for wireless sensor network based on genetic algorithm

Energy saving and effective utilization are an essential issue for wireless sensor network. Most previous cluster based routing protocols only care the relationship of cluster heads and sensor nodes but ignore the huge difference costs between them. In this paper, we present a routing protocol based on genetic algorithm for a middle layer oriented network in which the network consists of several stations that are responsible for receiving data and forwarding the data to the sink. The amount of stations should be not too many and not too few. Both cases will cause either too much construction cost or extra transmission energy consumption. We implement five methods to compare the performance and test the stability of our presented methods. Experimental results demonstrate that our proposed scheme reduces the amount of stations by 36.8 and 20% compared with FF and HL in 100-node network. Furthermore, three methods are introduced to improve our proposed scheme for effective cope with the expansion of network scale problem.

Independent Neighbour Set based Clustering Algorithm for Routing in Wireless Sensor Networks

Efficient energy consumption of sensor devices is a prominent problem in battery constrained, unattended wireless sensor networks (WSNs) and it directly influence on WSN lifetime. Designing energy-aware routing protocol can significantly reduce energy consumption in WSNs. Grouping of sensor nodes into clusters is a proficient routing technique for reducing the energy depletion of the nodes in the WSN. In this work, a novel multi-branch tree based clustering approach is proposed to extend the lifetime of the WSNs. A number of branches and selection of cluster heads are performed based on the independent neighbour set properties of nodes. For this, a maximum of five branches constructed by the algorithm and these branches are grown to different direction using the nature of INS. In this approach, inter-cluster communication distance is drastically minimized and evenly distributed the energy consumption of nodes over the network. The performance of the proposed algorithm is compared with the traditional existing methods in terms of cluster structure, nodes energy distribution and network lifetime through the extensive simulations.

RTEA: Real-Time and Energy Aware Routing for Industrial Wireless Sensor Networks

This paper proposes a real-time and energy aware routing protocol for industrial wireless sensor networks, called RTEA. Two-hop neighborhood information routing is adopted from THVR routing protocol, however our routing protocol has low control packet overhead and differentiates packets based on their deadlines. The packet deadline is updated in each hop without using globally synchronized clocks. In addition to velocity, the distance to the sink is considered for reducing the number of relaying hops. Also, the delay between two one-hop neighbors is estimated by a new mechanism which considers the time that packets spend in each node beside the link delay. Simulation results show that RTEA can improve the performance in terms of delivery ratio and energy consumption.

Secure, Reliable and Load Balanced Routing Protocols for Multihop Wireless Networks

Now days in many applications, the mobile ad hoc networks like multihop wireless network are increasingly used. The information exchange between two remote nodes is done according to routing protocols in which the communication is done by other intermediate nodes. Hence during the packet transmission from one node to another creates the chances security threats. All nodes in system are battery control subsequently the courses may break if the battery of any node lapses. Essentially the pernicious hub likewise frequently breaks the present ways. Because of the incertitude of hubs conduct, irregular choice of middle hubs will came about into ways security corruption. It also leads in serious threat of data transmission reliability as well as packet deliver ratio (PDR) performance. To alleviate such problems and prevent frequent route breaks in network, in this paper we propose the method which is reliable, secure, and load efficient routing protocol called LBSTAR. This protocol is designed on top of recent method E-STAR variants. With a trust-based and energy-aware routing protocol LBSTAR is load balancing algorithm which is trust method and payment systems. There were two variants of E-STAR method Best Available Route (BAR) and Shortest Reliable Route (SRR). By considering SRR and BAR functionality we designed LBSTAR to improve further performance of routing. The simulation results claims that proposed method achieves both energy efficiency and QoS efficiency compared to existing methods.

Optimized cost effective and energy efficient routing protocol for wireless body area networks

The increase in average lifespan and huge costs for health treatments have resulted in cost effective solutions for healthcare management. Wireless Body Area Network (WBAN) is a promising technology for delivering quality healthcare to its users. Low power devices attached to the body have limited battery life. It is desirable to have energy efficient routing protocols that maintain the required reliability value for sending the data from a given node to the sink. The current work proposes two protocols: Optimized Cost Effective and Energy Efficient Routing protocol (OCER) and Extended-OCER (E-OCER). In OCER, optimization using Genetic Algorithm (GA) is applied to the multi-objective cost function with residual energy, link reliability and path loss as its parameters for selecting the most optimal route from a given body coordinator to the sink. Distance between any two sensor nodes is reduced by applying multi-hop approach. E-OCER extends the work of OCER by considering inter-BAN communication. Performance of OCER is compared with other existing energy aware routing protocols by considering different parameters. A comparison of the performance of E-OCER with OCER is made to study the effect of on-body sensors communication on the energy consumption and throughput of the network. This paper also provides a comprehensive energy model to calculate the total energy consumption of the network. In addition to the radio transmission and receiving energy, other basic energy consumption sources viz. processing energy, sensor sensing, transient energy and transmission/reception on/off energy have also been taken into account. The results show an improved performance of the proposed protocols in terms of energy efficiency.

Cognitive routing protocol for disaster-inspired Internet of Things

In this paper, we propose a framework for data delivery in large-scale networks for disaster management, where numerous wireless sensors are distributed over city traffic-infrastructures, shopping-malls’ parking areas, airports’ facilities, etc. In general, our framework caters for energy-efficient applications in the Internet of Things (IoT) where data is propagated via relays from diverse sensor-nodes towards a gateway connected to a large-scale network such as the Internet. We consider the entire network energy while choosing the next hop for the routed packets in the targeted wireless sensor network. Our delivery approach considers resource limitations in terms of hop count, and remaining-energy levels. Extensive simulations are performed and achieved results confirm the effectiveness of the proposed approach in comparison to other baseline energy-aware routing protocols in the literature.

Energy Aware Routing Protocol for Cognitive Radio Networks

In this article, a routing protocol EARP (Energy Aware Routing Protocol) with the terminal node is proposed, to deal with the impact of the limited energy resources of Cognitive Radio Networks on the whole network routing. The protocol allows choosing the route from the neighbor nodes in different transmission paths, according to energy consumption of a single node and the full path. If the path breaks, the protocol will increase local routing maintenance strategy. It effectively reduces the retransmission caused by the situation, and improves the routing efficiency. It also can prevent the link transmission process selecting the fault route due to the energy depletion. Through simulation experiments compared with the LEACH (Low Energy Adaptive Clustering Hierarchy) routing protocol, the results showed that in the same experimental environment, the proposed EARP could obviously balance the load, protect low energy nodes, prolong the network survival time and reduce packet loss rate and packet delay of data delivery. So it can improve the energy consumption of sensing node and provide routing capabilities.

A Cluster-Based Data Fusion Technique to Analyze Big Data in Wireless Multi-Sensor System

With the development of the latest technologies and changes in market demand, the wireless multi-sensor system is widely used. These multi-sensors are integrated in a way that produces an overwhelming amount of data, termed as big data. The multi-sensor system creates several challenges, which include getting actual information from big data with high accuracy, increasing processing efficiency, reducing power consumption, providing a reliable route toward destination using minimum bandwidth, and so on. Such shortcomings can be overcome by exploiting some novel techniques, such as clustering, data fusion, and coding schemes. Moreover, data fusion and clustering techniques are proven architectures that are used for efficient data processing; resultant data have less uncertainty, providing energy-aware routing protocols. Because of the limited resources of the multi-sensor system, it is a challenging task to reduce the energy consumption to survive a network for a longer period. Keeping challenges above in view, this paper presents a novel technique by using a hybrid algorithm for clustering and cluster member selection in the wireless multi-sensor system. After the selection of cluster heads and member nodes, the proposed data fusion technique is used for partitioning and processing the data. The proposed scheme efficiently reduces the blind broadcast messages but also decreases the signal overhead as the result of cluster formation. Afterward, the routing technique is provided based on the layered architecture. The proposed layered architecture efficiently minimizes the routing paths toward the base station. Comprehensive analysis is performed on the proposed scheme with state-of-the-art centralized clustering and distributed clustering techniques. From the results, it is shown that the proposed scheme outperforms competitive algorithms in terms of energy consumption, packet loss, and cluster formation.

A trustworthy and energy-aware routing protocol in software-defined wireless mesh networks

Hybrid Wireless Mesh Networks (HWMNs) were proposed to address the challenges in wireless communications to support mobile applications across different domains. Due to the multi-hop and decentralized network architecture, HWMNs are naturally susceptible to various security threats, especially internal attacks. Therefore, HWMNs must be able to detect anomalies, provide secure routing and protect user privacy through the cooperation among nodes. However, the existing routing protocols for HWMNs cannot ensure the security to protect the users privacy effectively. Moreover, traditional HWMNs are vertically integrated where the control and data planes of mesh routers are bundled together, which makes it complex and difficult to configure the network according to predefined security policies, and to adaptively respond to various dynamic security threats. Software-Defined Wireless Mesh Networks decouple the control plane and data plane of routers and thus enable a more flexible and efficient configuration of security policies. Taking up this opportunity to address the aforementioned challenges, this paper proposes a privacy-aware, secure and energy-aware green routing (PSGR) protocol that can defend against internal attacks, achieve stronger privacy protection and reduce energy consumption in Software-Defined HWMNs. The elaborate theoretical analysis verify that the PSGR protocol can implement the security and privacy protection against internal attacks effectively and efficiently. Simulation results demonstrate a superior performance of PSGR in terms of packet delivery ratio, network throughput and energy efficiency compared to the existing PA-SHWMP, PASER, and HWMP protocols in the presence of Blackhole/Grayhole attacks and wormhole attacks.

Energy-Aware Forwarding Strategies for Delay Tolerant Network Routing Protocols

Delay Tolerant Networking (DTN) is well suited to challenging environments, defined by the lack of reliable end-to-end communication paths to the destination. However, the available energy is not considered in the majority of existing DTN routing protocols when they make forwarding decisions. This limits both delivery probabilities and the network lifetimes in energy-constrained applications. This paper investigates energy-aware routing protocols for wildlife tracking application to transmit data from attached sensors on the animal’s back to data collection base stations. We propose three new network protocol strategies to extend common DTN routing protocols, and consider the available energy to achieve efficient utilization of the node’s energy in transmission and sensing. These strategies enhance packet delivery rates up to 13% by carefully using the limited energy resources. We simulate two different animal tracking scenarios and show that the new strategies provide significant performance improvement under different scenarios.

An Adaptive Energy Aware Algorithm for Reliable Transmission Sensor Networks

Route maintenance and repair process plays an important role in mobile selforganizing network. On the basis of considering route stability and energy aware routing protocol, a new scheme is proposed in this paper. Firstly, signal strength, rest energy and port queue length are periodically and alternately detected; secondly, cross-layer method is adopted for route maintenance, and the alternate route is actively established for data transmission according to the routing repair mechanism “Make-before-Break”; finally, relevant experiment is carried out in NS2 to simulate and compare the proposed protocol and other similar routing protocols such as RSEA and LAER. The experiment result shows that the new scheme has good performance in the aspects of data packet delivery ratio, overhead control and end-to-end delay.