Efficient Reliable Routing Research Articles

Learning automata based energy efficient and reliable data delivery routing mechanism in wireless sensor networks

Wireless Sensor Networks (WSNs) emerged as major data gathering paradigm due to its wide variety of applications. Achieving energy efficient reliable data delivery is an important concern in WSNs. In a network, packet loss reduces the reliable data transmission rate. Retransmissions are required to increase the reliable data transmission rate. However, number of retransmissions also increase the network energy consumptions and packet delivery delay. Packet loss rate can be reduced by selecting a best successor node in a routing path. In this work, a Learning Automata based Routing mechanism is proposed for wireless sensor networks to achieve energy efficiency and reliable data delivery. In this paper, learning automata has been adopted to calculate next node’s selection probability in a routing path using node’s score, quality of link and previous selection probability. Further, an energy efficient reliable routing mechanism is proposed using combination of learning automata and A-star search algorithm. The proposed mechanism determines energy efficient and reliable routing paths in WSNs by favoring highest residual energy, good quality of link , more free buffer space and less distance. Finally, simulation results indicate that the proposed algorithm reduces the energy consumptions, data delivery delay, data transmissions and increases the network lifetime.

Delay aware energy efficient reliable routing for data transmission in heterogeneous mobile sink wireless sensor network

The unattended time-sensitive mobile sink(s) sensor network applications not only require longer network lifespan but also require fast and reliable data delivery to sink within bounded time to take preventive measures. In these applications, high sink mobility in large dense network may lead an overhead in terms of traffic load, collision, packet loss, delay and rapid energy consumption of nodes. Most of the routing schemes developed for time-sensitive applications do not consider all these issues in a single protocol and most of the protocols are developed for homogeneous sensor network environment. Whereas, many of these applications demand heterogeneous sensors because of the node heterogeneity benefits such as enhanced network lifetime and reliability. So, we have proposed a novel delay aware energy efficient reliable routing (i.e. DA-EERR) technique for data transmission in heterogeneous sensor environment. In the proposed scheme, restricted search space is defined for guaranteeing timely delivery of delay sensitive data. Furthermore, within the defined search space, an algorithm is developed to select an energy delay balanced path between source and sink which enables fast data delivery through an energy efficient hop. The proposed DA-EERR scheme also improves percentage of successfully received data packets at sink in large dense network by using data aggregation and by providing proper load balancing across the network.

Parameter Based Efficient & Reliable Routing Technique to Enhance Network Lifetime for Vehicular Ad Hoc Networks

Some Inherent Vehicular Ad Hoc Networks (VANETs) characteristics such as intermittent connectivity, highly dynamic topology, and hard delay constraints, make data communication a challenging task in these networks. Due to such peculiarities, in this paper we study the impact of using vehicles predicted locations as a metric for data communication in VANETs. This paper deals with PBERR (Parameter Based Efficient Reliable Routing) for VANETs, which is a multilevel routing algorithm. The focus of this algorithm is 100% data transmission from end to end with no loss or drop of data packets by selecting the reliable path. The proposed algorithm will use the data of the digital maps to limit the scope of message exchanges in the shortest path for vehicles between source and destination. Our results clearly demonstrate the efficiency of the proposed solution in different scenarios, especially in terms of Network throughput, Energy consumption and Average delay.

DSERR: Delay Sensitive Energy Efficient Reliable Routing Algorithm

Routing strategies need to strike a balance between responsiveness and energy efficiency. Achieving this balance poses new challenges that do not coalesce either with infrastructure or ad hoc wireless networks performance requirements. Multiple strategies have emerged as a workable solution to the routing problem. Either of these solutions however cater to but one of the many constraints posed by the networks. To address this issue we propose a delay sensitive energy efficient reliable routing (DSERR) algorithm which achieves application specified soft delays with energy scavenging being the foremost concern. We try to provide soft end-to-end (e2e) delay guarantee that is proportional to the distance between the source and destination. Our algorithm uses the per hop greedy selection for soft real-time guarantees as it is impossible to provide hard guarantees in a dynamic network. DSERR presents a stateless architecture providing hop by hop reliability of data delivery to support desired delivery reliability across the sensor network.

Improvement of Multicast Routing in Mobile Ad-Hoc Networks using Hybrid Link Preditiction

In mobile adhoc networks the group oriented communications is very important. Multicasting is an efficient transmission of packets to a group of zero or more hosts. We propose an efficient scalable, reliable and stable multicast routing protocol using hybrid link prediction technique. It is based on Efficient Geographic Multicast protocol EGMP. The main objective is to find scalable and stable routes that reduce the number of hosts that participates in packet forwarding in order to reduce bandwidth and energy. It can be achieved by selecting Backbone Nodes BN. To determine the back bone nodes we consider low mobility nodes in a large group of receivers. From this approach low mobility nodes can be act as BN with fewer forwarders.

Joint cost and secured node disjoint energy efficient multipath routing in mobile ad hoc network

The severe resource constraints and deployment environments of mobile ad hoc networks (MANETs) pose challenges for the security and energy consumption during data transmission for these networks. Multipath routing and energy consumption are the important factors to be considered in mobile ad hoc network as it provides a powerful tool for studying security aspects during data transmission. Advances in MANET technology have provided the availability of energy efficient reliable and multi path routing for intrusion tolerance with capability of identifying reliable routes, determining the best redundancy level to increase the operational lifetime of the network. Identifying a secured and energy efficient multipath routing for MANET represents the basic challenge during data transmission. In order to overcome such limitation, a hybrid method called as joint cost and secured node disjoint energy-efficient multipath routing (NDE-MR) is designed for MANET to reduce the energy consumption and execution time during the multipath routing and to improve security during data transfer. Node initialization initializes the mobile nodes with energy efficient model by obtaining the neighbor node data. Next, cost-based multipath route discovery model identifies the path with the least transmission cost through which data forwarding is made. Finally, security is achieved through node disjoint path model by splitting the data packets into different segments. Simulation results show that the NDE-MR model is able to reduce energy consumption and execution time during multipath routing and to increases the security of the network.

Energy Efficient Reliable Routing Considering Residual Energy in Wireless Ad Hoc Networks

Energy Efficient Reliable Routing Considering Residual Energy in Wireless Ad Hoc Networks

Cost Efficient Deployment and Reliable Routing Modeling Based Multi-Objective Optimization for Dynamic Wireless Body Sensor Networks Topology

Wireless Body Sensor Networks (WBSNs), like any other sensor networks, suffer from limited energy and are highly distributed network, where its nodes organize by themselves and each of them has the flexibility of collecting and transmitting patient biomedical information to a sink. When a knowledge was sent to a sink from a path that doesn't have a definite basis, the routing is a crucial challenge in Wireless Body Area Sensor Networks. Furthermore, reliability and routing delay are the considerable factors in these types of networks. More attention should be given to the energy routing issue and frequent topology's change in WBSNs. That increases the dynamics of network topology, and complicates the relay selection process in cooperative communications. Unreliable communication over the wireless channel complicates communication protocols and results in low data yield (Stathopoulos 2005). The deployment sensors step is a crucial and complex task due to several independent objectives and constraints. This paper presents a Min-Max multi-commodity flow model for WBSNs which allows preventing sensor node saturation and taking best action against reliability and the path loss, by imposing an equilibrium use of sensors during the routing process. This model is based on the authors' optimal sensors deployment method for WBSNs. Simulations results show that the algorithm balances the energy consumption of nodes effectively and maximize the network lifetime. It will meet the enhanced WBSNs requirements, including better delivery ratio, less reliable routing overhead.

Reliable and Energy-Efficient Routing for Static Wireless Ad Hoc Networks with Unreliable Links

Energy efficient routing and power control techniques in wireless ad hoc networks have drawn considerable research interests recently. In this paper, we address the problem of energy efficient reliable routing for wireless ad hoc networks in the presence of unreliable communication links or devices or lossy wireless link layers by integrating the power control techniques into the energy efficient routing. We consider both the case when the link layer implements a perfect reliability and the case when the reliability is implemented through the transport layer, e.g., TCP. We study the energy efficient unicast and multicast when the links are unreliable. Subsequently, we study how to perform power control (thus, controlling the reliability of each communication link) such that the unicast routings use the least power when the communication links are unreliable, while the power used by multicast is close to optimum. Extensive simulations have been conducted to study the power consumption, the end-to-end delay, and the network throughput of our proposed protocols compared with existing protocols.

Power-Efficient Reliable Routing Protocol for Mobile Ad-Hoc Networks

Since mobile ad-hoc networks have certain constraints, including power shortages, an unstable wireless environment, and node mobility, more power-efficient and reliable routing protocols are needed. Accordingly, this paper propose a new routing protocol, PERRA (Power Efficient Reliable Routing protocol for mobile Ad-hoc networks), that includes the advantages of on-demand protocols, while also providing power- efficient and reliable packet transmission. PERRA uses a new cost function to select the optimum path based on considering the minimum residual energy of the nodes on a path, the total energy consumed by a path to transmit and process a packet, and the path's stability in accordance with the node mobility. As a result, the proposed method increases the power efficiency, decreases the route-reconstructions due to residual power shortages and node mobility, and provides effective route maintenance mechanisms. The performance of PERRA is evaluated by simulations under various conditions.